Parallelism without pain: Orchestrating computational algebra components into a high-performance parallel system

A. D. Al Zain, P. W. Trinder, K. Hammond, A. Konovalov, S. Linton, J. Berthold

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

This paper describes a very high-level approach that aims to orchestrate sequential components written using high-level domain-specific programming into high- performance parallel applications. By achieving this goal, we hope to make parallel programming more accessible to experts in mathematics, engineering and other domains. A key feature of our approach is that parallelism is achieved without any modification to the underlying sequential computational algebra systems, or to the user-level components: rather, all orchestration is performed at an outer level, with sequential components linked through a standard communication protocol, the Symbolic Computing Software Composability Protocol, SCSCP. Despite the generality of our approach, our results show that we are able to achieve very good, and even, in some cases, super-linear, speedups on clusters of commodity workstations: up to a factor of 33.4 on a 28-processor cluster. We are, moreover, able to parallelise a wider variety of problem, and achieve higher performance than typical specialist parallel computational algebra implementations. © 2008 IEEE.

Original languageEnglish
Title of host publicationProceedings of the 2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008
Pages99-112
Number of pages14
DOIs
Publication statusPublished - 2008
Event2008 IEEE/WIC/ACM International Conference on Web Intelligence - Sydney, NSW, Australia
Duration: 9 Dec 200812 Dec 2008

Conference

Conference2008 IEEE/WIC/ACM International Conference on Web Intelligence
Abbreviated titleWI 2008
CountryAustralia
CitySydney, NSW
Period9/12/0812/12/08

Fingerprint Dive into the research topics of 'Parallelism without pain: Orchestrating computational algebra components into a high-performance parallel system'. Together they form a unique fingerprint.

  • Cite this

    Al Zain, A. D., Trinder, P. W., Hammond, K., Konovalov, A., Linton, S., & Berthold, J. (2008). Parallelism without pain: Orchestrating computational algebra components into a high-performance parallel system. In Proceedings of the 2008 International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008 (pp. 99-112) https://doi.org/10.1109/ISPA.2008.19