-
Eddy Caron,
Frédéric Desprez,
and Cédric Tedeschi.
Enhancing Computational Grids with Peer-to-Peer technology for Large Scale Service Discovery.
Journal of Grid Computing,
5(3):337-360,
September 2007.
Note: Hal-01429565.
Keywords:
DLPT,
LEGO,
P2P.
| Abstract: |
Within computational Grids, some services (typically software components, e.g., linear algebra libraries) are made available by some servers to some clients. In spite of the growing popularity of such Grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. Whereas merging peer-to-peer technology and Grid infrastructures has been widely suggested, very few implementations are available. The contribution of this paper is twofold. First, we present the design, the implementation and the experimentation of the first architecture, to our knowledge, extending traditional Network-Enabled Servers (NES) systems with an unstructured peer-to-peer network. This extension allows to dynamically connect distributed agents thus providing to clients an entry point to servers geographically distributed. Our implementation is based on the Diet middleware and the JXTA toolbox and experimentation have been conducted on a high speed network. Then, we study the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the peer-to-peer service discovery service, supporting range queries while providing fault-tolerance and taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. |
@Article{ ArticleCaron.CDT_JGC07,
abstract = {Within computational Grids, some services (typically software components, e.g., linear algebra libraries) are made available by some servers to some clients. In spite of the growing popularity of such Grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. Whereas merging peer-to-peer technology and Grid infrastructures has been widely suggested, very few implementations are available. The contribution of this paper is twofold. First, we present the design, the implementation and the experimentation of the first architecture, to our knowledge, extending traditional Network-Enabled Servers (NES) systems with an unstructured peer-to-peer network. This extension allows to dynamically connect distributed agents thus providing to clients an entry point to servers geographically distributed. Our implementation is based on the Diet middleware and the JXTA toolbox and experimentation have been conducted on a high speed network. Then, we study the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the peer-to-peer service discovery service, supporting range queries while providing fault-tolerance and taking into account the topology of the underlying network. We validate this approach both by analysis and simulation.},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Tedeschi, C{\'e}dric},
journal = {Journal of Grid Computing},
keywords = {DLPT, LEGO, P2P},
month = sep,
note = {hal-01429565},
number = {3},
pages = {337-360},
publisher = {Springer Netherlands},
title = {Enhancing Computational Grids with Peer-to-Peer technology for Large Scale Service Discovery},
url = {http://www.springerlink.com/content/946324035g533050/fulltext.pdf},
volume = {5},
year = {2007}
}
-
Eddy Caron,
Vincent Garonne,
and Andreï Tsaregorodtsev.
Definition, modelling and simulation of a grid computing scheduling system for high throughput computing.
Future Generation Computer Systems,
23(Issue 8):968-976,
November 2007.
Note: ISSN:0167-739X. hal number in2p3-00421380.
| Abstract: |
In this paper, we study and compare grid and global computing systems and outline the benefits of having a hybrid system called DIRAC. To evaluate the DIRAC scheduling for high throughput computing, a new model is presented and a simulator was developed for many clusters of heterogeneous nodes belonging to a local network. These clusters are assumed to be connected to each other through a global network and each cluster is managed via a local scheduler which is shared by many users. We validate our simulator by comparing the experimental and analytical results of a M/M/4 queuing system. Next, we do the comparison with a real batch system and we obtain an average error of 10.5 0.000000or the response time and 12 0.000000or the makespan. We conclude that the simulator is realistic and well describes the behaviour of a large-scale system. Thus we can study the scheduling of our system called DIRAC in a high throughput context. We justify our decentralized, adaptive and opportunistic approach in comparison to a centralized approach in such a context. |
@Article{ ArticleCaron.CGT_FGCS07,
abstract = {In this paper, we study and compare grid and global computing systems and outline the benefits of having a hybrid system called DIRAC. To evaluate the DIRAC scheduling for high throughput computing, a new model is presented and a simulator was developed for many clusters of heterogeneous nodes belonging to a local network. These clusters are assumed to be connected to each other through a global network and each cluster is managed via a local scheduler which is shared by many users. We validate our simulator by comparing the experimental and analytical results of a M/M/4 queuing system. Next, we do the comparison with a real batch system and we obtain an average error of 10.5 0.000000or the response time and 12 0.000000or the makespan. We conclude that the simulator is realistic and well describes the behaviour of a large-scale system. Thus we can study the scheduling of our system called DIRAC in a high throughput context. We justify our decentralized, adaptive and opportunistic approach in comparison to a centralized approach in such a context. },
author = {Caron, Eddy and Garonne, Vincent and Tsaregorodtsev, Andre{\"\i}},
journal = {Future Generation Computer Systems},
month = {November},
note = {ISSN:0167-739X. hal number in2p3-00421380},
number = {Issue 8},
pages = {968-976},
title = {Definition, modelling and simulation of a grid computing scheduling system for high throughput computing},
url = {https://hal.inria.fr/in2p3-00421380},
volume = {23},
year = {2007}
}
-
Gabriel Antoniu,
Eddy Caron,
Frédéric Desprez,
Aurélia Fèvre,
and Mathieu Jan.
Towards a Transparent Data Access Model for the GridRPC Paradigm.
In S. Aluru et al. (Eds), editor,
HiPC'2007. 14th International Conference on High Performance Computing.,
number 4873 of LNCS,
Goa. India,
pages 269-284,
December 2007.
Springer Verlag Berlin Heidelberg.
Note: Hal number inria-00447931.
Keywords:
DIET,
JuxMem,
LEGO.
@InProceedings{ InProceedingsAntoniu.ACDFJ_07,
address = {Goa. India},
author = {Antoniu, Gabriel and Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and F{\`e}vre, Aur{\'e}lia and Jan, Mathieu},
booktitle = {{HiPC'2007}. 14th International Conference on High Performance Computing.},
editor = {S. Aluru et al. (Eds)},
keywords = {DIET, JuxMem, LEGO},
month = dec,
note = {hal number inria-00447931},
number = {4873},
pages = {269-284},
publisher = {Springer Verlag Berlin Heidelberg},
series = {LNCS},
title = {Towards a Transparent Data Access Model for the {GridRPC} Paradigm},
url = {https://hal.inria.fr/inria-00447931},
year = {2007}
}
-
Hrachya Astsatryan,
Michel Daydé,
Aurélie Hurault,
Marc Pantel,
and Eddy Caron.
On defining a Web Interface for Linear Algebra Tasks over Computational Grids.
In International Conference on Computer Science and Information Technologies (CSIT'07),
Yerevan (Arménie),
September 2007.
Note: Hal-01429567.
Keywords:
LEGO.
@InProceedings{ InProceedingsAstsatryan.ADHPC_07,
address = {Yerevan (Arm{\'e}nie)},
author = {Astsatryan, Hrachya and Dayd{\'e}, Michel and Hurault, Aur{\'e}lie and Pantel, Marc and Caron, Eddy},
booktitle = {International Conference on Computer Science and Information Technologies (CSIT'07)},
keywords = {LEGO},
month = sep,
note = {hal-01429567},
title = {On defining a Web Interface for Linear Algebra Tasks over Computational Grids},
url = {https://hal.inria.fr/hal-01429567},
year = {2007}
}
-
Yves Caniou,
Eddy Caron,
Hélène Courtois,
Benjamin Depardon,
and Romain Teyssier.
Cosmological Simulations using Grid Middleware.
In Fourth High-Performance Grid Computing Workshop (HPGrid'07),
Long Beach, California, USA,
March 2007.
IEEE.
Note: Hal-01429585.
Keywords:
DIET,
LEGO.
@InProceedings{ InProceedingsCaniou.CCCDT_07,
address = {Long Beach, California, USA},
author = {Caniou, Yves and Caron, Eddy and Courtois, H{\'e}l{\`e}ne and Depardon, Benjamin and Teyssier, Romain},
booktitle = {Fourth High-Performance Grid Computing Workshop (HPGrid'07)},
keywords = {DIET, LEGO},
month = mar,
note = {hal-01429585},
publisher = {IEEE},
title = {Cosmological Simulations using Grid Middleware},
url = {https://hal.inria.fr/hal-01429585},
year = {2007}
}
-
Eddy Caron,
Frédéric Desprez,
Franck Petit,
and Cédric Tedeschi.
Snap-stabilizing Prefix Tree for Peer-to-peer Systems.
In 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems,
volume 4838 of Lecture Notes in Computer Science,
Paris, France,
pages 82-96,
November 2007.
Springer Verlag Berlin Heidelberg.
Note: Hal-01429571.
@InProceedings{ InProceedingsCaron.CDPT_07,
address = {Paris, France},
author = {Caron, Eddy and Desprez, Fr\'ed\'eric and Petit, Franck and Tedeschi, C\'edric},
booktitle = {9th International Symposium on Stabilization, Safety, and Security of Distributed Systems},
month = nov,
note = {hal-01429571},
pages = {82-96},
publisher = {Springer Verlag Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
title = {{Snap-stabilizing Prefix Tree for Peer-to-peer Systems}},
url = {https://hal.inria.fr/hal-01429571},
volume = {4838},
year = {2007}
}
-
Yves Caniou,
Eddy Caron,
Benjamin Depardon,
Hélène Courtois,
and Romain Teyssier.
Cosmological Simulations using Grid Middleware.
Technical report 6139,
Institut National de Recherche en Informatique et en Automatique (INRIA),
March 2007.
Note: Also available as LIP Research Report 2007-11. hal number inria-00135189v3.
Keywords:
Grid computing,
cosmological simulations,
DIET,
LEGO.
| Abstract: |
Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets. |
@TechReport{ TechReportRR-Institut-6139,
abstract = {Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets. },
author = {Caniou, Yves and Caron, Eddy and Depardon, Benjamin and Courtois, H{\'e}l{\`e}ne and Teyssier, Romain},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {Grid computing, cosmological simulations, DIET, LEGO},
month = mar,
note = {Also available as LIP Research Report 2007-11. hal number inria-00135189v3},
number = {6139},
title = {Cosmological Simulations using Grid Middleware},
url = {http://hal.inria.fr/inria-00135189},
year = 2007
}
-
Yves Caniou,
Eddy Caron,
Benjamin Depardon,
Hélène Courtois,
and Romain Teyssier.
Cosmological Simulations using Grid Middleware.
Technical report RR2007-11,
Laboratoire de l'Informatique du Parallélisme (LIP),
March 2007.
Note: Also available as INRIA Research Report 6139. hal-01429584.
Keywords:
Grid computing,
cosmological simulations,
DIET,
LEGO.
| Abstract: |
Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets. |
@TechReport{ TechReportRR-Laboratoire-RR2007-11,
abstract = {Within computational grids, some services (software components, linear algebra libraries, etc.) are made available by some servers to some clients. In spite of the growing popularity of such grids, the service discovery, although efficient in many cases, does not reach several requirements. Among them, the flexibility of the discovery and its efficiency on wide-area dynamic platforms are two major issues. Therefore, it becomes crucial to propose new tools coping with such platforms. Emerging peer-to-peer technologies provide algorithms allowing the distribution and the retrieval of data items while addressing the dynamicity of the underlying network. We study in this paper the service discovery in a pure peer-to-peer environment. We describe a new trie-based approach for the service discovery that supports range queries and automatic completion of partial search strings, while providing fault-tolerance, and partially taking into account the topology of the underlying network. We validate this approach both by analysis and simulation. Traditional metrics considered in peer-to-peer systems exhibits interesting complexities within our architecture. The analysis' results are confirmed by some simulation experiments run using several grid's data sets. },
author = {Caniou, Yves and Caron, Eddy and Depardon, Benjamin and Courtois, H{\'e}l{\`e}ne and Teyssier, Romain},
institution = {Laboratoire de l'Informatique du Parall{\'e}lisme (LIP)},
keywords = {Grid computing, cosmological simulations, DIET, LEGO},
month = mar,
note = {Also available as INRIA Research Report 6139. hal-01429584},
number = {RR2007-11},
pdf = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2007/RR2007-11.pdf},
title = {Cosmological Simulations using Grid Middleware},
url = {https://hal.inria.fr/hal-01429584},
year = 2007
}
-
Eddy Caron,
Frédéric Desprez,
Franck Petit,
and Cédric Tedeschi.
Snap-stabilizing Prefix Tree for Peer-to-peer Systems.
Technical report RR-6297,
Institut National de Recherche en Informatique et en Automatique (INRIA),
September 2007.
Note: Hal number: inria-00173050.
Keywords:
TPLD,
Peer-to-peer systems,
Fault-tolerance,
Self-stabilization,
Snap-stabilization,
Grid computing.
| Abstract: |
Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Prefix Trees appear to be among promising ways in the design of distributed data structures indexing resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide the first snap-stabilizing protocol for trie construction. We design particular tries called Proper Greatest Common Prefix (PGCP) Tree. The proposed algorithm arranges the n label values stored in the tree, in average, in O(h+h') rounds, where h and h' are the initial and final heights of the tree, respectively. In the worst case, the algorithm requires an O(n) extra space on each node, O(n) rounds and O(n^2) actions. However, simulations show that, using relevant data sets, this worst case is far from being reached and confirm the average complexities, making this algorithm efficient in practice. |
@TechReport{ TechReportRR-Institut-RR-6297,
abstract = {Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Prefix Trees appear to be among promising ways in the design of distributed data structures indexing resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide the first snap-stabilizing protocol for trie construction. We design particular tries called Proper Greatest Common Prefix (PGCP) Tree. The proposed algorithm arranges the n label values stored in the tree, in average, in O(h+h') rounds, where h and h' are the initial and final heights of the tree, respectively. In the worst case, the algorithm requires an O(n) extra space on each node, O(n) rounds and O(n^2) actions. However, simulations show that, using relevant data sets, this worst case is far from being reached and confirm the average complexities, making this algorithm efficient in practice.},
author = {Caron, Eddy and Desprez, Fr{\'e}d{\'e}ric and Petit, Franck and Tedeschi, C{\'e}dric},
institution = {Institut National de Recherche en Informatique et en Automatique (INRIA)},
keywords = {TPLD, Peer-to-peer systems, Fault-tolerance, Self-stabilization, Snap-stabilization, Grid computing},
month = sep,
note = {hal number: inria-00173050},
number = {RR-6297},
title = {Snap-stabilizing Prefix Tree for Peer-to-peer Systems},
url = {https://hal.inria.fr/inria-00173050},
year = 2007
}