2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops 2008
DOI: 10.1109/sasow.2008.64
|View full text |Cite
|
Sign up to set email alerts
|

On the Feasibility of Decentralized Grid Scheduling

Abstract: Many authors recognize the limitations of hierarchical Grid scheduling in scalable environments, and proposed peer-to-peer solutions to this problem. However, most peerto-peer grid resource management systems allow only to discover available resources at the time of the request. We claim that peer-to-peer techniques have the potential for actual Grid scheduling, where each resource maintains a schedule of its future allocation to jobs. We present such a protocol, which additionally allows users to specify desi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…The prominent one in them is [19]. It first shortlists resources from the grid, using CYCLON [14] gossip protocol.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The prominent one in them is [19]. It first shortlists resources from the grid, using CYCLON [14] gossip protocol.…”
Section: Related Workmentioning
confidence: 99%
“…If there is no change in the value of dynamic entities even then after a fixed time interval information list will be refreshed. This causes extra network traffic [19]. However network traffic due to time-to-time updating of information list on neighbor nodes will be extremely low [19].…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…A different kind of asynchronous collaborative environment is a peer-to-peer grid (Foster andKesselman, 1998, Weel, 2008). Here, collaboration happens when a node issues a computational job to be executed by some number of its peers.…”
Section: Fairness In a Peer-to-peer Gridmentioning
confidence: 99%
“…First, when a job scheduling request is issued by one node requesting resources from its peers, the grid uses a decentralized scheduling algorithm to identify nodes that will be simultaneously available in the near future, and may be used to run this job (Fiscato et al, 2008). This algorithm initially selects a (random) set of nodes capable of executing the job together.…”
Section: Fairness Enforcement Algorithmmentioning
confidence: 99%
See 1 more Smart Citation