A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering
Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
GridFlow: Workflow Management for Grid Computing
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Scheduling of scientific workflows in the ASKALON grid environment
ACM SIGMOD Record
Task scheduling strategies for workflow-based applications in grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Introduction to Programming Languages: Principles, C, C++, Scheme and Prolog
Introduction to Programming Languages: Principles, C, C++, Scheme and Prolog
A low-cost rescheduling policy for efficient mapping of workflows on grid systems
Scientific Programming - AxGrids 2004
Scheduling strategies for mapping application workflows onto the grid
HPDC '05 Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium
Hi-index | 0.00 |
Based on Open Grid Services Architecture (OGSA), the concept and the formal model of Pipeline Virtual Service (PVS) are proposed and presented in this paper. PVS is used to model a special type of grid workflow composed of a group of services that can be executed as a pipeline. A PVS Pre-Scheduling Pattern is described in detail, which can overlap the execution time of a PVS with the time of generating and optimizing the scheduling solution pool. The Pattern includes two independent components, the solution generating component (GenFunc) and the solution execution component (ExeFunc). GenFunc can take advantage of the powerful computing potential of grid environment to find the optimal or a near optimal scheduling solution, while ExeFunc can select a suitable scheduling solution and put a PVS into running as soon as possible. Two corresponding algorithms, SODGen and SODExe, are also developed. The analytic and simulation results show that the PVS Pre-Scheduling Pattern can not only balance the scheduling cost and scheduling precision, save the scheduling time greatly, but also reduce the execution time through selecting the optimized solution. A prototype is designed and implemented for a large scale astronomy data processing center. The early engineering evaluation experiments show that the PVS Pre-Scheduling Pattern is feasible, efficient, and flexible in real astronomy data processing.