2007/02/13 by Lionel Eyraud-Dubois, Lionel Eyraud‐Dubois, Eyraud-Dubois, Lionel +6
Computer Science · #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Graph Theory and Algorithms #Parallel #Peer-to-Peer Network Technologies #and Cluster Computing (cs.DC) #cs.DC
paper · pdf · doi:10.48550/arxiv.cs/0702076
openalex publication_date 2007/02/13 · arxiv created 2007/06/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must uses tools which automatically build a topological network model through some measurements. In this article, we define a methodology to assess the quality of these network model building tools, and we apply this methodology to representatives of the main classes of model builders and to two new algorithms. We show that none of the main existing techniques build models that enable to accurately predict the running time of simple application kernels for actual platforms. However some of the new algorithms we propose give excellent results in a wide range of situations.