A bridging model for parallel computation
Communications of the ACM
Strand: new concepts in parallel programming
Strand: new concepts in parallel programming
Retire Fortran?: a debate rekindled
Communications of the ACM
Implementation of a portable nested data-parallel language
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A threshold scheduling strategy for Sisal on distributed memory machines
Journal of Parallel and Distributed Computing
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
Overture: an object-oriented framework for high performance scientific computing
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Loci: A Deductive Framework for Graph-Based Algorithms
ISCOPE '99 Proceedings of the Third International Symposium on Computing in Object-Oriented Parallel Environments
Merging the CCA Component Model with the OGSI Framework
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
The Eden Coordination Model for Distributed Memory Systems
HIPS '97 Proceedings of the 1997 Workshop on High-Level Programming Models and Supportive Environments (HIPS '97)
Toward a Common Component Architecture for High-Performance Scientific Computing
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
The Cactus Code: A Problem Solving Environment for the Grid
HPDC '00 Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing
Parallel and Distributed Haskells
Journal of Functional Programming
Algorithm + strategy = parallelism
Journal of Functional Programming
Dynamic memory management in the loci framework
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Hi-index | 0.00 |
We present a rule-based framework for the development of scalable parallel high performance simulations for a broad class of scientific applications (with particular emphasis on continuum mechanics). We take a pragmatic approach to our programming abstractions by implementing structures that are used frequently and have common high performance implementations on distributed memory architectures. The resulting framework borrows heavily from rule-based systems for relational database models, however limiting the scope to those parts that have obvious high performance implementation. Using our approach, we demonstrate predictable performance behavior and efficient utilization of large scale distributed memory architectures on problems of significant complexity involving multiple disciplines.