Scheduling best-effort and real-time pipelined applications on time-shared clusters
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling with Advanced Reservations
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Improvements in Parallel Job Scheduling Using Gang Service
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Online Prediction of the Running Time of Tasks
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
On-Line Scheduling on Uniform Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
Journal of Parallel and Distributed Computing
Improving resource selection and scheduling using predictions
Grid resource management
From remote media immersion to Distributed Immersive Performance
ETP '03 Proceedings of the 2003 ACM SIGMM workshop on Experiential telepresence
Grid Service Agents for Real Time Traffic Synchronization
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Modeling of workflow-engaged networks on radiology transfers across a metro network
IEEE Transactions on Information Technology in Biomedicine
Achieving efficiency, quality of service and robustness in multi-organizational Grids
Journal of Systems and Software
Business-driven short-term management of a hybrid IT infrastructure
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Meeting QoS objectives of applications while maintaining high system utilization is a challenging task in multi-institutional Grids. In this paper, we effectively engineer Grid applications and resource management middleware for achieving user satisfaction and high resource utilizations. The paper presents a complete framework based on advance reservations (ARs) for resource management in Grids. The framework is capable of providing QoS guarantees to applications while maintaining high resource utilizations. The paper focuses on the scheduling component of the framework and presents a novel heuristic-based algorithm, Grid Scheduling with Deadlines (GSD), for an NP-Complete problem of scheduling ARs with laxities on a shared resource. GSD can be configured with the help of pluggable strategies to adapt to various workload conditions and needs of the system. The paper studies with the aid of an extensive set of experiments the effect of various workload and system parameters on system performance. It is not always possible to accurately predict the runtimes of the jobs. The paper discusses the impact of error in user-estimated runtimes on system performance and investigates strategies to avoid substandard performance resulting from such inaccuracies. Experimental results demonstrate the efficacy of our methodology.