Abstract
This paper presents a parallel process scheduling method for the AP/Linux parallel operating system. This method relies on 2 schedulings; local scheduling on each processor and global scheduling which is called moderate co-scheduling. Moderate co-scheduling schedules simultaneously parallel processes on each processor by controlling priorities of parallel processes. This method differs from gang scheduling in that it does not promise the running of a parallel process on all processors at the same time. Moderate co-scheduling only suggests a suitable current process to the local scheduling. However, this is good solution for fine and coarse grain parallel processes, because Moderate co-scheduling tells the timing to schedule simultaneously for fine grain parallel processes (tightly7-coupled processes on each processor, which requires quick and frequent communication), and local scheduling can yield CPU time when coarse grain parallel processes (loosely-coupled processes on each processor, which cause long wait and less frequent communication) must wait for long time. The method is implemented using AP1000+ special hardware. We call the implementation at (“Internal synchronization”) which uses the synchronized clock. The co-scheduling skew of the implementation was about 2% in the period of moderate co-scheduling was 200ms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Tridgell, P. Mackerras, D. Sitsky, and D. Walsh, Ap/linux a modern os for the ap1000+. The 6th Parallel Computing Workshop, pages P2C1–P2C9, 1996.
J.K. Ousterout, Scheduling techniques for concurrent Systems. Proceedings of the 3rd International Conference on Distributed Computing Systems, pages 22–30, 1982.
A.C. Dusseau, R.H. Arpaci, and D.E. Culler. Effective Distributed Scheduling of Parallel Workloads. SIGMETRICS’96, 1996.
D. Sitsky, P. Mackerras, A. Tridgell, and D. Walsh, Implementing MPI under AP/Linux. Second MPI Developers Conference, pages 32–39, 1996.
D.G. Feitelson. Job Scheduling in Multiprogrammed Parallel Systems, IBM research Report RC 19790(87657), 1997.
K. Suzaki, H. Tanuma, S. Hirano, Y. Ichisugi, and M. Tukamoto, Time sharing systems that use a partitioning algorithm on mesh-connected parallel computers. The Ninth International Conference on Parallel and Distributed Computing Systems, pages 268–275, 1996.
J. Ding and L. N. Bhuyan. An adaptive submesh allocation strategy for two-dimensional mesh connected systems. Proceedings of International Conference on Parallel Processing, pages (II)193–200, 1993.
A. Hori, H. Tezuka, and Y. Ishikawa. Overhead analysis of preemptive gang scheduling. IPPS’98 Workshop on Jpb Scheduling Strategies for Parallel Processing (Lecture Notes in Computer Science 1125), pages 217–230, 1998.
P.G. Sobalvarro and W.E. Weihl. Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors. IPPS’95 Workshop on Jpb Scheduling Strategies for Parallel Processing (Lecture Notes in Computer Science 949), pages 106–126, 1995.
P.G. Sobalvarro, S. Pakin, W.E. Weihl, and A.A. Chien. Dynamic coscheduling on workstation clusters. IPPS’98 Workshop on Jpb Scheduling Strategies for Parallel Processing (Lecture Notes in Computer Science 1125), pages 231–256, 1998.
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
Suzaki, K., Walsh, D. (1999). Scheduling on AP/Linux for Fine and Coarse Grain Parallel Processes. In: Feitelson, D.G., Rudolph, L. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 1999. Lecture Notes in Computer Science, vol 1659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47954-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-47954-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66676-9
Online ISBN: 978-3-540-47954-3
eBook Packages: Springer Book Archive