Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Computation scheduling and data replication algorithms for data Grids
Grid resource management
Stork: Making Data Placement a First Class Citizen in the Grid
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A grid service broker for scheduling distributed data-oriented applications on global grids
MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
Balancing Risk and Reward in a Market-Based Task Service
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
Co-scheduling of computation and data on computer clusters
SSDBM'2005 Proceedings of the 17th international conference on Scientific and statistical database management
Dynamic Co-Scheduling of Distributed Computation and Replication
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
A deadline and budget constrained scheduling algorithm for escience applications on data grids
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Integration of scheduling and replication in data grids
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
A distributed job scheduling and flow management system
ACM SIGOPS Operating Systems Review
INFORM: integrated flow orchestration and meta-scheduling for managed grid systems
Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion
Dynamic resource matching for multi-clusters based on an ontology-fuzzy approach
HPCS'09 Proceedings of the 23rd international conference on High Performance Computing Systems and Applications
Discrete Applied Mathematics
| Hi-index | 0.00 |
Vendor strategies to standardize grid computing as the IT backbone for service-oriented architectures have created business opportunities to offer grid as a utility service for compute and data–intensive applications. With this shift in focus, there is an emerging need to incorporate agreements that represent the QoS expectations (e.g. response time) of customer applications and the prices they are willing to pay. We consider a utility model where each grid application (job) is associated with a function, that captures the revenue accrued by the provider on servicing it within a specified deadline. The function also specifies the penalty incurred on failing to meet the deadline. Scheduled execution of jobs on appropriate sites, along with timely transfer of data closer to compute sites, collectively work towards meeting these deadlines. To this end, we present DECO, a grid meta-scheduler that tightly integrates the compute and data transfer times of each job. A unique feature of DECO is that it enables differentiated QoS – by assigning profitable jobs to more powerful sites and transferring the datasets associated with them at a higher priority. Further, it employs replication of popular datasets to save on transfer times. Experimental studies demonstrate that DECO earns significantly better revenue for the grid provider, when compared to alternative scheduling methodologies.