IEEE Transactions on Parallel and Distributed Systems
Contention-Free 2D-Mesh Cluster Allocation in Hypercubes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Evaluation of Job-Scheduling Strategies for Grid Computing
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
On Advantages of Grid Computing for Parallel Job Scheduling
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
An Evaluation of Processor Co-allocation for Different System Configurations and Job Structures
SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
Journal of Parallel and Distributed Computing
Benefits of Global Grid Computing for Job Scheduling
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Experimental Analysis of the Root Causes of Performance Evaluation Results: A Backfilling Case Study
IEEE Transactions on Parallel and Distributed Systems
Job scheduling and processor allocation for grid computing on metacomputers
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
IEEE Transactions on Parallel and Distributed Systems
An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems
IEEE Transactions on Computers
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
Towards feasible and effective load sharing in a heterogeneous computational grid
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
On the Benefit of Processor Coallocation in Multicluster Grid Systems
IEEE Transactions on Parallel and Distributed Systems
Multisite co-allocation algorithms for computational grid
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Job Allocation Strategies with User Run Time Estimates for Online Scheduling in Hierarchical Grids
Journal of Grid Computing
Parallel job scheduling — a status report
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Modeling user runtime estimates
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
The Journal of Supercomputing
Hi-index | 0.00 |
In a heterogeneous multi-cluster (HMC) system, processor allocation is responsible for choosing available processors among clusters for job execution. Traditionally, processor allocation in HMC considers only resource fragmentation or processor heterogeneity, which leads to heuristics such as Best-Fit (BF) and Fastest-First (FF). However, those heuristics only favor certain types of workloads and cannot be changed adaptively. In this paper, a temporal look-ahead (TLA) method is proposed, which uses an allocation simulation process to guide the decision of processor allocation. Thus, the allocation decision is made dynamically according to the current workload and system configurations. We evaluate the performance of TLA by simulations, with different workloads and system configurations, in terms of average turnaround time. Simulation results indicate that, with precise runtime information, TLA outperforms traditional processor allocation methods and has up to an 87% performance improvement.