The Community for Technology Leaders
Green Image
<p>When a parallel algorithm is written naturally, the resulting program often produces tasks of a finer grain than an implementation can exploit efficiently. Two solutions to the granularity problem that combine parallel tasks dynamically at runtime are discussed. The simpler load-based inlining method, in which tasks are combined based on dynamic bad level, is rejected in favor of the safer and more robust lazy task creation method, in which tasks are created only retroactively as processing results become available. The strategies grew out of work on Mul-T, an efficient parallel implementation of Scheme, but could be used with other languages as well. Mul-T implementations of lazy task creation are described for two contrasting machines, and performance statistics that show the method's effectiveness are presented. Lazy task creation is shown to allow efficient execution of naturally expressed algorithms of a substantially finer grain than possible with previous parallel Lisp systems.</p>
Index Termsparallel algorithm; granularity problem; parallel tasks; simpler load-based inlining method; dynamic bad level; robust lazy task creation method; processing results; Mul-T; parallel implementation; Scheme; performance statistics; naturally expressed algorithms; parallel Lisp systems; parallel algorithms; parallel languages; parallel programming
E. Mohr, D.A. Kranz, R.H. Halstead, Jr., "Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs", IEEE Transactions on Parallel & Distributed Systems, vol. 2, no. , pp. 264-280, July 1991, doi:10.1109/71.86103
88 ms
(Ver 3.3 (11022016))