An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Mathematical Programming: Series A and B
Scheduling Soft Real-Time Jobs Over Dual Non-Real-Time Servers
IEEE Transactions on Parallel and Distributed Systems
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
A Federated Model for Scheduling in Wide-Area Systems
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Performance Evaluation of Soft Real-Time Scheduling for Multicomputer Cluster
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Optimizing Static Job Scheduling in a Network of Heterogeneous Computers
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Performance-based middleware for Grid computing: Research Articles
Concurrency and Computation: Practice & Experience - Grid Performance
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
The success of web services has influenced the way in which Grid applications are being written. Web services are increasingly used as a means to realise service-oriented distributed computing. Grid users often submit their applications in the form of workflows with certain Quality of Service (QoS) requirements imposed on the workflows. These workflows detail the composition of web services and the level of service required from the Grid. This paper addresses workload allocation techniques for Grid workflows. We model a web service as an M/M/k queue and obtain a numerical solution for missed deadlines (failures) of Grid workflow tasks. The approach is evaluated through an experimental simulation and the results confirm that the proposed workload allocation strategy performs considerably better in terms of satisfying QoS requirements of Grid workflows than scheduling algorithms that don't employ such workload allocation techniques.