L. V. Mancini-&-s and . Shrivastava, Fault-Tolerant Reference Counting for Garbage Collection in Distributed Systems, 1988.

]. G. Masini-90, A. Masini, D. Napoli, D. Colnet, K. Leonard et al., Langages de classes, Langages de Frames, Langages dÕActeurs, InterEditions The T9000 Communications Architecture, dans Networks, Routers and Transputers : Function, Performance, and Applications, pp.15-38, 1990.

. P. Mehra-&-b and . Wah, Automated Learning of Worload Measures for Load Balancing on a Distributed System, Procs. of the International Conference on Parallel Processing, pp.263-270, 1993.

M. Minsky, R. Framework, and . Knowledge, Dans : The Psychology of Computer Vision, pp.221-281, 1975.

W. G. Mooij-&, A. G. Goos, and J. Hartmanis, LIGTENBERG Architecture of a Communication Network Processor, LNCS N° Parallel Architectures and Languages Europe Parallel Architectures, vol.365, issue.1, pp.238-250, 1989.

S. Nettles, J. Oõtoole-&-d, and . Gifford, Concurrent Garbage Collection of Persistent Heap, 1993.

. F. Nugent-88-]-s and . Nugent, The iPSC/2 Direct-Connect Communication Technology, The 3rd Conf. on Hypercube Concurrent Computers and Applications, 1988.

E. Payan, C. Etude-dõune-architecture, P. Programmable, . Pierce-&-g, and . Regnier, D?finition Fonctionnelle et M?thodologie de Programmation The Paragon Implementation of th NX Message Passing Interface, Scalabale High- Performance Computing Conference, Th?se Docteur INPG, pp.184-190, 1991.

. J. Quinnn-87-]-m and . Quinn, Designing Efficient Algorithms for Parallel Computers, 1987.

]. J. Roch-92, A. Roch, . Vermeerbergen-&-g, and . Villard, Cost prediction for load-balancing: Application to algebraic computations, pp.467-478
DOI : 10.1007/3-540-55895-0_444

. A. Ross-&-b and . Mcmillin, Experimental Comparison of Bidding and Drafting Load Sharing Protocols, The 5th Distributed Memory Computing Conference, Procs, vol.II, pp.968-974, 1990.

Y. Saad and M. H. Schultz, Data communication in parallel architectures, Parallel Computing, vol.11, issue.2, pp.131-150, 1989.
DOI : 10.1016/0167-8191(89)90024-0

. P. Sansonnet-91-]-j and . Sansonnet, Concepts dÕArchitectures Avanc?es, 1990.

]. J. Sargeant-86, L. Sargeant, and . Balancing, Locality and Parallelism Control in Fine Grain Parallel Machines, 1986.

W. Sch?nauer-&-h, . R. Hafner-g, D. Joubert, F. J. Trystram, . J. Peters-&-d et al., Supercomputer Architectures and their Bottlenecks, PARCOÕ93, Dans : Parallel Computing : Trends and Applications, Elsevier Science B. V, pp.411-417, 1993.

. Bibliographie, ]. R. Sharma-91, . L. Sharma-&-m, and . Soffa, Parallel Generational Garbage Collection, Procs, of the OOPSLAÕ91 Conf. (SIGPLAN Notices, pp.16-32, 1991.

R. G. Smith, The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver, IEEE Transactions on Computers, vol.29, issue.12, pp.1104-1113, 1980.
DOI : 10.1109/TC.1980.1675516

Y. Sohma, K. Satoh, K. Kumon, H. Masuzawa-&-a, and . Itashiki, A New Parallel Inference Mechanism Based on Sequential Processing, Dans : Fifth Generation Computer Architecture, 1985.

. A. Stankovic-84a-]-j and . Stankovic, Simulations of Three Adaptative, Decentralized Controlled, Job Scheduling Algorithms, Computer Networks, vol.8, pp.199-217, 1984.

. A. Stankovic-84b-]-j, . S. Stankovic-&-i, and . Sidhu, An Adaptative Bidding Algorithm for Processe, Clusters and Distributed Groups, Procs. of Inter. Conf. on Parallel Processing, pp.49-59, 1984.

C. B. Stunkel, D. G. Shea, D. G. Grice, P. H. Hochschild-&-m, and . Tsao, The SP1 High- Performance Switch, Procs, of the Scalable High- Performance Computing Conference, pp.150-157, 1994.

. S. Takkella-&-s and . Seidel, Complete Exchange and Broadcast Algorithms for Meshes, Scalabale High-Performance Computing Conference, pp.422-428, 1994.

. Talbi-93-]-e.-g and . Talbi, Allocation de Processus sur les Architectures Parall?les?M?moireParall?les?Parall?les?M?moire Distribu?e, 1993.

. A. Trew-&-g and . Wilson, Past, Present, Parallel Survey of Available Parallel Computing Systems, 1991.

. Bibliographie, ]. Tsai-94, . K. Tsai-&-p, and . Mckinley, An Extended Dominating Node Approach to Collective Communication in All-Port Wormhole-Routed 2D Meshes, Scalable High-Performance Computing Conference, pp.199-206, 1994.

. W. Tucker-88-]-l, . G. Tucker-&-g, and . Robertson, Architecture and applications of the Connection Machine, Computer, vol.21, issue.8, pp.26-38, 1988.
DOI : 10.1109/2.74

D. Ungar-&-f and . Jackson, Tenuring policies for generation-based storage reclamation, of the Conference on Object-Oriented Programming Systems, Languages, and Applications, pp.1-17, 1988.
DOI : 10.1145/62084.62085

Y. T. Wang-&-j and . Moris, Load Sharing in Distributed Systems, IEEE Transactions on Computers, pp.204-217, 1985.

. D. Weinreb-&-d and . Moon, FLAVORS: Message Passing in the LISP Machine, MIT, A.I. Memo N ° 602, 1980.

. J. Xu-&-k and . Hwang, Heuristic Methods for Dynamic Load Balancing in a Message-Passing Multicomputer, Journal of Parallel and Distributed Computing, vol.18, issue.1, pp.1-13, 1993.

S. Zhou-&-d and . Ferrari, An Empirical Investigation of Load Indices for Load-Balancing Applications, 1988.

. Dans-cette-d?finition,-le-champ-<label>-est-une-adresse-de-branchement, Les mn?moniques correspondent au jeu dÕinstructions de R.C.A.I. Quant aux modes dÕadressage, ce sont ceux d?crits dans le premier chapitre