. Le-contr^-oleur-de-la, encha^ nement des phases de la forme canonique. Le seul processeur capable de ceci est le transputer de contr^ ole. En utilisantlav oie de contr^ ole, celui-ci peut d etecter la aen de l'ex ecution d'une transition. Une fois celle-ci eaeectu ee

E. H. Aarts and P. J. Van-laarhoven, Statistical cooling: a general approachtocombinatorial optimization problems, Philips Journal of Research, pp.400-444, 1985.

W. C. Mai, Fine Grain Concurrent Computation, Caltech Computer Science, issue.1, 1987.

L. Bomans and D. Roose, Benchmarking the ipscè2 hypercube multiprocessor. Concurrency: Practice and Exprerience, pp.4-18, 1989.

Y. C. Chow and W. H. Kohler, Models for dynamic load balancing in heteregenous multiple processor systems, IEEE Trans. on Computers, p.28, 1979.

A. Evans, J. King, and B. Noble, Helios C Manual. Perihelion Software Limited, 24è25 Brewmaster Buildings,Charlton Trading Estate Shepton Mallet, 1988.

T. El-ghazali-rapport and D. I. Grenoble, Allocation dynamique de processus sur une architecturep arall ele, 1989.

D. L. Eager, E. D. Lazowska, and L. H. Jamieson, Adaptative load sharing in homogeneous distributed systems, IEEE Trans. on Software Engineering, 1984.

J. Eudes, Assembleur PDS : Manuel de r ef erence. LGI-IMAG, 1987.

N. H. Garnett, Helios -an operating system for the transputer In 7 th Occam User Group, pages 411í419, Septembre 1987. ëGJ79ë M.R. Garey and D.S. Johson. Computers and Intractability: A Guide of the Theory of NP-Completeness, pp.14-16, 1979.

M. Goldsmith-hwang, W. J. Croft, G. H. Goble, B. W. Wah, F. A. Briggs et al., Occam transformation at oxford. In 7 th Occam User Group A unix-based local computer network with load balencing, IEEE Trans. on Computers, pp.37-54, 1982.

G. Hill, Tecnical note 19: Designs and Applications for the IMS C004, INMOS Limited, 1987.

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

L. Hyaael and R. L. Rivest, Graph Partitioning and Constructing Optimal Decision Trees are Polynomial Complete Problems, 1973.

J. W. Flower, S. W. Otto, and M. C. Salama, AP r eprocessor for Irregular Finite Element Problems, 1986.

M. G. Katevenis, Reduced instruction set computer architectures for VSLI, 1983.

S. Kirkpatrick, J. C. Gelatt, and M. P. Ecchi, Optimization by simulated annealing, Science, vol.45988, pp.671-680, 1983.

M. Kallstrom and S. S. Thakkar, Programming three parallel computers, IEEE Software, vol.5, issue.1, 1986.
DOI : 10.1109/52.1990

O. Lubeck, J. Moore, and R. Mendez, A benchmark comparison of three supercomputers: fujitsu vp-200, hitachi s-810è20, and cray x-moè2, IEEE Computer, vol.188, issue.122, 1985.

N. Metropolis, N. Rosenbluth, A. Rosenbluth, and E. Teller, Equation of State Calculations by Fast Computing Machines, The Journal of Chemical Physics, vol.21, issue.6, p.1087, 1953.
DOI : 10.1063/1.1699114

F. Pacull-rapport and D. I. Grenoble, Communication et reconaeguration dans les syst emes dynamiques communicants, 1989.

S. A. Green and D. J. Paddon, An extension of the processor farm using a tree architecture, 9 th Occam User Group, pp.53-69, 1988.

A. W. Roscoe and C. A. Hoare-evrier, The laws of OCCAM programming, Theoretical Computer Science, vol.60, issue.2, 1986.
DOI : 10.1016/0304-3975(88)90049-7

L. Charles and . Seitz, The cosmic cube, Communications of the ACM, vol.288, issue.11, pp.22-33, 1985.

D. Shepherd-Ësmi88ë and R. G. Smith, Compiler Writer's Guide. INMOS Limited, Janvier 1987 The Contract Net Protocol: High-level Communication and Control in a DistributedPr oblem Solver. 1988. ëSMT90ë I. Sahko, L. Mugwaneza, and T.Muntean. Ac onstant buaeering space method for deadlock-free routaging, 1990.

J. A. Stankovic and I. S. Sidhu, An adaptive bidding algorithm for processes, clusters and distributed groups, Proceedings 4 th Conference on Distributed Computing Systems, 1984.

L. Charles, J. Seitz, W. Seizovic, and . Su, The CP r ogrammer's Abbreviated Guide to Multicomputer Programming, 1988.

P. Waille, Introduction a l'architecture des machines Supernodes, 1990.

Y. Wang and J. T. Morris, Load sharing in distributed systems, IEEE Trans. on Computers, vol.22, 1985.

. Fonctions-de-la-cha^-ne-de-d-eveloppement, 6 1.3.1 Extraction du parall elisme : : : : : : : : : : : : : : : : : 7

. Acc-es-alam-emoire-virtuelle, 48 3.4.2 gestion des processus l egers : : : : : : : : : : : : : : : : 49 3.4.3 gestion des communications inter-processeurs : : : : : : 50 3.4.4 s equencement des t^ aches de l'application, p.52

. Phase-de-num-erotation, 61 4.2.3 "Descente" des d eclarations des identiaecateurs : : : : : 66 4.2.4 Quelques v eriaecations, 73 4.2.6 G en eration de code PVM et Extraction d'informations pour l'allocateur, p.80

L. De and P. , 97 5.4.1 Informations extraites pour l'allocation, pp.98-125

. Inaeuence-du-module-d, allocation : : : : : : : : : : : : : : : : : 101 6.1.1 Impact sur les instructions PVM li ees aux communications interprocessus, p.102

. Acc-es-a-un-tableau-par-un-index-non-connu, 36 3.2 D eaenition d'une application : : : : : : : : : : : : : : : : : : : : 37 3.3 D eaenition d'une t^ ache, :, p.37

. Squelette-de-programme-impos-e, 74 4.13 lois 5.2 et 5, 76 4.14 Transformation WHILE-PAR, p.78