A scheduling algorithm for parallel tasks in peer-to-peer systems
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Cactus: a new constant-degree and fault tolerate p2p overlay
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
| Hi-index | 0.00 |
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some small-world characteristics such as higher clustering coefficient and short path length, which leads to an efficient heuristic task scheduling algorithm on which any volunteer peer with limited knowledge about the global network can dispatch its excrescent computation tasks to powerful nodes globally, in a way contrary to the current global computing system in which a global broker is responsible for the task scheduling. We argue that our approach is a starting point to eliminate the broker component which makes current global systems unscalable.