Abstract
In this paper, we describe a new job scheduling class, called “Time Space Sharing Scheduling” (TSSS) for parallel machines with variable partition. As an instance of TSSS, we explain the “Distributed Queue Tree” (DQT) that we have proposed already. We also propose some architectural support to implement TSSS on a parallel machine as adequately as TSS on sequential machines. The most important architectural support is “network preemption.” The proposed architectural support will be implemented on our RWC-1, a message-driven parallel machine, and the DQT will also be implemented in the operating system on the RWC-1, called SCore, under development in our RWC project.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Gregory R. Andrews. Paradigms for Process Interaction in Distributed Programs. Computing Surveys, 23(1):49–90, March 1991.
Douglas C. Burger, Rahmat S. Hyder, Barton P. Miller, and David A. Wood. Paging Tradeoffs in Distributed-Shared-Memory Multiprocessors. In Supercomputing'94, pages 590–599, November 1994.
Ming-Syan Chen and Kang G. Shin. Subcube Allocation and Task Migration in Hypercube Multiprocessors. IEEE Transactions on Computers, 39(9):1146–1155, 1990.
Po-Jen Chuang and Nian-Feng Tzeng. A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers. IEEE Transactions on Computers, 41(4):467–479, 1992.
William J. Dally, J.A. Stuart Fiske, John S. Keen, Richard A. Lethin, Michel D. Noakes, and Peter R. Nuth. The Message-Driven Procesor: A Multicomputer Processing node with Efficient Mechanisms. IEEE Micro, pages 23–39, April 1992.
Dror G. Feitelson and Larry Rudolph. Distributed Hierarchical Control for Parallel Processing. COMPUTER, pages 65–77, May 1990.
Dror G. Feitelson and Larry Rudolph. Mapping and Scheduling in a Shared Parallel Environment Using Distributed Hierarchical Control. In International Conference on Parallel Processing, volume I, pages 1–8, 1990.
Atsushi Hori, Yutaka Ishikawa, Hiroki Konaka, Munenori Maeda, and Takashi Tomokiyo. Overview of Massively Parallel Operating System Kernel SCore. Technical Report TR-93003, Real World Computing Partnership, 1993.
Atsushi Hori, Yutaka Ishikawa, Hiroki Konaka, Munenori Maeda, and Takashi Tomokiyo. A Scalable Time-Sharing Scheduling for Partitionable, Distributed Memory Parallel Machines. In Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Science, volume II, pages 173–182. IEEE Computer Society Press, January 1995.
Intel Corporation. PARAGON OSF/1 USER'S GUIDE, April 1993.
Phillip Krueger, Ten-Hwang Lai, and Vibha A. Dixit-Radiya. Job Scheduling Is More Important than Processor Allocation for Hypercube Computers. IEEE Transactions on Parallel and Distributed Systems, 5(5):488–497, 1994.
Keqin Li and Kam-Hoi Cheng. A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System. Journal of Parallel and Distributed Computing, 12(5):79–83, May 1991.
Woei Lin and Chuan-Lin Wu. A Distributed Resource Management Mechanism for a Partitionable Multiprocessor System. IEEE Transactions on Computers, 37(2):201–210, February 1988.
John K. Ousterhout. Scheduling Techniques for Concurrent Systems. In Proceedings of Third International Conference on Distributed Computing Systems, pages 22–30, 1982.
James L. Peterson and Theodore A. Norman. Buddy System. Communication of the ACM, 20(6):421–131, June 1977.
Shuichi Sakai, Kazuaki Okamoto, Hiroshi Matsuoka, Hideo Hirono, Yuetsu Kodama, and Mitsuhisa Sato. Super-threading: Architectural and software mechanisms for optimizing parallel computation. In Proceedings of 1993 International Conference on Supercomputing, pages 251–260, 1993.
Gerard Tel and Friedmann Mattern. The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes. ACM Transactions on Programming Languages and Systems, 15(1):1–35, January 1993.
Thinking Machines Corporation. Connection Machine CM-5 Technical Summary, November 1992.
Thinking Machines Corporation. NI Systems Programming, October 1992. Version 7.1.
Yahui Zhu. Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers. Journal of Parallel and Distributed Computing, 16:328–337, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hori, A. et al. (1995). Time Space Sharing Scheduling and architectural support. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1995. Lecture Notes in Computer Science, vol 949. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60153-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-60153-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60153-1
Online ISBN: 978-3-540-49459-1
eBook Packages: Springer Book Archive