dc.contributor.author | Grelck, C. | |
dc.contributor.author | Scholz, S. | |
dc.date.accessioned | 2011-01-27T11:38:52Z | |
dc.date.available | 2011-01-27T11:38:52Z | |
dc.date.issued | 2003 | |
dc.identifier.citation | Grelck , C & Scholz , S 2003 , ' SaC -- from high-level programming with arrays to efficient parallel execution ' , Parallel Processing Letters , vol. 13 , no. 3 , pp. 401-412 . https://doi.org/10.1142/S0129626403001379 | |
dc.identifier.issn | 0129-6264 | |
dc.identifier.other | dspace: 2299/5239 | |
dc.identifier.uri | http://hdl.handle.net/2299/5239 | |
dc.description | Original article is available at: http://www.worldscinet.com Copyright World Scientific Publishing Company [Full text of this article is not available in the UHRA] | |
dc.description.abstract | SAC is a purely functional array processing language designed with numerical applications in mind. It supports generic, high-level program specifications in the style of APL. However, rather than providing a fixed set of built-in array operations, SAC provides means to specify such operations in the language itself in a way that still allows their application to arrays of any rank and size. This paper illustrates the major steps in compiling generic, rank- and shape-invariant SAC specifications into efficiently executable multithreaded code for parallel execution on shared memory multiprocessors. The effectiveness of the compilation techniques is demonstrated by means of a small case study on the PDE1 benchmark, which implements 3-dimensional red/black successive over-relaxation. Comparisons with HPF and ZPL show that despite the genericity of code, SAC achieves highly competitive runtime performance characteristics. | en |
dc.language.iso | eng | |
dc.relation.ispartof | Parallel Processing Letters | |
dc.subject | Computer science | |
dc.subject | array programming | |
dc.subject | high-level parallel programming | |
dc.subject | high performance computing | |
dc.title | SaC -- from high-level programming with arrays to efficient parallel execution | en |
dc.contributor.institution | School of Computer Science | |
dc.description.status | Peer reviewed | |
rioxxterms.versionofrecord | 10.1142/S0129626403001379 | |
rioxxterms.type | Journal Article/Review | |
herts.preservation.rarelyaccessed | true | |