Show simple item record

Efficient Support for Irregular Applications on Distributed Memory Machines.

dc.contributor.authorMukherjee, Shubhendu S.en_US
dc.contributor.authorSharma, Shamik D.en_US
dc.contributor.authorHill, Mark D.en_US
dc.contributor.authorLarus, James R.en_US
dc.contributor.authorRogers, Anneen_US
dc.contributor.authorSaltz, Joelen_US
dc.description.abstractIrregular computation problems underlie many important scientific applications. Although these problems are computationally expensive, and so would seem appropriate for parallel machines, their irregular and unpredictable run-time behavior makes this type of parallel program difficult to write and adversely affects run-time performance. This paper explores three issues---partitioning, mutual exclusion, and data transfer---crucial to the efficient execution of irregular problems on distributed-memory machines. Unlike previous work, we studied the same programs running in three alternative systems on the same hardware base (a Thinking Machines CM-5): the CHAOS irregular application library, Transparent Shared Memory (TSM), and eXtensible Shared Memory (XSM). CHAOS and XSM performed equivalently for all three applications. Both systems were somewhat (13%) to significantly faster (991%) than TSM. (Also cross-referenced as UMIACS-TR-95-46)en_US
dc.format.extent547841 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3453en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-46en_US
dc.titleEfficient Support for Irregular Applications on Distributed Memory Machines.en_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record