Decentralized Scheduling Algorithm for DAG Based Tasks on P2P Grid
Complex problems consisting of interdependent subtasks are represented by a direct acyclic graph (DAG). Subtasks of this DAG are scheduled by the scheduler on various grid resources. Scheduling algorithms for grid strive to optimize the schedule. Nowadays a lot of grid resources are attached by P2P...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Engineering |
| Online Access: | http://dx.doi.org/10.1155/2014/202843 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|