Show simple item record

dc.contributor.authorLiu, J.
dc.contributor.authorSaletore, V.A.
dc.contributor.authorLewis, T.G.
dc.date.accessioned2019-01-24T20:11:51Z
dc.date.available2019-01-24T20:11:51Z
dc.date.issued1994-12-01
dc.identifier.citationJournal Name: International Journal of Parallel Programming; Journal Volume: 22; Journal Issue: 6; Other Information: PBD: Dec 1994en_US
dc.identifier.otherOSTI ID: 91133
dc.identifier.otherJournal ID: IJPPE5; ISSN 0885-7458; TRN: 95:004860-0001
dc.identifier.other91133
dc.identifier.urihttp://hdl.handle.net/10945/61031
dc.descriptionThe article of record as published may be found at https://doi.org/10.1007/BF02577870
dc.description.abstractIn this paper we present Safe Self-Scheduling (SSS), a new scheduling scheme that schedules parallel loops with variable length iteration execution times not known at compile time. The scheme assumes a shared memory space. SSS combines static scheduling with dynamic scheduling and draws favorable advantages from each. First, it reduces the dynamic scheduling overhead by statistically scheduling a major portion of loop iterations. Second, the workload is balanced with simple and efficient self-scheduling scheme by applying a new measure, the smallest critical chore size. Experimental results comparing SSS with other scheduling schemes indicate that SSS surpasses other scheduling schemes. In the experiment on Gauss-Jordan, an application that is suitable for static scheduling schemes, SSS is the only self-scheduling scheme that outperforms the static scheduling scheme. This indicates that SSS achieves a balanced workload with a very small amount of overhead.en_US
dc.description.sponsorshipUSDOE
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.subject99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUSen_US
dc.subjectARRAY PROCESSORSen_US
dc.subjectMEMORY MANAGEMENTen_US
dc.subjectPARALLEL PROCESSINGen_US
dc.subjectTASK SCHEDULINGen_US
dc.subjectOPTIMIZATIONen_US
dc.titleSafe self-scheduling: A parallel loop scheduling scheme for shared-memory multiprocessorsen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record