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 ,
Statistical cooling: a general approachtocombinatorial optimization problems, Philips Journal of Research, pp.400-444, 1985. ,
Fine Grain Concurrent Computation, Caltech Computer Science, issue.1, 1987. ,
Benchmarking the ipscè2 hypercube multiprocessor. Concurrency: Practice and Exprerience, pp.4-18, 1989. ,
Models for dynamic load balancing in heteregenous multiple processor systems, IEEE Trans. on Computers, p.28, 1979. ,
Helios C Manual. Perihelion Software Limited, 24è25 Brewmaster Buildings,Charlton Trading Estate Shepton Mallet, 1988. ,
Allocation dynamique de processus sur une architecturep arall ele, 1989. ,
Adaptative load sharing in homogeneous distributed systems, IEEE Trans. on Software Engineering, 1984. ,
Assembleur PDS : Manuel de r ef erence. LGI-IMAG, 1987. ,
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. ,
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. ,
Tecnical note 19: Designs and Applications for the IMS C004, INMOS Limited, 1987. ,
Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978. ,
DOI : 10.1145/359576.359585
Graph Partitioning and Constructing Optimal Decision Trees are Polynomial Complete Problems, 1973. ,
AP r eprocessor for Irregular Finite Element Problems, 1986. ,
Reduced instruction set computer architectures for VSLI, 1983. ,
Optimization by simulated annealing, Science, vol.45988, pp.671-680, 1983. ,
Programming three parallel computers, IEEE Software, vol.5, issue.1, 1986. ,
DOI : 10.1109/52.1990
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. ,
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
Communication et reconaeguration dans les syst emes dynamiques communicants, 1989. ,
An extension of the processor farm using a tree architecture, 9 th Occam User Group, pp.53-69, 1988. ,
The laws of OCCAM programming, Theoretical Computer Science, vol.60, issue.2, 1986. ,
DOI : 10.1016/0304-3975(88)90049-7
The cosmic cube, Communications of the ACM, vol.288, issue.11, pp.22-33, 1985. ,
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. ,
An adaptive bidding algorithm for processes, clusters and distributed groups, Proceedings 4 th Conference on Distributed Computing Systems, 1984. ,
The CP r ogrammer's Abbreviated Guide to Multicomputer Programming, 1988. ,
Introduction a l'architecture des machines Supernodes, 1990. ,
Load sharing in distributed systems, IEEE Trans. on Computers, vol.22, 1985. ,
6 1.3.1 Extraction du parall elisme : : : : : : : : : : : : : : : : : 7 ,
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 ,
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 ,
97 5.4.1 Informations extraites pour l'allocation, pp.98-125 ,
allocation : : : : : : : : : : : : : : : : : 101 6.1.1 Impact sur les instructions PVM li ees aux communications interprocessus, p.102 ,
36 3.2 D eaenition d'une application : : : : : : : : : : : : : : : : : : : : 37 3.3 D eaenition d'une t^ ache, :, p.37 ,
74 4.13 lois 5.2 et 5, 76 4.14 Transformation WHILE-PAR, p.78 ,