The Community for Technology Leaders
Parallel and Distributed Computing, International Symposium on (2006)
Timisoara, Romania
July 6, 2006 to July 9, 2006
ISBN: 0-7695-2638-1
pp: 220-229
L. Philippe , Laboratoire d'Informatique de l'Universite de Franche-Comte (LIFC), France
S. Damy , Laboratoire d'Informatique de l'Universite de Franche-Comte (LIFC), France
B. Herrmann , Laboratoire d'Informatique de l'Universite de Franche-Comte (LIFC), France
I. Djama , Laboratoire d'Informatique de l'Universite de Franche-Comte (LIFC), France
S. Dahan , Laboratoire d'Informatique de l'Universite de Franche-Comte (LIFC), France
ABSTRACT
The Internet development and the availability of reliable networks led to the emergence of Grid architectures. The aim of these architectures is to take benefit of widely distributed resources to improve execution possibilities. Depending on their properties, these architectures are usually classified into desktop grids, resources grids and application based grids. Application based grids provide an easy access to applications deployed on the grid on the ASP (Application Service Provider) mode. When these grids grow of orders of magnitude, application lookup will become a costly activity of the grid. In this article, we study how a lookup algorithm scales when the size of the grid grows up. We exhibit a "lookup throughput" which characterizes the grid interconnections graph and the lookup algorithm.
INDEX TERMS
Lookup algorithm, Application Service Provider, Grids, Graph traversal.
CITATION

B. Herrmann, S. Damy, I. Djama, L. Philippe and S. Dahan, "Evaluation of a Large Scale Lookup Algorithm in ASP Based Grids," 2006 5th International Symposium on Parallel and Distributed Computing(ISPDC), Timisoara, 2006, pp. 220-229.
doi:10.1109/ISPDC.2006.24
94 ms
(Ver 3.3 (11022016))