X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/be0f9191562ee0ec4c518ce70de694c29faa3106..97d3abf54943fe29eef37b8c639b736eafd7aa09:/doc/index.doc

diff --git a/doc/index.doc b/doc/index.doc
index 81e00b3404..d6eaeef154 100644
--- a/doc/index.doc
+++ b/doc/index.doc
@@ -6,6 +6,12 @@
 \endhtmlonly
 </center>
 
+\section hot_news HOT NEWS
+
+<b>SimGrid 2.95 (aka SimGrid 3beta2) was released on 1st July 2005. Get it from
+<a href="https://gforge.inria.fr/frs/?group_id=12">here</a>.</b> 
+SimGrid 3 was never as close as it is now...
+
 \section quick Quick start
 
 SimGrid is a toolkit that provides core functionalities for the simulation
@@ -17,8 +23,10 @@ Grids.
 
 \subsection quick_dl Getting and installing the software
 
-The SimGrid software package can be downloaded from 
-<a href="http://gcl.ucsd.edu/simgrid/dl/">here</a>.
+  - The official webpage is <a href="http://simgrid.gforge.inria.fr/">simgrid.gforge.inria.fr</a>. 
+  - The development webpage is <a href="https://gforge.inria.fr/projects/simgrid//">gforge.inria.fr/projects/simgrid</a>. 
+  - The user mailing list is <simgrid-user@lists.gforge.inria.fr>
+  - The SimGrid software package can be downloaded from <a href="https://gforge.inria.fr/frs/?group_id=12">here</a>. 
 
 To compile and install it, simply type the following. If you are not
 familiar with compiling C files under UNIX and using libraries, please check
@@ -39,10 +47,10 @@ use.
 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.
 
 <hr>
@@ -50,7 +58,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
-three-layered.
+three-layered (click on the picture to jump to a specific component).
 
 
 \htmlonly
@@ -68,9 +76,9 @@ The basement of the whole toolkit is constituted by the <b>\ref XBT_API
 (eXtended Bundle of Tools)</b>.
 
 It is a portable library providing some grounding features such as \ref
-XBT_log and \ref XBT_error. 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.
+XBT_log, \ref XBT_ex, \ref XBT_error 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.
 
@@ -125,10 +133,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 
+<a href=http://lists.gforge.inria.fr/mailman/listinfo/simgrid-devel>SimGrid 
+developers mailing list</a>, though.
 
 Any question, remark or suggestion are welcome on the 
-<a href=https://listes.ens-lyon.fr/wws/info/simgrid2-users>SimGrid users
+<a href=http://lists.gforge.inria.fr/mailman/listinfo/simgrid-user>SimGrid users
 mailing list</a>.
 
 <hr>
@@ -139,7 +149,7 @@ The authors of SimGrid are:
 
  - Henri Casanova <casanova#cs.ucsd.edu>
  - Arnaud Legrand <arnaud.legrand#imag.fr>
- - Martin Quinson <mquinson#debian.org>
+ - Martin Quinson <martin.quinson#loria.fr>
 
 \subsection contributers Contributers and alumni project members
 
@@ -147,7 +157,7 @@ The authors of SimGrid are:
    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.
+   in the LIP.
  - Clément Menier and Marc Perache : wrote a first prototype of the MSG
    interface during a project at ENS-Lyon (jan 2002). 
  - Dmitrii Zagorodnov : wrote some parts of the first version of SimGrid
@@ -275,25 +285,26 @@ a bit old now. We are actively working on improving this.
 
 \subsection research Papers using SimGrid results
 
-\li <b>Optimal algorithms for scheduling divisible workloads on
+\li <b> A study of meta-scheduling architectures for high throughput
+        computing: Pull vs. Push</b>\n
+    by <em> Vincent Garonne, Andrei Tsaregorodtsev, and Eddy Caron </em>\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 <b>Exploiting Replication and Data Reuse to Efficiently Schedule
+       Data-intensive Applications on Grids</b>\n
+    by <em> E. Santos-Neto, W. Cirne, F. Brasileiro, A. Lima.</em>\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 <b>Optimal algorithms for scheduling divisible workloads on 
        heterogeneous systems</b>\n
     by <em>Olivier Beaumont and Arnaud Legrand and Yves Robert</em>\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 <b>On-line Parallel Tomography</b>\n
     by <em>Shava Smallen</em>\n
     Masters Thesis, UCSD, May 2001