ACM Computing Surveys (CSUR)
Using multicast to pre-load jobs on the ParPar cluster
Parallel Computing
Trace-driven Analysis of Migration-based Gang Scheduling Policies for Parallel Computers
ICPP '97 Proceedings of the international Conference on Parallel Processing
Towards Convergence in Job Schedulers for Parallel Supercomputers
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
The Impact of Migration on Parallel Job Scheduling for Distributed Systems
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Gang Scheduling and Adaptive Resource Allocation to Mitigate Advance Reservation Impact
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Simulation of job scheduling for small scale clusters
Proceedings of the 38th conference on Winter simulation
Performance evaluation of gang scheduling in a two-cluster system with migrations
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Scheduling Gangs with Different Distributions in Gangs' Degree of Parallelism in a Multi-Site System
BCI '09 Proceedings of the 2009 Fourth Balkan Conference in Informatics
Gang scheduling in a two-cluster system with critical sporadic jobs and migrations
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Performance evaluation of bag of gangs scheduling in a heterogeneous distributed system
Journal of Systems and Software
Gang scheduling in multi-core clusters implementing migrations
Future Generation Computer Systems
Evaluation of gang scheduling performance and cost in a cloud computing system
The Journal of Supercomputing
Scheduling of frequently communicating tasks
International Journal of Communication Systems
| Hi-index | 0.00 |
Gang scheduling (GS) is an efficient scheduling approach for distributed systems. The CompactMatrix is the second phase in GS and plays a main role in accelerating the scheduling of the larger gangs. In this paper, a novel method is proposed to compact the scheduling matrix by using two new ideas. By using simulation, the impact of the proposed ideas was compared to the basic CompactMatrix algorithm, either individually or simultaneously. The results show that the average response time in the Improved CompactMatrix Algorithm (ICMA), compared with the basic CompactMatrix, is reduced about 2 to 20, 0 to 10, and 驴5 to 5 percent by selecting the migration overhead values equal to 5, 10, and 15 percent of the time-slices lengths, respectively. As can be seen, ICMA will show better results in smaller migration overheads.