Abstract
This paper is concerned with dynamic strategies for group scheduling. We present preemptive and non preemptive strategies which are suitable for scheduling parallel applications on large workstationclusters and investigate their performance behavior.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chen, G.I., Lai, T.H.: Scheduling Independent Jobs on Partitionable Hypercubes. Journal of Parallel and Distributed Computing 12 (1991) 74–78
Feitelson, D.G., Rudolph, L.: Gang Scheduling Performance Benefits for Fine-Grain Synchronization. Journal of Parallel and Distributed Computing 16 (1992) 306–318
Gustafson, J.: Reevaluating Amdahl's Law. Communications of the ACM 31 5 (1988) 532–533
Krueger, P., Lai, T.-H., Radiya, V.A.: Processor Allocation vs. Job Scheduling on Hypercube Computers. Proc. of the 1991 International Conference on Distributed Computer Systems (1991) 394–401
Leutenegger, S.T., Vernon, M.K.: Performance of Multiprogrammed Multiprocessor Scheduling Policies. Proc. of the 1990 ACM SIGMETRICS Conference on Measurements & Modeling of Computer Systems (1990), 226–236
Min, D., Mutka, M.W.: Effects of Job Size Irregularity on the Dynamic Resource Scheduling of a 2-D Mesh Multicomputer. 5th International PARLE Conference (1993), 476–487
Ousterhout, J.K.: Scheduling techniques for concurrent systems. 3rd Intl. Conf. Distributed Computing Systems (1982) 22–30
Schnor, B.: Architectures and Algorithms for Group Scheduling. 3th International Conference Parallel Computing Technologies (1993) 225–233
Setia, S.K., Squillante, M.S., Tripathi, S.K.: Processor Scheduling on Multiprogrammed, Distributed Memory Parallel Computers. Performance Evaluation Review 21, 1 (1993) 158–170
Trew, A., Wilson, G. (Eds.): Past, Present, Parallel: A Survey of Available Parallel Computing Systems. Springer, London, 1991
Cap, C.H., Strumpen, V.: Efficient Parallel Computing in Distributed Workstation Environments. Parallel Computing 19, 11 (1993) 1221–1234
Sunderam, V.S.: PVM: A framework for parallel distributed computing. Concurrency: Practice and Experience 2, 4 (1990) 315–339
Litzkow, M., Solomon, M.: Supporting Checkpointing and Process Migration Outside the UNIX Kernel. USENIX Conference Proceedings, San Francisco (1992) 283–290
Petri, S.: Migrating Communicating Processes in Workstation Clusters. Technical Report, TU Braunschweig (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schnor, B. (1995). Dynamic scheduling of parallel applications. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1995. Lecture Notes in Computer Science, vol 964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60222-4_101
Download citation
DOI: https://doi.org/10.1007/3-540-60222-4_101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60222-4
Online ISBN: 978-3-540-44754-2
eBook Packages: Springer Book Archive