X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/63a34d8e7adcbddfd28cf3c1f6669f94e1eb475c..da7e15623cc3e43bd5b30848b1b2283af9470b5c:/doc/index.doc diff --git a/doc/index.doc b/doc/index.doc index acc03e0f35..fe46817bcb 100644 --- a/doc/index.doc +++ b/doc/index.doc @@ -6,6 +6,11 @@ \endhtmlonly +\section hot_news HOT NEWS + +SimGrid 3.00 was released on 21st of August 2005. Get it from +here. + \section quick Quick start SimGrid is a toolkit that provides core functionalities for the simulation @@ -34,24 +39,23 @@ 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: - - \ref overview: Presentation of the toolkit, of each of its components + - \ref overview : Presentation of the toolkit, of each of its components and of their interactions. - - \ref people: Who is behind this project. - - \ref publications: Some articles providing more details about the + - \ref people : Who is behind this project. + - \ref publications : Some articles providing more details about the SimGrid toolkit or using and validating it.
\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). @@ -64,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. @@ -127,10 +131,12 @@ want to do and what would be the result of your work. If your favorite programming environment/model is not there (BSP, components, etc.) is not represented in the SimGrid toolkit yet, you may -consider adding it. You should contact us first, though. +consider adding it. You should contact us first on the +SimGrid +developers mailing list, though. Any question, remark or suggestion are welcome on the -SimGrid users +SimGrid users mailing list.
@@ -277,25 +283,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://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2005/RR2005-27.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