- In this paper we present the SimGrid framework which enables the
- simulation of distributed applications in distributed computing
- environments for the specific purpose of developing and evaluating
- scheduling algorithms. This paper focuses on SimGrid v2, which
- greatly improves on the first version of the software with more
- realistic network models and topologies. SimGrid v2 also enables
- the simulation of distributed scheduling agents, which has become
- critical for current scheduling research in large-scale platforms.
- After describing and validating these features, we present a case
- study by which we demonstrate the usefulness of SimGrid for
- conducting scheduling research.
-
-Previous publication do not cover the GRAS part of the framework. So, if you
-want to cite GRAS, please use this publication instead:
-
-\li <b>Gras: A Research & Development Framework for Grid and P2P
- Infrastructures</b>\n
- by <em>Martin Quinson</em>\n
- To appear: The 18th IASTED International Conference on
- Parallel and Distributed Computing and Systems (PDCS 2006)\n
- http://www.loria.fr/~quinson/articles/gras-iasted06.pdf
-
-\section pub_simulation Other publications about the SimGrid framework
-
-\li <b>The SimGrid Project - Simulation and Deployment of Distributed Applications</b>\n
- by <em>A. Legrand, M. Quinson, K. Fujiwara, H. Casanova</em>\n
- <b>POSTER</b> in Proceedings of the IEEE International Symposium on High Performance Distributed Computing (HPDC-15), Paris, France, May 2006.\n
- \htmlonly
- <a href="http://navet.ics.hawaii.edu/~casanova/homepage/papers/simgrid_hpdc06.pdf"><img src="poster_thumbnail.png" /></a>
- \endhtmlonly
- http://navet.ics.hawaii.edu/~casanova/homepage/papers/simgrid_hpdc06.pdf
-
-\li <b>A Network Model for Simulation of Grid Application</b>\n
- by <em>Henri Casanova and Loris Marchal</em>\n
- \anchor paper_tcp
- In this work we investigate network models that can be
- potentially employed in the simulation of scheduling algorithms for
- distributed computing applications. We seek to develop a model of TCP
- communication which is both high-level and realistic. Previous research
- works show that accurate and global modeling of wide-area networks, such
- as the Internet, faces a number of challenging issues. However, some
- global models of fairness and bandwidth-sharing exist, and can be link
- withthe behavior of TCP. Using both previous results and simulation (with
- NS), we attempt to understand the macroscopic behavior of
- TCP communications. We then propose a global model of the network for the
- Grid platform. We perform partial validation of this model in
- simulation. The model leads to an algorithm for computing
- bandwidth-sharing. This algorithm can then be implemented as part of Grid
- application simulations. We provide such an implementation for the
- SimGrid simulation toolkit.\n
- ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-40.ps.gz
-
-
-\li <b>MetaSimGrid : Towards realistic scheduling simulation of
- distributed applications</b>\n
- by <em>Arnaud Legrand and Julien Lerouge</em>\n
- Most scheduling problems are already hard on homogeneous
- platforms, they become quite intractable in an heterogeneous
- framework such as a metacomputing grid. In the best cases, a
- guaranteed heuristic can be found, but most of the time, it is
- not possible. Real experiments or simulations are often
- involved to test or to compare heuristics. However, on a
- distributed heterogeneous platform, such experiments are
- technically difficult to drive, because of the genuine
- instability of the platform. It is almost impossible to
- guarantee that a platform which is not dedicated to the
- experiment, will remain exactly the same between two tests,
- thereby forbidding any meaningful comparison. Simulations are
- then used to replace real experiments, so as to ensure the
- reproducibility of measured data. A key issue is the
- possibility to run the simulations against a realistic
- environment. The main idea of trace-based simulation is to
- record the platform parameters today, and to simulate the
- algorithms tomorrow, against the recorded data: even though it
- is not the current load of the platform, it is realistic,
- because it represents a fair summary of what happened
- previously. A good example of a trace-based simulation tool is
- SimGrid, a toolkit providing a set of core abstractions and
- functionalities that can be used to easily build simulators for
- specific application domains and/or computing environment
- topologies. Nevertheless, SimGrid lacks a number of convenient
- features to craft simulations of a distributed application
- where scheduling decisions are not taken by a single
- process. Furthermore, modeling a complex platform by hand is
- fastidious for a few hosts and is almost impossible for a real
- grid. This report is a survey on simulation for scheduling
- evaluation purposes and present MetaSimGrid, a simulator built
- on top of SimGrid.\n
- ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-28.ps.gz
-
-\li <b>SimGrid: A Toolkit for the Simulation of Application
- Scheduling</b>\n
- by <em>Henri Casanova</em>\n
- Advances in hardware and software technologies have made it
- possible to deploy parallel applications over increasingly large
- sets of distributed resources. Consequently, the study of
- scheduling algorithms for such applications has been an active area
- of research. Given the nature of most scheduling problems one must
- resort to simulation to effectively evaluate and compare their
- efficacy over a wide range of scenarios. It has thus become
- necessary to simulate those algorithms for increasingly complex
- distributed, dynamic, heterogeneous environments. In this paper we
- present SimGrid, a simulation toolkit for the study of scheduling
- algorithms for distributed application. This paper gives the main
- concepts and models behind SimGrid, describes its API and
- highlights current implementation issues. We also give some
- experimental results and describe work that builds on SimGrid's
- functionalities.\n
- http://grail.sdsc.edu/papers/simgrid_ccgrid01.ps.gz
-
-\section pub_ext Papers that use SimGrid-generated results (not counting our owns)
+ In this paper we describe the SimGrid framework, a
+ simulation-based framework for evaluating cluster, grid and P2P
+ algorithms and heuristics. This paper focuses on SimGrid v3, which
+ greatly improves on previous versions thanks to a novel and
+ validated modular simulation engine that achieves higher
+ simulation speed without hindering simulation accuracy. Also, two
+ new user interfaces were added to broaden the targeted research
+ community. After surveying existing tools and methodologies we
+ describe the key features and benefits of SimGrid.\n
+ http://www.loria.fr/~quinson/articles/SimGrid-uksim08.pdf
+
+\verbatim
+@InProceedings{simgrid,
+ author = {Casanova, Henri and Legrand, Arnaud and Quinson, Martin},
+ title = {{SimGrid: a Generic Framework for Large-Scale Distributed Experiments}},
+ booktitle = {10th IEEE International Conference on Computer Modeling and Simulation},
+ year = 2008,
+ month = mar
+}
+\endverbatim
+
+\section publis_others Other publications
+
+A lot of other papers where published about SimGrid. The list is
+splited in 3 pages (also accessible from the navbar on top of this page):
+ - \ref publis_core\n
+ This section contains papers describing some sub-parts of SimGrid,
+ or references superseeded by the one given above.
+ - \ref publis_extern\n
+ SimGrid is used by an ever growing scientific community. This
+ section lists all the papers resulting of works in which the core
+ SimGrid team were not involved.
+ - \ref publis_intra\n
+ This section lists the paper co-signed by at least one of the core
+ team member, and using SimGrid as a tool (and not studying SimGrid
+ itself).
+
+\section publis_count Amount of published papers using SimGrid results
+
+\htmlinclude publis_count.html
+
+\page publis_core Publications about the SimGrid framework
+
+\htmlinclude publis_core_bib.html
+
+\page publis_extern Papers that use SimGrid-generated results (not counting our owns)