/*! \page publis Reference publications about SimGrid
When citing SimGrid, the prefered reference paper is Scheduling
Distributed Applications: the SimGrid Simulation Framework, even if it's
a bit old now. We are actively working on improving this.
\li Scheduling Distributed Applications: the
SimGrid Simulation Framework\n
by Henri Casanova and Arnaud Legrand and Loris Marchal\n
Proceedings of the third IEEE International Symposium
on Cluster Computing and the Grid (CCGrid'03)\n
Since the advent of distributed computer systems an active field
of research has been the investigation of scheduling strategies
for parallel applications. The common approach is to employ
scheduling heuristics that approximate an optimal
schedule. Unfortunately, it is often impossible to obtain
analytical results to compare the efficacy of these heuristics.
One possibility is to conducts large numbers of back-to-back
experiments on real platforms. While this is possible on
tightly-coupled platforms, it is infeasible on modern distributed
platforms (i.e. Grids) as it is labor-intensive and does not
enable repeatable results. The solution is to resort to
simulations. Simulations not only enables repeatable results but
also make it possible to explore wide ranges of platform and
application scenarios.\n
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.\n
http://www-id.imag.fr/Laboratoire/Membres/Legrand_Arnaud/articles/simgrid2_CCgrid03.pdf
Previous publication do not cover the GRAS part of the framework. So, if you
want to cite GRAS, please use this publication instead:
\li Gras: A Research & Development Framework for Grid and P2P
Infrastructures\n
by Martin Quinson\n
Best paper of 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 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
Year | 2000 | 2001 | 2002 | 2003 | 2004 | 2005 | 2006 | 2007 |
Amount of papers external to the core team |
- | - | - | 3 | 6 | 3 | 8 | 5 |
Amount of papers co-signed by one team member |
1 | 1 | 1 | 2 | 2 | - | 4 | 4 |
\page publis_core Other publications about the SimGrid framework
\li Speed and Accuracy of Network Simulation in the SimGrid Framework\n
by K. Fujiwara, H. Casanova\n
in Proceedings of the First International Workshop on Network Simulation Tools (NSTools), Nantes, France, October 2007.\n
http://navet.ics.hawaii.edu/~casanova/homepage/papers/fujiwara_nstool2007.pdf
\li Cost and Accuracy of Packet-Level vs. Analytical Network Simulations: An Empirical Study\n
by K. Fujiwara\n
M.S. Thesis, Dept. of Information and Computer Sciences, University of Hawai`i at Manoa, April 2007.\n
http://navet.ics.hawaii.edu/~casanova/homepage/theses/kayo_fujiwara_MS.pdf
\li The SimGrid Project - Simulation and Deployment of Distributed Applications\n
by A. Legrand, M. Quinson, K. Fujiwara, H. Casanova\n
POSTER in Proceedings of the IEEE International Symposium on High Performance Distributed Computing (HPDC-15), Paris, France, May 2006.\n
\htmlonly
\endhtmlonly
http://navet.ics.hawaii.edu/~casanova/homepage/papers/simgrid_hpdc06.pdf
\li A Network Model for Simulation of Grid Application\n
by Henri Casanova and Loris Marchal\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 MetaSimGrid : Towards realistic scheduling simulation of
distributed applications\n
by Arnaud Legrand and Julien Lerouge\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 SimGrid: A Toolkit for the Simulation of Application
Scheduling\n
by Henri Casanova\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
\page publis_extern Papers that use SimGrid-generated results (not counting our owns)
This list is a selection of articles. We list only papers written by people
external to the development group, but we also use our tool ourselves (see
next section).
- 2007
- Reactive Grid Scheduling of DAG Applications.\n by
I. Hernandez and M. Cole (UK). In Parallel and Distributed Computing and Networks, 2007.\n
http://www.actapress.com/PaperInfo.aspx?PaperID=29625
- Dynamic Scheduling of Multi-Processor Tasks on Clusters of Clusters\n
by S. Hunold, T. Rauber and G. Rünger.\n
In 8th IEEE/ACM International Conference on Grid Computing (Grid 2007), Austin, TX, September 2007.
- Scheduling Δ-Critical Tasks in Mixed-Parallel Applications on a National Grid\n
by Frédéric Suter.\n
In 8th IEEE/ACM International Conference on Grid Computing (Grid 2007), Austin, TX, September 2007.
- Brokering strategies in computational grids using stochastic
prediction models.\n by Vandy Berten and Bruno
Gaujal. In Parallel Computing, vol. 33(4-5): 238-249, 2007.\n
http://dev.ulb.ac.be/sched/articles/PARCO.pdf
- Managing Scheduling and Replication in the LHC Grid.\n by
Thomas Ferrandiz and Vania Marangozova. In CoreGrid
Workshop on middleware, 2007.\n
- 2006
- Simbatch: an API for simulating and predicting the performance of parallel resources and batch systems.\n
by Jean-Sébastien Gay and Yves Caniou\n
INRIA Research Report 6040, November 2006.\n
https://hal.inria.fr/inria-00115880
- Simbatch : une API pour la simulation et la prédiction de performances de systèmes batch\n
by Jean-Sébastien Gay and Yves Caniou.\n
In 17ème Rencontres Francophones du Parallélisme, des Architectures et des Systèmes, RenPar'17.\n
October 4-6, Perpignan, France
- Metascheduling Multiple Resource Types using the MMKP\n
by D. Vanderster, N. Dimopoulos, R. Sobie\n
7th IEEE/ACM International Conference on Grid Computing\n
Barcelona, September 28th-29th 2006
- Master-Slave Tasking on Asymmetric Networks\n
by Cyril Banino-Rokkones, Olivier Beaumont and Lasse Natvig.\n
In Proceedings of 12th International Euro-Par Conference, Euro-Par 2006.\n
August 29 - September 1, Pages 167--176, Dresden, Germany.
- Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms\n
by Tchimou N'Takpé and Frédéric Suter\n
Proceedings of the Twelfth International Conference on Parallel and Distributed Systems (ICPADS)\n
Minneapolis, MN, July 12-15, 2006.
- Sensitivity Analysis of Knapsack-based Task Scheduling on the Grid\n
by D.C. Vanderster and N.J. Dimopoulos.\n
In Proceedings of The 20th ACM International Conference on Supercomputing\n
Cairns, Australia, June 28-July 1, 2006.\n
http://portal.acm.org/citation.cfm?id=1183401.1183446&coll=GUIDE&dl=%23url.coll
- Hierarchical Scheduling of Independent Tasks with Shared Files\n
by H. Senger, F. Silva, W. Nascimento.\n
Proceedings of the Sixth IEEE International Symposium on Cluster
Computing and the Grid Workshop (CCGRIDW'06)\n
Singapore, 16-19 May 2006.\n
http://www.unisantos.br/mestrado/informatica/hermes/File/senger-HierarchicalScheduling-Workshop-TB120.pdf
- Evaluation of Knapsack-based Scheduling using the NPACI JOBLOG\n
by D. Vanderster, N. Dimopoulos, R. Parra-Hernandez and R. Sobie.\n
20th International Symposium on High-Performance Computing in an
Advanced Collaborative Environment (HPCS'06)\n
St. John's, Newfoundland, Canada, 14-17 May 2006\n
http://doi.ieeecomputersociety.org/10.1109/HPCS.2006.23
- 2005
- On Dynamic Resource Management Mechanism using Control
Theoretic Approach for Wide-Area Grid Computing\n
by Hiroyuki Ohsaki, Soushi Watanabe, and Makoto Imase\n
in Proceedings of IEEE Conference on Control Applications (CCA 2005), Aug. 2005.\n
http://www.ispl.jp/~oosaki/papers/Ohsaki05_CCA.pdf
- Evaluation of Meta-scheduler Architectures and Task Assignment Policies for
high Throughput Computing\n
by Eddy Caron, Vincent Garonne and Andrei Tsaregorodtsev\n
Proceedings of 4th Internationnal Symposium on Parallel and
Distributed Computing Job Scheduling Strategies for Parallel
Processing (ISPDC'05), July 2005.\n
http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2005/RR2005-27.pdf
- Algorithmes de redistribution de données pour anneaux de processeurs hétérogènes\n
by Héléne Renard, Yves Robert and Frédéric Vivien\n
In 16ième Rencontres Francophones du Parallélisme des Architectures et des Systèmes, Le Croisic, France, 6-8 avril 2005.\n
http://www.polytech.unice.fr/~hrenard/recherche/Renpar16.ps
- 2004
- Deadline Scheduling with Priority for Client-Server Systems on the Grid\n
by Eddy Caron, PK Chouhan, Frédéric Desprez\n
in IEEE International Conference On Grid Computing. Super Computing 2004, oct 2004.
- Efficient Scheduling Heuristics for GridRPC Systems\n
by Yves Caniou and Emmanuel Jeannot.\n
in IEEE QoS and Dynamic System workshop (QDS) of International Conference
on Parallel and Distributed Systems (ICPADS), New-Port Beach California, USA,
pages 621-630, July 2004\n
http://graal.ens-lyon.fr/~ycaniou/QDS04.ps
- Exploiting Replication and Data Reuse to Efficiently Schedule
Data-intensive Applications on Grids\n
by E. Santos-Neto, W. Cirne, F. Brasileiro, A. Lima.\n
Proceedings of 10th Job Scheduling Strategies for Parallel Processing, June 2004.\n
http://www.lsd.ufcg.edu.br/~elizeu/articles/jsspp.v6.pdf
- Resource Management and Knapsack Formulations on the Grid\n
by R. Parra-Hernandez, D. Vanderster and N. J. Dimopoulos\n
Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)\n
http://doi.ieeecomputersociety.org/10.1109/GRID.2004.54
- Scheduling BoT Applications in Grids using a Slave Oriented Adaptive
Algorithm.\n
by T. Ferreto, C. A. F. De Rose and C. Northfleet.\n
Second International Symposium on Parallel and Distributed Processing
and Applications (ISPA), 2004, Hong Kong. Published in Lecture Notes in
Computer Science (LNCS), Volume 3358, by Springer-Verlag. p. 392-398.
- Data redistribution algorithms for heterogeneous processor rings\n
by Héléne Renard, Yves Robert and Frédéric Vivien\n
In International Conference on High Performance Computing HiPC'2004\n
http://www.polytech.unice.fr/~hrenard/recherche/Hipc.pdf
- 2003
- Link-Contention-Aware Genetic Scheduling Using Task Duplication in Grid Environments\n
by Wensheng Yao, Xiao Xie and Jinyuan You\n
in Grid and Cooperative Computing: Second International Workshop, GCC 2003, Shanghai, China, December 7-10, 2003 (LNCS)\n
http://www.chinagrid.edu.cn/chinagrid/download/GCC2003/pdf/266.pdf
- New Dynamic Heuristics in the Client-Agent-Server Model\n
by Yves Caniou and Emmanuel Jeannot\n
in IEEE 13th Heteregeneous Computing Workshop - HCW'03, Nice, France, April 2003.\n
http://graal.ens-lyon.fr/~ycaniou/HCW03.ps
- A Hierarchical Resource Reservation Algorithm for Network Enabled Servers\n
by Eddy Caron, Frédéric Desprez, Franck Petit, V. Villain\n
in the 17th International Parallel and Distributed Processing Symposium -- IPDPS'03, Nice - France, April 2003.
\page publis_intra Our own papers that use SimGrid-generated results
This list is a selection of the articles we have written that used results
generated by SimGrid.
- 2007
- Assessing the Quality of Automatically Built Network Representations\n
by Lionel Eyraud-Dubois and Martin Quinson\n
In Seventh IEEE International Symposium on Cluster Computing and
the Grid (CCGrid 2007), 14-17 May 2007, Rio de Janeiro, Brazil.
- A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms\n
by Tchimou N'takpé, Frédéric Suter, and Henri Casanova\n
In 6th International Symposium on Parallel and Distributed Computing, Hagenberg, Austria, July 2007.
- A First Step Towards Automatically Building Network Representations\n
by Lionel Eyraud-Dubois, Arnaud Legrand, Martin Quinson and Frédéric Vivien\n
In 12th International Euro-Par Conference 28-31 August, Rennes, France.
- Centralized Versus Distributed Schedulers Multiple Bag-of-Tasks Applications\n
by Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, and Yves Robert\n
In IEEE Trans. Parallel Distributed Systems, 2007.
- 2006
- On the Harmfulness of Redundant Batch Requests\n
by H. Casanova\n
Proceedings of the IEEE International Symposium on High Performance Distributed Computing (HPDC-15), Paris, France, May 2006.\n
http://navet.ics.hawaii.edu/~casanova/homepage/papers/hpdc_2006.pdf
- An evaluation of Job Scheduling Strategies for Divisible Loads on Grid Platforms\n
by Y. Cardinale, H. Casanova\n
in Proceedings of the High Performance Computing & Simulation Conference (HPC&S'06), Bonn, Germany, May 2006.\n
http://navet.ics.hawaii.edu/~casanova/homepage/papers/cardinale_2006.pdf
- Centralized Versus Distributed Schedulers Multiple Bag-of-Tasks Applications\n
by Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, and Yves Robert\n
International Parallel and Distributed Processing Symposium IPDPS'2006, 2006
- Interference-Aware Scheduling\n
by B. Kreaseck, L. Carter, H. Casanova, J. Ferrante, S. Nandy\n
International Journal of High Performance Computing Applications (IJHPCA).\n
http://navet.ics.hawaii.edu/~casanova/homepage/papers/kreaseck_ijhpca_2005.pdf
- 2004
- From Heterogeneous Task Scheduling to Heterogeneous Mixed Data and Task Parallel Scheduling\n
by F. Suter, V. Boudet, F. Desprez, H. Casanova\n
Proceedings of Europar, 230--237, (LCNS volume 3149), Pisa, Italy, August 2004.
- On the Interference of Communication on Computation\n
by B. Kreaseck, L. Carter, H. Casanova, J. Ferrante\n
Proceedings of the workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems, Santa Fe, April 2004.\n
http://navet.ics.hawaii.edu/~casanova/homepage/papers/k_pmeo2004.pdf
- 2003
- RUMR: Robust Scheduling for Divisible Workloads\n
by Y. Yang, H. Casanova\n
Proceedings of the 12th IEEE Symposium on High Performance and Distributed Computing (HPDC-12), Seattle, June 2003.\n
http://navet.ics.hawaii.edu/~casanova/homepage/papers/yang_hpdc2003.pdf
- Resource Allocation Strategies for Guided Parameter Space Searches\n
by M. Faerman, A. Birnbaum, F. Berman, H. Casanova\n
International Journal of High Performance Computing Applications (IJHPCA), 17(4), 383--402, 2003.\n
http://grail.sdsc.edu/papers/faerman_ijhpca04.pdf
- 2002
- Resource Allocation for Steerable Parallel Parameter Searches\n
by M. Faerman, A. Birnbaum, H. Casanova, F. Berman\n
Proceedings of the Grid Computing Workshop, Baltimore, 157--169, November 2002.\n
http://grail.sdsc.edu/projects/vi_itr/grid02.pdf
- 2001
- Applying Scheduling and Tuning to On-line Parallel Tomography \n
by Shava Smallen, Henri Casanova, Francine Berman\n
in Proceedings of Supercomputing 2001\n
http://grail.sdsc.edu/papers/tomo_journal.ps.gz
- 2000
- Heuristics for Scheduling Parameter Sweep applications in Grid environments\n
by Henri Casanova, Arnaud Legrand, Dmitrii Zagorodnov and Francine Berman\n
in Proceedings of the 9th Heterogeneous Computing workshop (HCW'2000), pp349-363.\n
http://navet.ics.hawaii.edu/~casanova/homepage/papers/hcw00_pst.pdf
*/
\li Optimal algorithms for scheduling divisible workloads on
heterogeneous systems\n
by Olivier Beaumont and Arnaud Legrand and Yves Robert\n
in Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS'03).\n
Preliminary version on ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-36.ps.gz
\li On-line Parallel Tomography\n
by Shava Smallen\n
Masters Thesis, UCSD, May 2001