On schemata and L systems for parallel algorithms

Georg Gati

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1979)

  • Volume: 13, Issue: 2, page 155-184
  • ISSN: 0988-3754

How to cite

top

Gati, Georg. "On schemata and $L$ systems for parallel algorithms." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.2 (1979): 155-184. <http://eudml.org/doc/92095>.

@article{Gati1979,
author = {Gati, Georg},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {parallel program schemata; unbounded parallelism; decidability result; matrix multiplication; knapsack problem; control and data structure of algorithms; OL system; scheduling algorithm},
language = {eng},
number = {2},
pages = {155-184},
publisher = {EDP-Sciences},
title = {On schemata and $L$ systems for parallel algorithms},
url = {http://eudml.org/doc/92095},
volume = {13},
year = {1979},
}

TY - JOUR
AU - Gati, Georg
TI - On schemata and $L$ systems for parallel algorithms
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 2
SP - 155
EP - 184
LA - eng
KW - parallel program schemata; unbounded parallelism; decidability result; matrix multiplication; knapsack problem; control and data structure of algorithms; OL system; scheduling algorithm
UR - http://eudml.org/doc/92095
ER -

References

top
  1. 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. Zbl0326.68005MR413592
  2. 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. Zbl0209.30901MR329301
  3. 3. B. BUCHBERGER, Computer-Trees and Their Programming, Troisième Colloque de Lille sur les Arbres en Algèbre et en Programmation, 1978. Zbl0383.68027MR483609
  4. 4. B. BUCHBERGER and J. FEGERL, Ein universeller Modul zur Hardware-Implementierung von Rekursionen, Laboratory Note, Universität Linz, 1977. 
  5. 5. E. G. COFFMAN (éd.), Computer and Job Shop Scheduling Theory, Wiley-Interscience, New York, 1976. Zbl0359.90031MR629691
  6. 6. R. W. CONWAY, W. L. MAXWELL and L. W. MILLER, Theory of Scheduling, Addison-Wesley, Reading, Mass., 1967. Zbl1058.90500MR389180
  7. 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. Zbl0358.68069MR478710
  8. 8. G. T. HERMAN and G. ROZENBERG, Developmental Systems and Languages, North-Holland-American Elsevier, Amsterdam, 1975. Zbl0306.68045MR495247
  9. 9. R. M. KARP and R. E. MILLER, Parallel Program Schemata, J. Comput. System Sc., Vol. 3, 1969, pp. 147-195. Zbl0198.32603MR246720
  10. 10. R. M. KELLER, Closures of Parallel Program Schemata, Unpublished thesis, University of California, 1970. 
  11. 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. 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). Zbl0273.68011
  13. 13. H. KOPP, Bemerkungen zum Deadlockproblem in parallelen Prozessen, Unpublished report, Tagung über Automatentheorie und formale Sprachen, Mathematisches Forschungsinstitut Oberwolfach, 1975. 
  14. 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. Zbl0323.68012
  15. 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. 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. 17. J. T. Tou (éd.), Advances in Information Systems Science, Vol. 6, 1976, Plenum Press, New York. Zbl0344.00013MR448973
  18. 18. J. D. ULLMAN, NP-Complete Scheduling Problems, J. Comput. System Sc.,Vol. 10, 1975, pp. 384-393. Zbl0313.68054MR391585

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.