2011
DOI: 10.1016/j.future.2010.08.002
|View full text |Cite
|
Sign up to set email alerts
|

FRDT: Footprint Resource Discovery Tree for grids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 24 publications
(15 citation statements)
references
References 20 publications
0
15
0
Order By: Relevance
“…The job grouping concept is used to maximise resource utilisation for scheduling of jobs in grid computing. However, this approach is also not scalable like the work in Khanli and Kargar (2010) since the organisation of agents is a HST. In contrast, our approach is scalable by using multiple broker agents instead of using a HST.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The job grouping concept is used to maximise resource utilisation for scheduling of jobs in grid computing. However, this approach is also not scalable like the work in Khanli and Kargar (2010) since the organisation of agents is a HST. In contrast, our approach is scalable by using multiple broker agents instead of using a HST.…”
Section: Related Workmentioning
confidence: 99%
“…Some of the existing resource discovery and brokering systems that are related to this research include condor ( Raman et al, 1998;Han and Berry, 2008), ARMS (Cao et al, 2001;Ding et al, 2005;Dominiak et al, 2007), ACG (Chunlin and Layuan, 2003), UWAgents (Fukuda and Smith, 2006;Khanli and Kargar, 2010;Sharma et al, 2010;Li et al, 2006).…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Resource discovery in Grid through hierarchical method by "Footprint" The "Footprint" method is introduced in [13] where the hierarchical method is adopted in resource management and discovery. In this method all edges are codified.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this work, we use a weighted tree for resource discovery (Khanli & Kargar, 2011). We only use one bitmap for the identification of available resources in nodes and also resources of children and their descendant nodes.…”
Section: Introductionmentioning
confidence: 99%