X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/b98287aa2f5a15cca6b1f56c3ff58567cc311a85..095896b81aaf9cc8975bbb3d78df4cc39d1e4825:/doc/index.doc?ds=sidebyside diff --git a/doc/index.doc b/doc/index.doc index 4074f66282..761e1561e1 100644 --- a/doc/index.doc +++ b/doc/index.doc @@ -8,9 +8,8 @@ \section hot_news HOT NEWS -SimGrid 2.94 (aka SimGrid 3beta1) was released on 13 May 2005. Get it from +SimGrid 3.0.1 was released on 22st of October 2005. Get it from here. -SimGrid 3 was never as close as it is now... \section quick Quick start @@ -40,9 +39,8 @@ pre-compiled binaries [yet]. \subsection quick_more More information -The API is described here while -this page presents some example of -use. +The API (along with some example of +use) is described in \ref SimGrid_API. For more information about the SimGrid toolkit, please simply keep reading this page. It is organized as follow: @@ -57,7 +55,7 @@ this page. It is organized as follow: \section overview Overview of the toolkit components -As depicted by the following schema, the SimGrid toolkit is basically +As depicted by the following diagram, the SimGrid toolkit is basically three-layered (click on the picture to jump to a specific component). @@ -70,14 +68,14 @@ three-layered (click on the picture to jump to a specific component). \endhtmlonly -\subsection overview_fondation Basement layer +\subsection overview_fondation Base layer -The basement of the whole toolkit is constituted by the \ref XBT_API +The base of the whole toolkit is constituted by the \ref XBT_API (eXtended Bundle of Tools). It is a portable library providing some grounding features such as \ref -XBT_log, \ref XBT_error and \ref XBT_config. XBT also encompass the -following convenient datastructures: \ref XBT_dynar, \ref XBT_fifo, \ref +XBT_log, \ref XBT_ex and \ref XBT_config. XBT also encompass +the following convenient datastructures: \ref XBT_dynar, \ref XBT_fifo, \ref XBT_dict, \ref XBT_heap, \ref XBT_set and \ref XBT_swag. See the \ref XBT_API section for more details. @@ -145,16 +143,17 @@ mailing list. \section people People -The authors of SimGrid are: +SimGrid is a joint project between University of Hawai at Manoa, ID +Laboratory (Grenoble, France) and University of Nancy (France). The +authors of SimGrid are: - - Henri Casanova - - Arnaud Legrand - - Martin Quinson + - Henri Casanova (Information and Computer Sciences Department, University of Hawai`i at Manoa) + - Arnaud Legrand ("Informatique et Distribution" Laboratory (Grenoble, France), MESCal project) + - Martin Quinson (University of Nancy (Nancy, France), LORIA Laboratory, Algorille project) \subsection contributers Contributers and alumni project members - - Loris Marchal: wrote the new algorithm for simulation TCP - bandwidth-sharing. + - Loris Marchal: wrote the algorithm for simulation TCP bandwidth-sharing. - Julien Lerouge : wrote a XML parser for ENV descriptions and helped for the general design during a 4 month period (march-june 2002) in the LIP. @@ -285,25 +284,26 @@ a bit old now. We are actively working on improving this. \subsection research Papers using SimGrid results -\li Optimal algorithms for scheduling divisible workloads on +\li A study of meta-scheduling architectures for high throughput + computing: Pull vs. Push\n + by Vincent Garonne, Andrei Tsaregorodtsev, and Eddy Caron \n + Proceedings of 4th Internationnal Symposium on Parallel and + Distributed Computing Job Scheduling Strategies for Parallel + Processing (ISPDC'05), July 2005.\n + Preliminary version in http://marwww.in2p3.fr/~garonne/garonne-meta.pdf + +\li 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 + +\li Optimal algorithms for scheduling divisible workloads on heterogeneous systems\n by Olivier Beaumont and Arnaud Legrand and Yves Robert\n - In this paper, we discuss several algorithms for scheduling - divisible loads on heterogeneous systems. Our main contributions - are (i) new optimality results for single-round algorithms and (ii) - the design of an asymptotically optimal multi-round algorithm. This - multi-round algorithm automatically performs resource selection, a - difficult task that was previously left to the user. Because it is - periodic, it is simpler to implement, and more robust to changes in - the speeds of processors or communication links. On the theoretical - side, to the best of our knowledge, this is the first published - result assessing the absolute performance of a multi-round - algorithm. On the practical side, extensive simulations reveal - that our multi-round algorithm outperforms existing solutions on a - large variety of platforms, especially when the - communication-to-computation ratio is not very high (the difficult - case).\n - ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-36.ps.gz + 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