ALBERT

Description: Author(s): Jia-An Yan, J. A. Driscoll, B. K. Wyatt, K. Varga, and S. T. Pantelides [Phys. Rev. B 84, 224117] Published Tue Dec 27, 2011

Description: Author(s): K. L. Yang, Y. Zhang, S. H. Zheng, L. Lin, Z. B. Yan, J.-M. Liu, and S.-W. Cheong Controlling and manipulating the topological state represents an important topic in condensed matters for both fundamental researches and applications. In this work, we focus on the evolution of a real-space topological domain structure in hexagonal manganites driven by electric field, using the ana... [Phys. Rev. B 96, 144103] Published Mon Oct 09, 2017

Description: Author(s): K. L. Yang, Y. Zhang, S. H. Zheng, L. Lin, Z. B. Yan, J.-M. Liu, and S.-W. Cheong The domain structure of hexagonal manganites is simulated based on the phenomenological Ginzburg-Landau theory, and special attention is paid to the evolution of a topological vortex-antivortex pattern with the varying out-of-plane anisotropies of two stiffness parameters for the in-plane ( x y -plane)… [Phys. Rev. B 95, 024114] Published Fri Jan 27, 2017

Description: Author(s): S. Yano, Despina Louca, J. C. Neuefeind, J.-Q. Yan, J.-S. Zhou, and J. B. Goodenough The effects of isovalent doping on orbital ordering in the perovskite Y 1−x La x VO 3 were investigated using neutron diffraction and the pair distribution function analysis. YVO 3 is a prototype for orbital ordering, exhibiting two consecutive transitions to G-type and C-type ordering with decreasing tem... [Phys. Rev. B 90, 214111] Published Wed Dec 31, 2014

Description: Porting applications to new high performance parallel and distributed platforms is a challenging task. Writing parallel code by hand is time consuming and costly, but this task can be simplified by high level languages and would even better be automated by parallelizing tools and compilers. The definition of HPF (High Performance Fortran, based on data parallel model) and OpenMP (based on shared memory parallel model) standards has offered great opportunity in this respect. Both provide simple and clear interfaces to language like FORTRAN and simplify many tedious tasks encountered in writing message passing programs. In our study, we implemented the parallel versions of the NAS Benchmarks with HPF and OpenMP directives. Comparison of their performance with the MPI implementation and pros and cons of different approaches will be discussed along with experience of using computer-aided tools to help parallelize these benchmarks. Based on the study, potentials of applying some of the techniques to realistic aerospace applications will be presented.

Description: The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. Historically, the lack of a programming standard for using directives and the rather limited performance due to scalability have affected the take-up of this programming model approach. Significant progress has been made in hardware and software technologies, as a result the performance of parallel programs with compiler directives has also made improvements. The introduction of an industrial standard for shared-memory programming with directives, OpenMP, has also addressed the issue of portability. In this study, we have extended the computer aided parallelization toolkit (developed at the University of Greenwich), to automatically generate OpenMP based parallel programs with nominal user assistance. We outline the way in which loop types are categorized and how efficient OpenMP directives can be defined and placed using the in-depth interprocedural analysis that is carried out by the toolkit. We also discuss the application of the toolkit on the NAS Parallel Benchmarks and a number of real-world application codes. This work not only demonstrates the great potential of using the toolkit to quickly parallelize serial programs but also the good performance achievable on up to 300 processors for hybrid message passing and directive-based parallelizations.

Description: Over the past decade, high performance computing has evolved rapidly, not only in hardware architectures but also with increasing complexity of real applications. Technologies have been developing to aim at scaling up to thousands of processors on both distributed and shared memory systems. Development of parallel programs on these computers is always a challenging task. Today, writing parallel programs with message passing (e.g. MPI) is the most popular way of achieving scalability and high performance. However, writing message passing programs is difficult and error prone. Recent years new effort has been made in defining new parallel programming paradigms. The best examples are: HPF (based on data parallelism) and OpenMP (based on shared memory parallelism). Both provide simple and clear extensions to sequential programs, thus greatly simplify the tedious tasks encountered in writing message passing programs. HPF is independent of memory hierarchy, however, due to the immaturity of compiler technology its performance is still questionable. Although use of parallel compiler directives is not new, OpenMP offers a portable solution in the shared-memory domain. Another important development involves the tremendous progress in the internet and its associated technology. Although still in its infancy, Java promisses portability in a heterogeneous environment and offers possibility to "compile once and run anywhere." In light of testing these new technologies, we implemented new parallel versions of the NAS Parallel Benchmarks (NPBs) with HPF and OpenMP directives, and extended the work with Java and Java-threads. The purpose of this study is to examine the effectiveness of alternative programming paradigms. NPBs consist of five kernels and three simulated applications that mimic the computation and data movement of large scale computational fluid dynamics (CFD) applications. We started with the serial version included in NPB2.3. Optimization of memory and cache usage was applied to several benchmarks, noticeably BT and SP, resulting in better sequential performance. In order to overcome the lack of an HPF performance model and guide the development of the HPF codes, we employed an empirical performance model for several primitives found in the benchmarks. We encountered a few limitations of HPF, such as lack of supporting the "REDISTRIBUTION" directive and no easy way to handle irregular computation. The parallelization with OpenMP directives was done at the outer-most loop level to achieve the largest granularity. The performance of six HPF and OpenMP benchmarks is compared with their MPI counterparts for the Class-A problem size in the figure in next page. These results were obtained on an SGI Origin2000 (195MHz) with MIPSpro-f77 compiler 7.2.1 for OpenMP and MPI codes and PGI pghpf-2.4.3 compiler with MPI interface for HPF programs.