Parallélisation d'algorithmes avec un nombre fixe de processeurs
C. Delporte-Gallet; H. Fauconnier; M. Nivat
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1990)
- Volume: 24, Issue: 4, page 353-386
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- [1] A. BORODIN, On Relating Time and Space to Size and Depth, S.I.A.M. J. Comput, vol. 6, n° 4, décembre 1977. Zbl0366.68039MR461984
- [2] S. A. COOK, A Taxonimy of Problems with Fast Parallel Algorithms, Information and Control, vol. 64, p. 2-22. Zbl0575.68045MR837088
- [3] S. A. COOK, C. DWORK et R. REISCHUK, Upper and Lower Time Bounds for Parallel Random Acces Machines without Simultaneous Writes, S.I.A.M. J. Comput, vol. 15, n°1 février 1986. Zbl0591.68049MR822194
- [4] W. D. HILLIS, The Connection Machine, M.I.T., Artificial Intelligence Laboratory, Memo n° 646, septembre 1981.
- [5] « IMS T424 transputer », INMOS (1984).
- [6] J. SCHWARZ, Ultracomputers, TOPLAS 2, vol. 4, 1980, p. 454-521. Zbl0468.68027
- [7] Introduction to Data Level Parallelism, Thinking Machine Technical Report 86.14, avril 1986.
- [8] U. VISHKIN, Synchronous Parallel. Computation, Asurvey, Courant Institut, New York University, avril 1983.
- [9] U. VISHKIN, A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer, T.C.S. 32, 1984, p. 157-172. Zbl0545.68044MR761165
- [10] L. L. WELTY et P. C. PATTON, Hypercube Architectures, AFIP 85, vol. 54, 1985.