World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

PARALLEL LOOP SCHEDULING APPROACHES FOR DISTRIBUTED AND SHARED MEMORY SYSTEMS

    In this paper, we propose different approaches for the parallel loop scheduling problem on distributed as well as shared memory systems. Specifically, we propose adaptive loop scheduling models in order to achieve load balancing, low runtime scheduling, low synchronization overhead and low communication overhead. Our models are based on an adaptive determination of the chunk size and an exploitation of the processor affinity property, and consider different situations (central or local queues, and dynamic or static loop partition).

    References

    • J. Aguilar, E. Leiss, "General Adaptive Parallel Loop Scheduling for Distributed and Shared Memory Systems", Technical Report, Department of Computer Science, University of Houston, September 2000 . Google Scholar
    • A. Bull, "Feedback Guided Dynamic Loop Scheduling: Algorithms and Experiments", Lecture Notes on Computer Sciences, Vol. 1470, pp. 377-382, 1998 . Google Scholar
    • M. Cieniak, M. Javeed and W. Li, The Computational Journal 40(6), 356 (1997). Crossref, ISIGoogle Scholar
    • H.   El_Rewini , T.   Lewis and H.   Ali , Task Scheduling in Parallel and Distributed Systems ( Prentice Hall , New Jersey , 1994 ) . Google Scholar
    • H. Le and J. Fortes, The Computational Journal 40(6), 303 (1997). Google Scholar
    • C. Lengauer, S. Gorlatch and C. Herrmann, Journal of Supercomputing 11(4), 333 (1997). Crossref, ISIGoogle Scholar
    • E. Markatos and T. LeBlanc, IEEE Transactions on Parallel and Distributed Systems 5(4), 379 (1994). Crossref, ISIGoogle Scholar
    • G. Nanliken and G. Belloch, ACM Transactions on Programming Language and Systems 21(1), 138 (1999). ISIGoogle Scholar
    • F. Rastello, Y. Robert, "Loop Partitioning versus Tiling for Cache-Based Multiprocessors", Technical Report RR1998-13, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure. February 1998 . Google Scholar
    • L. Rauhwerger and D. Padua, IEEE Transactions on Parallel and Distributed Systems 10(2), 160 (1999). Crossref, ISIGoogle Scholar
    • Z. Szczerbinski, "Optimal Distribution of Loops Containing no Dependence Cycles", Lecture Notes on Computer Sciences, Vol. 1595, pp. 1254-1257, 1999 . Google Scholar
    • S. Togsima, C. Chantrapornchai, E. Sha, "Probabilistic Loop Scheduling Considering Communication Overhead", Lecture Notes on Computer Sciences, Vol. 1459, pp-158-179, 1998 . Google Scholar
    • T. Tzen and L. Ni, IEEE Transactions on Parallel and Distributed Systems 4(1), 87 (1993). Crossref, ISIGoogle Scholar
    • J. Xue, Journal of Parallel and Distributed Computing 42, 42 (1997). Crossref, ISIGoogle Scholar
    • Y. Yan, C. Jin and X. Zhang, IEEE Transactions on Parallel and Distributed Systems 8(1), 70 (1997). ISIGoogle Scholar