Name
Abstract | ||
|---|---|---|
Most of the existing solutions on task scheduling and resource management in grid computing are based on the traditional client/server
model, enforcing a homogenous policy on making decisions and limiting the system flexibility and scalability. In this paper,
we propose a peer-to-peer (P2P)-based decentralized approach, which off-loads the intermediate server by letting the peers
in the grid to make the scheduling decision among themselves using their own scheduling policies. A generic architecture for
metascheduler on peers, called PGS (P2P Grid Scheduler), and the task scheduling framework based on PGS have been developed. Both push and pull modes are used for distributing
the tasks to peers with the support of load balancing and fault tolerance. A prototype of the proposed architecture and mechanism
has been developed and simple performance tests have been conducted.
|
Year | DOI | Venue |
|---|---|---|
2005 | 10.1504/IJGUC.2005.007056 | International Journal of Grid and Utility Computing |
Keywords | Field | DocType |
task scheduling,computation grid,peer-to-peer approach,client server,load balance,p2p,fault tolerant,grid computing | Fixed-priority pre-emptive scheduling,Grid computing,Fair-share scheduling,Load balancing (computing),Computer science,Scheduling (computing),Computer network,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
1 | 1 | 0302-9743 |
Citations | PageRank | References |
11 | 0.71 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiannong Cao | 1 | 5226 | 425.12 |
| Oscar M. K. Kwong | 2 | 11 | 0.71 |
| Xianbing Wang | 3 | 90 | 9.98 |
| Wentong Cai | 4 | 1928 | 197.81 |