2007 IEEE International Parallel and Distributed Processing Symposium 2007
DOI: 10.1109/ipdps.2007.370313
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
23
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 37 publications
(23 citation statements)
references
References 23 publications
0
23
0
Order By: Relevance
“…Most of the methods in resource discovery tend to peer to peer (Al-Dmour & Teahan, 2005;Ali et al, 2005;Basu et al, 2005;Bharambe et al, 2004;Cai & Hwang, 2007;Iamnitchi et al, 2002;Koo et al, 2006;Nejdl et al, 2002;Oppenheimer et al, 2004;Shen, 2009;Talia et al, 2006;Zerfiridis & Karatza, 2003) which for example use super-peer (Mastroianni et al, 2005) or hierarchical (Liu et al, 2006) models. Apart from similarities between grid and peer to peer systems (Iamnitchi & Talia, 2005), they have critical differences in the field of security, users, applications, scale and etc.…”
Section: A Brief History Of the Resource Discovery In Gridmentioning
confidence: 99%
“…Most of the methods in resource discovery tend to peer to peer (Al-Dmour & Teahan, 2005;Ali et al, 2005;Basu et al, 2005;Bharambe et al, 2004;Cai & Hwang, 2007;Iamnitchi et al, 2002;Koo et al, 2006;Nejdl et al, 2002;Oppenheimer et al, 2004;Shen, 2009;Talia et al, 2006;Zerfiridis & Karatza, 2003) which for example use super-peer (Mastroianni et al, 2005) or hierarchical (Liu et al, 2006) models. Apart from similarities between grid and peer to peer systems (Iamnitchi & Talia, 2005), they have critical differences in the field of security, users, applications, scale and etc.…”
Section: A Brief History Of the Resource Discovery In Gridmentioning
confidence: 99%
“…The idea of aggregation has also appeared in sensor networks (Intanagonwiwat et al, 2003), where it is often called data fusion, as a way to reduce the amount of data transferred towards the sink node. Relatively recently, information aggregation appeared as an interesting topic in Peer-to-Peer (P2P) (Renesse et al, 2003) and P2P grid systems (Schulz et al, 2009) (Zhou, Hwang, 2006) (Cai, Hwang, 2007). These works focus on the architecture and on the mechanisms of the system performing the aggregation; on the other hand, in our work we assume that such a mechanism/system is in place and examine the aggregation operations that should be performed for different parameters, the aggregation policies that should be applied and the effects they have on scheduling efficiency.…”
Section: Previous Workmentioning
confidence: 99%
“…Most DHT-based broadcast algorithms [6][7][8]12,14,15,[27][28][29][30][31][32] have been recently proposed to support efficient broadcasting on large scale. These broadcast algorithms use the routing mechanisms of DHT to build up an overlay routing path between a source node and each destination node.…”
Section: Introductionmentioning
confidence: 99%