IEEE Transactions on Parallel and Distributed Systems
A Resource Management Architecture for Metacomputing Systems
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Framework for Mapping with Resource Co-Allocation in Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Resource Co-Allocation in Computational Grids
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
Run-Time Adaptation for Grid Environments
IPDPS '01 Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2
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
A Synchronous Co-Allocation Mechanism for Grid Computing Systems
Cluster Computing
Cross-Site Computations on the TeraGrid
Computing in Science and Engineering
Characterization of Bandwidth-Aware Meta-Schedulers for Co-Allocating Jobs Across Multiple Clusters
The Journal of Supercomputing
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Flexible Time-Windows for Advance Reservation Scheduling
MASCOTS '06 Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation
Resource reservations with fuzzy requests: Research Articles
Concurrency and Computation: Practice & Experience - Adaptive Grid Middleware
Co-reservation with the concept of virtual resources
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid - Volume 01
A batch scheduler with high level components
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Experiences with the KOALA co-allocating scheduler in multiclusters
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Backfilling with lookahead to optimize the packing of parallel jobs
Journal of Parallel and Distributed Computing
Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
QBETS: queue bounds estimation from time series
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
IEEE Transactions on Parallel and Distributed Systems
Scheduling Policies for Processor Coallocation in Multicluster Systems
IEEE Transactions on Parallel and Distributed Systems
On the User-Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
International Journal of High Performance Computing Applications
Elastic reservations for efficient bandwidth utilization in LambdaGrids
Future Generation Computer Systems - Special section: Data mining in grid computing environments
Resource co-allocation using advance reservations with flexible time-windows
ACM SIGMETRICS Performance Evaluation Review
Modeling user runtime estimates
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Co-scheduling with user-settable reservations
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
Real-time service process admission control with schedule reorganization
Service Oriented Computing and Applications
| Hi-index | 0.00 |
Large-scale computing environments, such as TeraGrid, Distributed ASCI Supercomputer (DAS), and Gridpsila5000, have been using resource co-allocation to execute applications on multiple sites. Their schedulers work with requests that contain imprecise estimations provided by users. This lack of accuracy generates fragments inside the scheduling queues that can be filled by rescheduling both local and multi-site requests. Current resource co-allocation solutions rely on advance reservations to ensure that users can access all the resources at the same time. These coallocation requests cannot be rescheduled if they are based on rigid advance reservations. In this work, we investigate the impact of rescheduling co-allocation requests based on flexible advance reservations and processor remapping. The metascheduler can modify the start time of each job component and remap the number of processors they use in each site. The experimental results show that local jobs may not fill all the fragments in the scheduling queues and hence rescheduling co-allocation requests reduces response time of both local and multi-site jobs. Moreover, we have observed in some scenarios that processor remapping increases the chances of placing the tasks of multi-site jobs into a single cluster, thus eliminating the inter-cluster network overhead.