A new polynomial-time algorithm for linear programming
Combinatorica
Computational results of an interior point algorithm for large scale linear programming
Mathematical Programming: Series A and B - Special issue on interior point methods for linear programming: theory and practice
Future Generation Computer Systems - Special issue on metacomputing
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Distributed computing research issues in grid computing
ACM SIGACT News
Adaptive Computing on the Grid Using AppLeS
IEEE Transactions on Parallel and Distributed Systems
Combining active and passive network measurements to build scalable monitoring systems on the grid
ACM SIGMETRICS Performance Evaluation Review
A Performance Oriented Migration Framework For The Grid
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Griz: experience with remote visualization over an optical grid
Future Generation Computer Systems - iGrid 2002
QoS guided min-min heuristic for grid task scheduling
Journal of Computer Science and Technology - Grid computing
Ten actions when Grid scheduling: the user as a Grid scheduler
Grid resource management
Using predicted variance for conservative on shared resources
Grid resource management
GHS: A Performance System of Grid Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
The Cactus Worm: Experiments with Dynamic Resource Discovery and Allocation in a Grid Environment
International Journal of High Performance Computing Applications
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
A low-cost rescheduling policy for efficient mapping of workflows on grid systems
Scientific Programming - AxGrids 2004
Scientific Programming - AxGrids 2004
A set of schedulers for grid networks
Proceedings of the 2007 ACM symposium on Applied computing
Scheduling multiple DAGs onto heterogeneous systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Robust scheduler for grid networks
Proceedings of the 2009 ACM symposium on Applied Computing
A collaborative scheduling approach for service-driven scientific workflow execution
Journal of Computer and System Sciences
Design and deployment of a network-aware grid for e-science applications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Performance analysis of available bandwidth estimation tools for grid networks
The Journal of Supercomputing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Using relative costs in workflow scheduling to cope with input data uncertainty
Proceedings of the 10th International Workshop on Middleware for Grids, Clouds and e-Science
Hi-index | 0.00 |
Grids involve coordinated resource sharing and problem solving in heterogeneous dynamic environments to meet the needs of a generation of researchers requiring large amounts of bandwidth and more powerful computational resources. The lack of resource ownership by grid schedulers and fluctuations in resource availability require mechanisms which will enable grids to adjust themselves to cope with fluctuations. The lack of a central controller implies a need for self-adaptation. Grids must thus be enabled with the ability to discover, monitor and manage the use of resources so they can operate autonomously. Two different approaches have been conceived to match the resource demands of grid applications to resource availability: Dynamic scheduling and adaptive scheduling. However, these two approaches fail to address at least one of three important issues: (i) the production of feasible schedules in a reasonable amount of time in relation to that required for the execution of an application; (ii) the impact of network link availability on the execution time of an application; and (iii) the necessity of migrating codes to decrease the execution time of an application. To overcome these challenges, this paper proposes a procedure for enabling grid applications, composed of various dependent tasks, to deal with the availability of hosts and links bandwidth. This procedure involves task scheduling, resource monitoring and task migration, with the goal of decreasing the execution time of grid applications. The procedure differs from other approaches in the literature because it constantly considers changes in resource availability, especially network bandwidth availability, to trigger task migration. The proposed procedure is illustrated via simulation using various scenarios involving fluctuation of resource availability. An additional contribution of this paper is the introduction of a set of schedulers offering solutions which differ in terms of both schedule length and computational complexity. The distinguishing aspect of this set of schedulers is the consideration of time requirements in the production of feasible schedules. Performance is then evaluated considering various network topologies and task dependencies.