[1] SGI Origin 3000. URL : http ://
www.SGI.com/products/servers/origin/3000/.
20
[2] A. Alexandrov, M.F. Ionescu, K.E. Schauser et C.
Scheiman. LogGP : incorporating long messages into the logP model for
parallel computation. Journal of parallel and distributed computing. July
1997. 42
[3] Gene M. Amdahl. Validity of the single processor
approach to achieving large scale computing capabilities.afips 1967 spring
joint computer conference. volume 30, page 483-485, Apr 1967. 25
[4] Henri Casanova, Frédéric Desprez et
Frédéric Suter. From heterogeneous task scheduling to
heterogeneous mixed parallel scheduling. In Marco Danelutto, Domenico
Laforenza, et Marco Vanneschi, editors, Proceedings of the 10th International
Euro-Par Conference (Euro-Par'04), volume 3149 of LNCS, page 230-237,
Pisa, Italy, August/September 2004. Springer. 14
[5] Gerson G.H Cavalheiro. Thèse : ATHAPASCAN-1 :
Interface générique pour l'ordonnancement dans un environnement
d'exécution parallèle. 22 Novembre 1999. 28
[6] Philippe Chretienne. Task Scheduling Over Distributed
Memory Machines In Michel Cosnard Patrice Quinton Michel Raynal et Yves Robert,
editors, Parallel and distributed Algorithms. 1988. 53
[7] Y. Colin et P. Chretienne. CPM scheduling with small
interprocessor communication delays. operations research. 1991. 41
[8] Condor. URL : http ://
www.cs.wisc.edu/condor/.
15
[9] D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, E.E.
Santos, K.E. Schauser, R. Subramonian et T. von Eicken. LogP : A practical
model of parallel computation. Communications of the ACM. November 1996.
41
[10] V.-D. Cung, P. Fraigniaud, T. Gautier et D. Trystram.
De l'algorithme au support. In D. Barth, J. Chassin de Kergommeaux, J.-L.
Roch, and J. Roman, editors, ICaRE'97 : Conception et mise en xuvre
d'applications parallèles irrégulières de grande
taille. Aussois, France, December 1997. CNRS. 29
[11] J. Eisenbiegler, W. Lowe et A. Wehrenpfennig. On the
optimization by redundancy using an extended logP model. In international
conference advances in parallel and distributed computing. 1997. 42
[12] M.J Flynn. Reaction of the absorber as the mechanism of
radiative damping. volume 54, pages 1901-1909, Decembre 1966. 8
[13] Ian Foster et Carl Kesselman. The grid : Blueprint for
a new computing infrastructure. Morgan Kaufmann, San Francisco, 1999.
14
[14] hesham el rewimi et mostafa abd-el barr. Advanced
Computer Architecture and Parallel Processing. A John Wiley and Sons, INC
PUBLICATION, 2005. 8, 22, 23
[15] J.M.D. Hill, W.F. McColl et D.B. Skillircon. Questions
and answers about BSP. Technical report PRG-TR-15-96, Oxford University
Computing Laboratory. November 1996. 42
[16] InfiniBand. URL : http ://www.OpenPBS.org/. 21
[17] R. M. Karp et V. Ramachandran. Parallel algorithms
for sharedmemory machines. in j. van leeuwen, editor, handbook of theoretical
computer science. A : Algorithms and Complexity : 870-941, 1990. 36
[18] W.F. McColl. Scalable computing.In J. van Leeuwen,
editor, Computer Science Today : Recent Trends and Developments
Springer-Verlag, 1995. 42, 43
[19] Guillaume MERCIER. Communications à hautes
performances portables en environnements hiérarchiques,
hétérogènes et dynamiques. decembre 2004. 17
[20] technologie réseau Myrinet Myricom. URL : http
://www.myri.com/. 21
[21] Nanette J. B ODEN Danny C OHEN, Robert E. F ELDERMAN,
Alan E. K ULAWIK, Charles L.S EITZ, Jakov N. S EIZOVIC et Wen-King S U.
Myrinet : A Gigabit-per-Second Local Area Network. IEEE Micro, volume
15., février 1995. 21
[22] C.H. Papadimitriou et J. Ullman. A communication time
tradeoff. SIAM journal on computing. pages 16(4) :639-646, 1987. 38
[23] C.H. Papadimitriou et M. Yannakakis. Towards an
architectureindependent analysis of parallel algorithms. siam journal on
computing. pages 19(2) : 322-328, April 1990. 39
[24] Quadrics. URL : http ://www.Quadrics.com/. 21
[25] Andrei Radulescu, Cristina Nicolescu, Arjan J. C. van
Gemund et Pieter Jonker. CPR. Mixed task and data parallel scheduling for
distributed systems. In Proceedings of the 15th International Parallel and
Distributed Processing Symposium (IPDPS'01). IEEE Computer Society, 2001.
13
[26] Andrei Radulescu et Arjan J. C. van Gemund. A
low-cost approach towards mixed task and data parallel scheduling. In
Proceedings of the 15th International Conference on Parallel Processing
(ICPP'01), page 69-76. IEEE Computer Society, 2001. 13
[27] Shankar Ramaswamy, Sachin Sapatnekar et Prithviraj
Banerjee. A Framework for Exploiting Task and Data Parallelism on
Distributed Memory Multicomputers. IEEE Transactions on Parallel and
Distributed Systems. IEEE Computer Society, Nov 1997. 13
[28] V.J. Rayward-Smith. UET scheduling with unit
interprocessor communication delays. Discrete Applied Mathematics. 1987.
39
[29] MPI Forum ( Standards; archives; etc.). URL : http
://www.MPI-Forum.org/. 7
[30] L.G. Valiant. A bridging model for parallel
computation. communications of the ACM. pages 33(8) :103-111 August 1990.
42, 43
[31] Cray XT3. URL : http ://
www.Cray.com/products/xt3/index.html.
21
[32] YAMPII. URL : http ://now.cs.berkeley.edu/. 16
