On schemata and L systems for parallel algorithms
Gati, Georg
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979), p. 155-184 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1979-01-01
@article{ITA_1979__13_2_155_0,
     author = {Gati, Georg},
     title = {On schemata and $L$ systems for parallel algorithms},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {13},
     year = {1979},
     pages = {155-184},
     mrnumber = {543938},
     zbl = {0422.68001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1979__13_2_155_0}
}

Gati, Georg. On schemata and $L$ systems for parallel algorithms. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 13 (1979) pp. 155-184. http://gdmltest.u-ga.fr/item/ITA_1979__13_2_155_0/

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Exercise 6.5, p. 247, Addison-Wesley, Reading, Mass., 1974. | MR 413592 | Zbl 0326.68005

2. R. Albrecht, Zur Struktur von Informationssysternen, in Automatentheorie und formale Sprachen, Oberwolfach, 1969, J. DÖRR and G. HOTZ Eds., Berichte aus dem mathematischen Forschungsinstitut Oberwolfach, Vol. 3, 1970, pp. 493-505, Bibliographisches Institut, Mannheim. | MR 329301 | Zbl 0209.30901

3. B. Buchberger, Computer-Trees and Their Programming, Troisième Colloque de Lille sur les Arbres en Algèbre et en Programmation, 1978. | MR 483609 | Zbl 0383.68027

4. B. Buchberger and J. Fegerl, Ein universeller Modul zur Hardware-Implementierung von Rekursionen, Laboratory Note, Universität Linz, 1977.

5. E. G. COFFMAN (éd.), Computer and Job Shop Scheduling Theory, Wiley-Interscience, New York, 1976. | MR 629691 | Zbl 0359.90031

6. R. W. Conway, W. L. Maxwell and L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass., 1967. | MR 389180 | Zbl 1058.90500

7. G. Gati, Aspects of Unbounded Parallelism, in Theoretical Computer Science, 3rd G.I. Conference, Darmstadt, 1977, H. TZSCHACH, H. WALDSCHMIDT and H. K.-G. WALTER, Eds., Lecture Notes in Computer Science, Vol. 48, pp. 292-305, Springer, Berlin, 1977. | MR 478710 | Zbl 0358.68069

8. G. T. Herman and G. Rozenberg, Developmental Systems and Languages, North-Holland-American Elsevier, Amsterdam, 1975. | MR 495247 | Zbl 0306.68045

9. R. M. Karp and R. E. Miller, Parallel Program Schemata, J. Comput. System Sc., Vol. 3, 1969, pp. 147-195. | MR 246720 | Zbl 0198.32603

10. R. M. Keller, Closures of Parallel Program Schemata, Unpublished thesis, University of California, 1970.

11. R. M. Keller, On Maximal Parallel Schemata, in Conference Record of 11th Annual Symposium on Switching and Automata Theory, LE.E.E., New York, 1970, pp. 32-50.

12. R. M. Keller, Parallel Program Schemata and Maximal Parallelism, J. Assoc. Comput. Mach., Vol. 20, 1973, pp. 514-537 (part I) and Vol. 20, 1973, pp. 696-710 (part II). | Zbl 0273.68011

13. H. Kopp, Bemerkungen zum Deadlockproblem in parallelen Prozessen, Unpublished report, Tagung über Automatentheorie und formale Sprachen, Mathematisches Forschungsinstitut Oberwolfach, 1975.

14. F. Schwenkel, Zur Theorie unendlicher Parallelprozessoren, in G.I.-4. Jahrestagung, Berlin, 1974, D. SIEFKES, éd., (im Auftrag der G.I.), Lecture Notes in Computer Science, Vol. 26, pp. 355-364, Springer, Berlin, 1975. | Zbl 0323.68012

15. H. Sullivan and T. R. Bashkow, A Large Scale, Homogeneous, Fully Distributed Parallel Machine, I. Comp. Arch. News, Vol. 5, 1977, pp. 105-117.

16. H. Sullivan, T. R. Bashkow and D. Klappholz, A Large Scale, Homogenous, Fully Distributed Parallel Machine, II Comp. Arch. News, Vol. 5, 1977. pp. 118-124.

17. J. T. Tou (éd.), Advances in Information Systems Science, Vol. 6, 1976, Plenum Press, New York. | MR 448973 | Zbl 0344.00013

18. J. D. Ullman, NP-Complete Scheduling Problems, J. Comput. System Sc.,Vol. 10, 1975, pp. 384-393. | MR 391585 | Zbl 0313.68054