Abstract
A methodology is developed for the solution of dynamic graph problems through the idea of snapshots. A snapshot of a dynamic graph is a collection of consistent local snapshots, where a local snapshot defines the neighborhood of a process. The methodology is illustrated by solving the distributed job scheduling problem. The solution combines a given snapshot algorithm with existing solutions to the dining philosophers and δ-coloring problems. The time and message complexities of the resulting algorithm depend minimally on global parameters.
Work partially supported in part by NSF under grant CCR-9008628 and CCR-9223094.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science, IEEE, 1987.
B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 65–74, 1990.
B. Awerbuch and M. Sipser. Dynamic networks are as fast as static networks. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science, IEEE, pages 206–220, 1988.
J. Bar-Ilan and D. Peleg. Distributed resource allocation algorithms. In 6th International Workshop on Distributed Algorithms, pages 277–291, 1992.
K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Transaction on Computer Systems, 3(1):63–75, 85.
K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison Wesley Pub. Co., Reading, Mass., 1988.
M. Choy and A. K. Singh. Efficient fault tolerant algorithms for resource allocation in distributed systems. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 593–602, 1992.
E. W. Dijkstra. Solution of a problem in concurrent programming control. Communication of ACM., 8(9):569, 1965.
A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 315–324, 1987.
N. Lynch. Fast allocation of nearby resources in a distributed system. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pages 70–81, 1980.
B. Meyer. Systematic concurrent object-oriented programming. Interactive Software Engineering Inc., Technical Report TR-EI-37/SC, 1993.
E. Styer and G. Peterson. Improved algorithms for distributed resource allocation. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 105–116, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choy, M., Singh, A.K. (1993). Distributed job scheduling using snapshots. In: Schiper, A. (eds) Distributed Algorithms. WDAG 1993. Lecture Notes in Computer Science, vol 725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57271-6_33
Download citation
DOI: https://doi.org/10.1007/3-540-57271-6_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57271-8
Online ISBN: 978-3-540-48029-7
eBook Packages: Springer Book Archive