Existing work that deals with parallelization of complicated reductions and scans focuses only on formalism and hardly dealt with implementation. To bridge the gap between formalism and implementation, we have integrated parallelization via matrix multiplication into compiler construction. Our framework can deal with complicated loops that existing techniques in compilers cannot parallelize. Moreover, we have sophisticated our framework by developing two sets of techniques. One enhances its capability for parallelization by extracting max-operators automatically, and the other improves the performance of parallelized programs by eliminating redundancy. We have also implemented our framework and techniques as a parallelizer in a compiler. Experiments on examples that existing compilers cannot parallelize have demonstrated the scalability of programs parallelized by our implementation.

No abstract

To see how different foods were selected depending on family-togetherness at breakfast and dinner, we investigated the meals of eight thousand primary and four thousand junior high school students by questionnaire. About 70% of primary school children but less than 50% of junior high school children ate breakfast with their family. The food, eaten by children who ate meals together with their family, took more time for cooking and was more traditional with rice as the staple. Food eaten by children who did not eat with their family lacked both preparation time and staple base. Family-togetherness affects the foods of primary school children more than those of junior high school students.

Existing work that deals with parallelization of complicated reductions and scans focuses only on formalism and hardly dealt with implementation. To bridge the gap between formalism and implementation, we have integrated parallelization via matrix multiplication into compiler construction. Our framework can deal with complicated loops that existing techniques in compilers cannot parallelize. Moreover, we have sophisticated our framework by developing two sets of techniques. One enhances its capability for parallelization by extracting max-operators automatically, and the other improves the performance of parallelized programs by eliminating redundancy. We have also implemented our framework and techniques as a parallelizer in a compiler. Experiments on examples that existing compilers cannot parallelize have demonstrated the scalability of programs parallelized by our implementation.

This paper describes our proposed measurement technique for the magnetization dynamics in thin films, which employs a microstripe line probe to detect ferromagnetic resonance (FMR) spectra for a film sample either with or without tensile stress. By measurement of FMR frequency shifts using Lorentzian fits to the FMR spectra for a film with and without tensile stress, saturation magnetostriction (λs) can be determined. The measured values were compared with those estimated by the optical cantilever method using the same samples in good agreement. At the same time, a Gilbert damping constant (α) was determined using both the FMR frequency and the FMR linewidth for the tensile stress free film. The results of the experiment demonstrate that our proposed measurement technique allows for more precise evaluation of magnetization dynamics by providing information on both α and λs simultaneously for an individual sample.

No abstract

No abstract

A practical and promising approach to parallelizing XPath queries was proposed by Bordawekar et al. in 2009, which enables parallelization on top of existing XML database engines. Although they experimentally demonstrated the speedup by their approach, their practice has already been out of date because the software environment has largely changed with the capability of XQuery processing. In this work, we implement their approach in two ways on top of a state-of-the-art XML database engine and experimentally demonstrate that our implementations can bring significant speedup on a commodity server.