Show simple item record

dc.contributor.authorMohr, Ericen_US
dc.contributor.authorKranz, Daviden_US
dc.contributor.authorHalsteaden_US
dc.contributor.authorRobert H., Jr.en_US
dc.date.accessioned2023-03-29T14:34:59Z
dc.date.available2023-03-29T14:34:59Z
dc.date.issued1991-06
dc.identifier.urihttps://hdl.handle.net/1721.1/149176
dc.description.abstractMany parallel algorithms are naturally expressed at a fine level of granularity, often finer than MIMD parallel system can exploit efficiently. Most builders of parallel systems have looked to either the programmer or a parallelizing compiler to increase the granularity of such algorithms. In this paper we explore a third approach to the granularity problem by analyzing two strategies for combining parallel tasks dynamically at run-time.en_US
dc.relation.ispartofseriesMIT-LCS-TM-449
dc.titleLazy Task Creation: A Technique for Increasing the Granularity of Parallel Programsen_US
dc.identifier.oclc24101703


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record