X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/mapping.git/blobdiff_plain/e9ad3655aa50dde188c7a9b905cc5fe81fba664f..4b994d60530bc4e2db2662b800207eafa2360c82:/javadoc/and/Mapping/package-summary.html
diff --git a/javadoc/and/Mapping/package-summary.html b/javadoc/and/Mapping/package-summary.html
deleted file mode 100644
index 7f69f11..0000000
--- a/javadoc/and/Mapping/package-summary.html
+++ /dev/null
@@ -1,210 +0,0 @@
-
-
-
-
-
-
-
-
-Class Summary |
-
-
-Algo |
-Abstract class defining the structure for mapping algorithms |
-
-
-Architecture |
-Class representing a set of clusters forming a network architecture |
-
-
-Association |
-Class representing an association between a tasks list and a cluster
- on which they are mapped, or between a task and a computing node |
-
-
-Cluster |
-Class representing a computing nodes cluster |
-
-
-DefaultMapping |
-Implementation of JaceP2P default mapping |
-
-
-GNode |
-Class representing a computing node |
-
-
-Graph |
-Class representing the interaction graph of an application |
-
-
-Grid |
-Class representing a computing grid, composed of multiple clusters |
-
-
-GTask |
-Class representing an application task |
-
-
-Linpack |
- |
-
-
-LSM |
-Mapping algorithm based on the Edge-Cut principles |
-
-
-Mapping |
-Class representing the tasks mapping on clusters and/or nodes |
-
-
-QM |
-Implementation of the AIAC Quick Quality Map (AIAC-QM) algorithm |
-
-
-Simple |
-Implementation of Simple Mapping algorithm |
-
-
-Utils |
-Class providing some tools to the library |
-
-
-
-
-