Abstract
In this paper, we study the problem of efficiently scheduling a wide class of multithreaded computations, called strict; that is, com- putations in which all dependencies from a thread go to the thread’s ancestors in the computation tree. We present the first scheduling al- gorithm which applies to any strict multithreaded computation and is provably efficient in terms of execution time, space complexity and com- munication cost. The algorithm is distributed, randomized, works in an asynchronous way and follows the work-stealing paradigm. Our analysis applies for both shared-memory and distributed-memory parallel machines and generalizes the one presented in [5], which applies only to fully strict multithreaded computations; that is, computations in which all dependencies from a thread go to the thread’s parent.
Abstract
This work has been supported in part by the European Union’s ESPRIT Long Term Research Project ALCOM-IT (contract # 20244).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. S. Arora, R. D. Blumofe and C. G. Plaxton, “Thread Scheduling for Multiprogrammed Multiprocessors,” Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, June–July 1998.
G. E. Blelloch, P.B. Gibbons and Y. Matias, “Provably efficient scheduling for languages with fine-grained parallelism,” Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, California, pp.1–12, July 1995.
G. E. Blelloch, P. B. Gibbons, Y. Matias and G. J. Narlikar, “Space-efficient scheduling of parallelism with synchronization variables,” Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island, pp. 12–23, June 1997.
R. D. Blumofe, “Executing Multithreaded Programs Efficiently,” Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, September 1995.
R. D. Blumofe and C. E. Leiserson, “Scheduling Multithreaded Computations by Work Stealing,” Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 356–368, 1994.
R. D. Blumofe and C. E. Leiserson, “Space-Efficient Scheduling of Multithreaded Computation,” SIAM Journal on Computing, Vol. 27,No. 1, pp. 202–229, February 1998.
R. D. Blumofe and D. S. Park, “Scheduling large-scale parallel computations on networks of workstations,” Proceedings of the 3rd International Symposium on High Performance Distributed Computing, pp. 96–105, San Francisco, California, August 1994.
F. W. Burton, “Guaranteeing good memory bounds for parallel programs,” IEEE Transactions on Software Engineering, Vol. 22,No. 10, October 1996.
F. W. Burton, “Storage management in virtual tree machines,” IEEE Transactions on Computers, Vol. 37,No. 3, pp. 321–328, March 1988.
F. W. Burton and M. R. Sleep, “Executing functional programs on a virtual tree of processors,” Proceedings of the Conference on Functional Programming Languages and Computer Architecture, pp. 187–194, Portsmouth, New Hampshire, October 1981.
T. Decker, “Virtual Data Space–A Universal Load Balancing Scheme,” Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, pp. 159–166, 1997.
P. Fatourou and P. Spirakis, “Scheduling Algorithms for Strict Multithreaded Computations,” Proceedings of the 10th Internbational Sumposium on Algorithms and Computation, pp. 407–416, Osaka, Japan, 1996.
P. Fatourou and P. Spirakis, “A New Scheduling Algorithms for General Strict Multithreaded Computations,” http://students.ceid.upatras.gr/~faturu/public.htm, 1999.
W. Feller, An Introduction to Probability Theory and its Application, Second Edition, Vol. 1, John Wiley & Sons, Inc., 1957.
R. H. Halstead, “Multilisp: A language for concurrent symbolic computation,” ACM Transactions on Programming Languages and Systems, Vol. 7,No. 4, pp. 501–538, October 1985.
R. M. Karp and Y. Zhang, “Randomized parallel algorithms for backtrack search and branch-and-bound computation,” Journal of the ACM, Vol. 40,No. 3, pp. 765–789, July 1993.
P. Liu, W. Aielo and S. Bhatt, “An atomic model for message passing,” Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’ 93), pp. 154–163, Velen, Germany, June 1993.
L. Rudolph, M. Slivkin-Allalouf and E. Upfal, “A simple load balancing scheme for task allocation in parallel machines,” Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 237–245, Hilton Head, California, July 1991.
I. C. Wu and H. T. Kung, “Communication complexity for parallel divide-andconquer,” Proc. of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS’ 91), pp. 151–162, San Juan, Puerto Rico, October 1991.
Y. Zhang, Parallel Algorithms for Combinatorial Search Problems, PhD Thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Technical Report UCB/CSD 89/543, November 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fatourou, P., Spirakis, P. (1999). A New Scheduling Algorithm for General Strict Multithreaded Computations. In: Jayanti, P. (eds) Distributed Computing. DISC 1999. Lecture Notes in Computer Science, vol 1693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48169-9_21
Download citation
DOI: https://doi.org/10.1007/3-540-48169-9_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66531-1
Online ISBN: 978-3-540-48169-0
eBook Packages: Springer Book Archive