Solving problems on concurrent processors
Solving problems on concurrent processors
A general concurrent algorithm for plasma particle-in-cell simulation codes
Journal of Computational Physics
Dynamic load balancing for a 2D concurrent plasma PIC code
Journal of Computational Physics
A manual for the CHAOS runtime library
A manual for the CHAOS runtime library
Object-oriented parallel computation for plasma simulation
Communications of the ACM - Special issue on object-oriented experiences and future trends
Particle-in-cell simulation codes in High Performance Fortran
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Parallel PIC plasma simulation through particle decomposition techniques
Parallel Computing
ICS '01 Proceedings of the 15th international conference on Supercomputing
Plasma Physics Via Computer
Parallelizing Irregular Applications with the Vienna HPF+ Compiler VFC
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Preliminary insights on shared memory PIC code performance on the Convex Exemplar SPP1000
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
High Performance Fortran: Language Specification (PART II)
ACM SIGPLAN Fortran Forum - Special issue: high performance Fortran language specification, part 2
Hi-index | 0.00 |
A crucial issue in parallel programming (both for distributed and shared memory architectures) is work decomposition. Work decomposition task can be accomplished without large programming effort with use of high-level parallel programming languages, such as OpenMP. Anyway particular care must still be payed on achieving performance goals. In this paper we introduce and compare two decomposition strategies, in the framework of shared memory systems, as applied to a case study particle in cell application. A number of different implementations of them, based on the OpenMP language, are discussed with regard to time efficiency, memory occupancy, and program restructuring effort.