Designing systolic, distributed buffers with bounded response time
- 25 Downloads
Several buffer designs are derived by applying a design methodology that is based on so-called abstract states. Abstract states are euivalence classes of communication histories. These abstract states are very useful in the verification of program transformations, since they facilitate the definition of a function mapping the states of the transformed automaton onto the states of the original one. Three kinds of bufferes are discussed: the stack, the first-in first-out queue, and the priority queue. The designs are systolic and offer bounded response time, which means that all permissible communications are accepted within a time bounded by a constant. The design of the stack offers maximum storage utilization as well. We show that the properties of bounded response time and maximum storage utilization cannot be combined in distributed systolic queues.
Key wordsDistributed systems Systolic designs Bounded response time Maximum storage utilization Buffers Stack First-in first-out queue Priority queue
Unable to display preview. Download preview PDF.
- 1.Guibas LJ, Liang FM (1982) Systolic stacks, queues and counters. Proc Conf Advanced Research in VLSI, MIT Jan 1982, pp 155–164Google Scholar
- 2.Hoare CAR (1978) Communicating sequential processes. Commun ACM 21:666–677Google Scholar
- 3.Hoare CAR (1985) Communicating sequential processes. Ser Comput Sci Prentice-HalGoogle Scholar
- 4.Janse W (1988) (private communication)Google Scholar
- 5.Kung HT (1982) Why systolic architectures? IEEE Trans Comput 15:37–46Google Scholar
- 6.Milner R (1980) A calculus of communicating systems. Lect Notes, Comput Sci 92. Springer, Berlin Heidelberg New York, pp 119–123Google Scholar
- 7.Rem M (1987) Trace theory and systolic computations. Proc Conf Parallel Architectures and Languages Europe (Parle), Eindhoven. Lect Notes Comput Sci 258. Springer, Berlin Heidelberg New York, pp 14–33Google Scholar