Advertisement

Improving the Scalability of SimGrid Using Dynamic Routing

  • Silas De Munck
  • Kurt Vanmechelen
  • Jan Broeckhove
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5544)

Abstract

Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimGrid is such a framework, that is widely used and mature. However, we have identified a scalability problem in SimGrid’s network simulation layer that limits the number of hosts one can incorporate in a simulation. For modeling large-scale systems such as grids this is unfortunate, as the simulation of systems with tens of thousands of hosts is required. This paper describes how we have overcome this limitation through more efficient storage methods for network topology and routing information. It also describes our use of dynamic routing calculations as an alternative to the current SimGrid method which relies on a static routing table. This reduces the memory footprint of the network simulation layer significantly, at the cost of a modest increase in the runtime of the simulation. We evaluate the effect of our approach quantitatively in a number of experiments.

Keywords

Grid Computing Grid Simulation Scalability SimGrid Routing Algorithm Boost Graph Library 

References

  1. 1.
    Casanova, H., Legrand, A., Quinson, M.: SimGrid: A generic framework for large-scale distributed experiments. In: Proceedings of the 10th IEEE International Conference on Computer Modelling and Simulation (UKSIM/EUROSIM 2008), Washington, DC, USA, pp. 126–131. IEEE Computer Society, Los Alamitos (2008)CrossRefGoogle Scholar
  2. 2.
    Frincu, M.E., Quinson, M., Suter, F.: Handling very large platforms with the new simgrid platform description formalism. Technical Report 0348, INRIA (2008)Google Scholar
  3. 3.
    Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 345 (1962)CrossRefGoogle Scholar
  4. 4.
    Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Siek, J., Lee, L.: The boost graph library (BGL) (2000)Google Scholar
  6. 6.
    Austern, M.H.: Generic Programming and the STL: Using and Extending the C++ Standard Template Library. Addison Wesley Longman Inc., Amsterdam (1999)Google Scholar
  7. 7.
    Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Bovet, D., Cesati, M.: Understanding the Linux Kernel, 3rd edn. O’Reilly Media, Inc., Sebastopol (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Silas De Munck
    • 1
  • Kurt Vanmechelen
    • 1
  • Jan Broeckhove
    • 1
  1. 1.Department of Computer Science and MathematicsUniversity of AntwerpAntwerpBelgium

Personalised recommendations