dc.contributor.author | Cann, D. C. | en |
dc.contributor.author | Evripidou, Paraskevas | en |
dc.creator | Cann, D. C. | en |
dc.creator | Evripidou, Paraskevas | en |
dc.date.accessioned | 2019-11-13T10:38:51Z | |
dc.date.available | 2019-11-13T10:38:51Z | |
dc.date.issued | 1995 | |
dc.identifier.issn | 1045-9219 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53675 | |
dc.description.abstract | In this paper, we discuss and evaluate three opti- mizations for reducing memory management overhead and data copying costs in SISAL 1.2 programs that build arrays. The first, called framework preconstruction, eliminates superfluous allocate-deallocate sequences in cyclic computations. The second, called aggregate storage subsumption, reduces the management overhead for compound array components. The third, called predictive storage preallocation, eliminates superfluous data copying in filtered array constructions and simplifies their parallelization. We have added all three optimizations to the Optimizing SISAL Compiler with rewarding improvements in SISAL program performance on vector-parallel machines such as those built by Cray Computer Corporation, Convex, and Cray Research. © 1995 IEEE | en |
dc.source | IEEE Transactions on Parallel and Distributed Systems | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0029267529&doi=10.1109%2f71.372771&partnerID=40&md5=122a8e6348e647b5df8201bf9d984b0d | |
dc.subject | Optimization | en |
dc.subject | Vectors | en |
dc.subject | Parallel processing systems | en |
dc.subject | Computer programming languages | en |
dc.subject | Program compilers | en |
dc.subject | Advanced array optimizations | en |
dc.subject | arrays | en |
dc.subject | Cellular arrays | en |
dc.subject | copy elimination | en |
dc.subject | Cyclic computations | en |
dc.subject | Functional languages | en |
dc.subject | imperative languages | en |
dc.subject | parallel computing | en |
dc.subject | Parallelization | en |
dc.subject | Storage allocation (computer) | en |
dc.subject | Storage optimization | en |
dc.subject | storage optimizations | en |
dc.subject | vector computing | en |
dc.title | Advanced Array Optimizations for High Performance Functional Languages | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/71.372771 | |
dc.description.volume | 6 | |
dc.description.issue | 3 | |
dc.description.startingpage | 229 | |
dc.description.endingpage | 239 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Cited By :9</p> | en |
dc.source.abbreviation | IEEE Trans.Parallel Distrib.Syst. | en |
dc.contributor.orcid | Evripidou, Paraskevas [0000-0002-2335-9505] | |
dc.gnosis.orcid | 0000-0002-2335-9505 | |