Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMaier, Patricken_UK
dc.contributor.authorStewart, Roberten_UK
dc.contributor.authorTrinder, Phil Wen_UK
dc.description.abstractSymbolic 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 (SGP) 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 SymGridPar2 (SGP2), a successor to SymGridPar that is designed to provide scalability onto 105 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, including weak scaling to about 32,000 cores, and investigate the overheads of tolerating faults for simple symbolic computations.en_UK
dc.publisherElsevier BVen_UK
dc.relationMaier P, Stewart R & Trinder PW (2014) Reliable scalable symbolic computation: The design of SymGridPar2. 28th ACM Symposium on Applied Computing, Coimbra, Portugal. Computer Languages, Systems & Structures, 40 (1), pp. 19-35.
dc.rightsAccepted refereed manuscript of: Maier P, Stewart R & Trinder PW (2014) Reliable scalable symbolic computation: The design of SymGridPar2. 28th ACM Symposium on Applied Computing, Coimbra, Portugal. Computer Languages, Systems & Structures, 40 (1), pp. 19-35. DOI: © 2014, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
dc.subjectParallel functional programmingen_UK
dc.subjectlocality controlen_UK
dc.subjectfault toleranceen_UK
dc.titleReliable scalable symbolic computation: The design of SymGridPar2en_UK
dc.typeConference Paperen_UK
dc.citation.jtitleComputer Languages, Systems and Structuresen_UK
dc.type.statusAM - Accepted Manuscripten_UK
dc.contributor.funderEngineering and Physical Sciences Research Councilen_UK
dc.citation.conferencelocationCoimbra, Portugalen_UK
dc.citation.conferencename28th ACM Symposium on Applied Computingen_UK
dc.contributor.affiliationUniversity of Glasgowen_UK
dc.contributor.affiliationHeriot-Watt Universityen_UK
dc.contributor.affiliationUniversity of Glasgowen_UK
dc.description.refREF Compliant by Deposit in Stirling's Repositoryen_UK
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings

Files in This Item:
File Description SizeFormat 
Maier_Stewart_Trinder_COMLAN2014_preprint.pdfFulltext - Accepted Version430.12 kBAdobe PDFView/Open

This item is protected by original copyright

A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.