Algorithmic skeletons: structured management of parallel computation
Algorithmic skeletons: structured management of parallel computation
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Computer Algebra and Parallelism: Proceedings, Second International Workshop, Ithaca, USA, May 9-11, 1990
PARSAC-2: A Parallel SAC-2 Based on Threads
AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Parallel functional programming in Eden
Journal of Functional Programming
Fault Tolerance in Message Passing Interface Programs
International Journal of High Performance Computing Applications
Proceedings of the 2007 international workshop on Parallel symbolic computation
International Symposium on Symbolic and Algebraic Computation
Proceedings of the 4th workshop on Declarative aspects of multicore programming
International Journal of High Performance Computing Applications
Granularity-Aware Work-Stealing for Computationally-Uniform Grids
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
A monad for deterministic parallelism
Proceedings of the 4th ACM symposium on Haskell
Journal of Symbolic Computation
Implementing a high-level distributed-memory parallel haskell in haskell
IFL'11 Proceedings of the 23rd international conference on Implementation and Application of Functional Languages
Hi-index | 0.00 |
Symbolic computation is an important area of both Mathematics and Computer Science, with many large computations that would benefit from parallel execution. Symbolic computations are, however, challenging to parallelise as they have complex data and control structures, and both dynamic and highly irregular parallelism. The SymGridPar framework has been developed to address these challenges on small-scale parallel architectures. However the multicore revolution means that the number of cores and the number of failures are growing exponentially, and that the communication topology is becoming increasingly complex. Hence an improved parallel symbolic computation framework is required. This paper presents the design and initial evaluation of SymGrid-Par2 (SGP2), a successor to SymGridPar that is designed to provide scalability onto 106 cores, and hence also provide fault tolerance. We present the SGP2 design goals, principles and architecture. We describe how scalability is achieved using layering and by allowing the programmer to control task placement. We outline how fault tolerance is provided by supervising remote computations, and outline higher-level fault tolerance abstractions. We describe the SGP2 implementation status and development plans. We report the scalability and efficiency on approximately 2000 cores, and investigate the overheads of tolerating faults for simple symbolic computations.