Time/space sharing distributed job scheduling policy in a workstation cluster environment

Proceedings - International Conference on Parallel Computing in Electrical Engineering, PARELEC 2000

Volumn , Issue , 2000, Pages 116-120

  Abawajy, J H ^a   Dandamudi, S P ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Application software; Clustering algorithms; Computer science; Delay; Distributed computing; Operating systems; Processor scheduling; Scheduling algorithm; Time sharing computer systems; Workstations

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; CLUSTERING ALGORITHMS; COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; COMPUTER WORKSTATIONS; DISTRIBUTED COMPUTER SYSTEMS; SCHEDULING; TIME SHARING SYSTEMS;

COORDINATED SCHEDULING; DELAY; DISTRIBUTED JOB SCHEDULING; PROCESSOR SCHEDULING; RESOURCE ABSTRACTION; SCHEDULING COMMUNICATION; TIME-SHARING; WORKSTATION CLUSTERS;

SCHEDULING ALGORITHMS;

EID: 84935464265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCEE.2000.873613     Document Type: Conference Paper

References (11)

1. J. H. Abawajy and S. P. Dandamudi, "Distributed Hierarchical Clustered Computing Co-ordination Mechanism," IEEE International Conference on Parallel Computing In Electrical Engineering (PARELEC'2000), Trois-Rivières, Quebec, Canada.
2. Stergios V. A. and K.C. Sevcik, "Parallel Application Scheduling on Networks of Workstations," Journal of Parallel and Distributed Computing 43, 109-124 (1997).
3. Jemal H. Abawajy, "Co-ordinated Process Scheduling for Workstation Clusters," Technical paper, Carleton University, 1999.
4. Ousterhout, J. K. Scheduling techniques for concurrent systems. In Proceedings of the 3rd International Conference on Distributed Computing Systems, pages 22-30, October 1982.
5. Sobalvarro, P. G. Demand-based co-scheduling of parallel jobs on multiprogrammed multiprocessors. Ph.D. thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, January 1997.
6. Feitelson, D. G. and L. Rudolph. Co-scheduling based on run-time identification of activity working sets. In International Journal of parallel Programming, Vol. 23, No. 2, pages 135-160, April 1995.
7. Dusseau, A. C., R. H. Arpaci, and D. E. Culler. Effective distributed scheduling of parallel workloads. In ACM SIGMETRICS '96 Conference on the Measurement and Modeling of Computer Systems, 1996.
8. Rosti, E. Smirni, G. Serazzi, L.W. Dowdy, "Analysis of Non-Work-Conserving Processor Partitioning Policies," Proc. IPPS'95 Workshop, Santa Barabar, CA, USA, April 1995, pp.165-181.
9. K. Setia, M.S. Squillante, and S.K. Tripathi, "Processor Scheduling on Multiprogrammed, Distributed Memory Parallel Systems, 1998.
10. Jemal H. Abawajy and S. P. Dandamudi, "An Approach to Parallel Application Scheduling on Networks of Workstations," In the Proceedings of the 1999 International Parallel and Distributed Techniques and Applications (PDTA'99), Las Vegas, Nevada, USA.
11. Dror G. Feitelson. "A Survey of Scheduling in Multiprogrammed Parallel Systems," Research Report RC 19790 (87657), IBM T.J. Watson Research Center, Oct 1994.