Advertisement

Trace theory and systolic computations

  • Martin Rem
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 258)

Keywords

Regular Expression Communication Behavior Cyclic Code Systolic Array Sequence Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. [1]
    Brookes, S.D., Roscoe, A.W. An improved failures model for communicating processes. In: Seminar on Concurrency (S.D. Brookes, A.W. Roscoe, G. Winskel, eds.). Springer, Berlin, 1985 (Lecture Notes in Computer Science: 197), 281–305.Google Scholar
  2. [2]
    Hoare, C.A.R. Communicating sequential processes. Comm. ACM 21 (1978), 666–677.Google Scholar
  3. [3]
    Hoare, C.A.R. Communicating Sequential Processes. Prentice Hall, New York, 1985.Google Scholar
  4. [4]
    Kaldewaij, A. A Formalism for Concurrent Processes. Doctoral Dissertation, Eindhoven University of Technology, Eindhoven, 1986.Google Scholar
  5. [5]
    Kung, H.T. Let's design algorithms for VLSI systems. In: Proc. 1st Caltech Conference (C.L. Seitz, ed.). California Institute of Technology, Pasadena, 1979, 65–90.Google Scholar
  6. [6]
    Martin, A.J. Compiling communicating processes into delay-insensitive VLSI circuits. Distributed Computing 1 (1986), 226–234.Google Scholar
  7. [7]
    Rem, M. Concurrent computations and VLSI circuits. In: Control Flow and Data Flow: Concepts in Distributed Programs (M. Broy, ed.). Springer, Berlin, 1985, 399–437.Google Scholar
  8. [8]
    Snepscheut, J.L.A. van de. Trace Theory and VLSI Design. Springer, Berlin, 1985 (Lecture Notes in Computer Science: 200).Google Scholar
  9. [9]
    Snepscheut, J.L.A. van de, Swenker, J. On the design of some systolic algorithms. Note JAN 131, Groningen University, Groningen, 1986.Google Scholar
  10. [10]
    Udding, J.T. A formal model for defining and classifying delay-insensitive circuits and systems. Distributed Computing 1 (1986), 197–204.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Martin Rem
    • 1
  1. 1.Dept. of Mathematics and Computing ScienceEindhoven University of TechnologyEindhovenNetherlands

Personalised recommendations