Filters








131 Hits in 2.1 sec

An Evaluation of High Performance Fortran Compilers Using the HPFBench Benchmark Suite [chapter]

Guohua Jin, Y. Charlie Hu
1999 Lecture Notes in Computer Science  
In this paper, we report on an evaluation of two commercial HPF compilers, namely, xlhpf from IBM and pghpf from PGI, on an IBM SP2 using the linear algebra subset of the HPFBench benchmarks.  ...  The High Performance Fortran (HPF) benchmark suite HPF-Bench was designed for evaluating the HPF language and compilers on scalable architectures.  ...  Methodology This paper evaluates two commercial HPF compilers on an IBM SP2.  ... 
doi:10.1007/3-540-48311-x_30 fatcat:tl3zvgyawzgl7lchj6addbkxsa

Efficient parallel implementations of near Delaunay triangulation with High Performance Fortran

Min-Bin Chen, Tyng-Ruey Chuang, Jan-Jan Wu
2004 Concurrency and Computation  
Experimental results on several parallel platforms, including an IBM SP2 and a DEC Alpha farm, show that a parallel efficiency of 42-86% can be achieved for an eight-node distributed memory system.  ...  The sub-block triangulation is a divide & conquer Delaunay algorithm known for its sequential efficiency, and the boundary triangulation is an incremental construction algorithm with low overhead.  ...  ACKNOWLEDGEMENTS We thank the anonymous referees, for providing helpful suggestions that improved the quality of this paper.  ... 
doi:10.1002/cpe.802 fatcat:6zrgtyfluzhwtpt6ikkejth7p4

HPF and Numerical Libraries [chapter]

Harald J. Ehold, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber
1999 Lecture Notes in Computer Science  
The methods suggested utilize HPF's EXTRINSIC mechanism and are independent of implementation details of HPF compilers. Two prototypical examples are used to illustrate these techniques.  ...  Portable and efficient ways for calling numerical high performance software libraries from HPF programs are investigated.  ...  We would like to thank John Merlin (VCPC, Vienna) for his helpful comments, his experienced interpretation of the HPF standard, and for proofreading the paper.  ... 
doi:10.1007/3-540-49164-3_14 fatcat:q6tex7ndnjamngtix7joue3fna

Page 402 of SPE Reservoir Evaluation & Engineering Vol. 1, Issue 5 [page]

1998 SPE Reservoir Evaluation & Engineering  
IBM’s HPF compiler is at this point unable to compile and suc- cessfully run a complex code such as Falcon.  ...  One can see that Falcon runs a small problem on a PC nearly as fast as GCOMP on an IBM RISC 6000/590 workstation.  ... 

Scalable parallel computers for real-time signal processing

Kai Hwang, Zhiwei Xu
1996 IEEE Signal Processing Magazine  
In particular, we evaluate the IBM SP2 at MHPCC [33], the Intel Paragon at SDSC [38], the Cray T3D at Cray Eagan Center [I], and the Cray T3E and ASCI TeraFLOP system recently proposed by Intel [32].  ...  On the software and programming side, we evaluate existing parallel programming environments, including the models, languages, compilers, software tools, and operating systems.  ...  The Project was supported by a research subcontract from MIT Lincoln Laboratory to USC. The revision of the paper was done a t the Universily of Hong Kong, subsequently. We  ... 
doi:10.1109/79.526898 fatcat:lqng5sb2rvei5jedkzgkl5jz6y

Parallel Implementation of the PHOENIX Generalized Stellar Atmosphere Program

Peter H. Hauschildt, E. Baron, France Allard
1997 Astrophysical Journal  
We discuss the parallel algorithms we have developed for radiative transfer, spectral line opacity, and NLTE opacity and rate calculations.  ...  We report the results of test calculations on a number of different parallel computers and discuss the results of scalability tests.  ...  IBM SP2 The IBM SP2 is a distributed memory machine based on the IBM Power2 chipset.  ... 
doi:10.1086/304233 fatcat:xpqrnwav2raydezevdpre7ykpa

HPFBench: a high performance Fortran benchmark suite

Y. Charlie Hu, Guohua Jin, S. Lennart Johnsson, Dimitris Kehagias, Nadia Shalaby
2000 ACM Transactions on Mathematical Software  
Furthermore, we report an evaluation of an industry-leading HPF compiler from the Portland Group Inc. using the HPFBench benchmarks on the distributed-memory IBM SP2.  ...  We also provide a benchmark guide to aid the choice of subsets of the benchmarks for evaluating particular aspects of an HPF compiler.  ...  [IBM 1996 ] for the IBM SP2.  ... 
doi:10.1145/347837.347872 fatcat:uufmly6xovc7zegukmtpgfhmzy

Towards automatic translation of OpenMP to MPI

Ayon Basumallik, Rudolf Eigenmann
2005 Proceedings of the 19th annual international conference on Supercomputing - ICS '05  
We present compiler techniques for translating OpenMP shared-memory parallel applications into MPI message-passing programs for execution on distributed memory systems.  ...  A comparison with High Performance Fortran (HPF) versions of two NAS benchmarks indicates that our translated OpenMP versions achieve 12% to 89% better performance than the HPF versions.  ...  The MPI libraries used for these platforms is MPICH version 1.2.5 on Linux and IBM MPI libraries on the IBM SP2.  ... 
doi:10.1145/1088149.1088174 dblp:conf/ics/BasumallikE05 fatcat:nh3haoritfayjhkpbjvsd5eaay

Optimizing irregular HPF applications using halos

Siegfried Benkner
2000 Concurrency Practice and Experience  
Performance results of a kernel from a crash simulation code on the NEC Cenju-4, the IBM SP2, and on the NEC SX-4 show that by using the proposed extensions a performance close to hand-coded message-passing  ...  Using these features crucial optimization techniques required for an e cient parallelization of irregular applications may b e applied.  ...  The provision of halos enables the compiler to apply crucial compile-time and or runtime optimization techniques required for an e cient parallelization of irregular applications.  ... 
doi:10.1002/(sici)1096-9128(200002/03)12:2/3<137::aid-cpe468>3.3.co;2-4 fatcat:yfjzh3mr2zepzkdp5j736h4uwa

Optimizing irregular HPF applications using halos [chapter]

Siegfried Benkner
1999 Lecture Notes in Computer Science  
Performance results of a kernel from a crash simulation code on the NEC Cenju-4, the IBM SP2, and on the NEC SX-4 show that by using the proposed extensions a performance close to hand-coded message-passing  ...  Using these features crucial optimization techniques required for an e cient parallelization of irregular applications may b e applied.  ...  The provision of halos enables the compiler to apply crucial compile-time and or runtime optimization techniques required for an e cient parallelization of irregular applications.  ... 
doi:10.1007/bfb0097986 fatcat:xewl2tg3xfhijpo4crepwk6bbu

Optimizing irregular HPF applications using halos

Siegfried Benkner
2000 Concurrency Practice and Experience  
Performance results of a kernel from a crash simulation code on the NEC Cenju-4, the IBM SP2, and on the NEC SX-4 show that by using the proposed extensions a performance close to hand-coded message-passing  ...  Using these features crucial optimization techniques required for an e cient parallelization of irregular applications may b e applied.  ...  The provision of halos enables the compiler to apply crucial compile-time and or runtime optimization techniques required for an e cient parallelization of irregular applications.  ... 
doi:10.1002/(sici)1096-9128(200002/03)12:2/3<137::aid-cpe468>3.0.co;2-d fatcat:dibb7vjzcrgpxginzf3l7nvmxu

Double standards

Ian Foster, David R. Kohr, Rakesh Krishnaiyer, Alok Choudhary
1996 Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '96  
in HPF without requiring complex compiler technology.  ...  DISCLAIMER This report was prepared as an account of work sponsored by an agency of the United States Government Neither the United States Government nor any agency thereof, nor any of their employees,  ...  Acknowledgments We are grateful to the Portland Group, Inc., for making their HPF compiler and runtime system available to us for this research, and to Shankar Ramaswamy and Prith Banerjee for allowing  ... 
doi:10.1145/369028.369104 fatcat:ihgiw2qvgzfn7ihos7ilcywi2m

A scalable HPF implementation of a finite-volume computational electromagnetics application on a CRAY T3E parallel system

Yi Pan, Joseph J. S. Shang, Minyi Guo
2003 Concurrency and Computation  
In this paper, we discuss an efficient and scalable parallelization of the sequential Fortran time-dependent Maxwell equations solver using High Performance Fortran (HPF).  ...  The code is scalable up to 98 processors on the Cray T3E and has a performance similar to that of an MPI implementation.  ...  We would also like to thank Mark Young of Portland Group for his help in using PGI's High Performance Fortran compiler pghpf.  ... 
doi:10.1002/cpe.718 fatcat:vpcoj7d2incibovvwtopmlbkxy

PCRC-based HPF compilation [chapter]

Guansong Zhang, Bryan Carpenter, Geoffrey Fox, Xiaoming Li, Xinying Li, Yuhong Wen
1998 Lecture Notes in Computer Science  
In particular, we d i scuess the design and implementation of an HPF compilation system based on PCRC runtime.  ...  This paper describes an ongoing e ort supported by ARPA PCRC (Parallel Compiler Runtime Consortium) project.  ...  (Speedup is relative to an equivalent sequential program compiled with the IBM Fortran compiler.)  ... 
doi:10.1007/bfb0032693 fatcat:u4wkccj4yradhefz7hcnesl2zm

A Library-Based Approach to Task Parallelism in a Data-Parallel Language

Ian Foster, David R. Kohr, Rakesh Krishnaiyer, Alok Choudhary
1997 Journal of Parallel and Distributed Computing  
in HPF without requiring complex compiler technology.  ...  Pure data-parallel languages such as High Performance Fortran version 1 (HPF) do not allow efficient expression of mixed task/data-parallel computations or the coupling of separately compiled data-parallel  ...  ACKNOWLEDGMENTS We are grateful to the Portland Group, Inc., for making their HPF compiler and runtime system available to us for this research, and to Shankar Ramaswamy and Prith Banerjee for allowing  ... 
doi:10.1006/jpdc.1997.1367 fatcat:jj42q5icdfesbosgm7guwrtmc4
« Previous Showing results 1 — 15 out of 131 results