Abstract
A framework for synthesis of synchronous concurrent systems with local memory is developed. Given an output specification of the system a cell action structure can be derived. This structure can be mapped into a communication structure, a model of the events in the target hardware with constraints on the communication possible between events, giving a schedule for the cell actions. Communication structures are interesting in their own right, and transformations defined on such can be used for showing equivalence between different computational networks. As an example, the equivalence between two specific communication structures is proved and it is shown that a FFT algorithm can be implemented on them.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Birkhoff, J. D. Lipson, “Heterogenous Algebras”, J. Combin. Theory, vol. 8 (Jan. 1970), pp. 115–133
P. K. Cappello, K. Steiglitz, Unifying VLSI Array Design with Linear Transformations of Space-Time, Research Report TRCS83-03, Dept. Comput. Sci., UCSB, 1983
M. C. Chen, A Synthesis Method for Systolic Designs, Research Report YALEU/DCS/RR-334, Dept. Comput. Sci., Yale University, Jan. 1985
M. C. Chen, Synthesizing Systolic Designs, Research Report YALEU/DCS/RR-374, Dept. Comput. Sci., Yale University, March 1985
K. Culik II, I. Fris, Topological Transformations As a Tool in The Design of Systolic Networks, Report CS-84-11, Dept. Comput. Sci., University of Waterloo, April 1984
G. Grätzer, Universal Algebra, Springer-Verlag, New York, 1979
L. Johnsson, D. Cohen, A Mathematical Approach to Computational Networks for the Discrete Fourier Transform, Preliminary Technical Report, Dept. Comput. Sci., Yale University, 1985
L. Johnsson, U. Weiser, D. Cohen, A. L. Davis, “Towards a Formal Treatment of VLSI Arrays”, Proc. Second Caltech Conf. on VLSI, Jan. 1981, pp. 378–398
D. J. Kuck, Y. Muraoka, S. C. Chen, “On the Number of Operations Simoultaneously Executable in Fortran-like Programs and Their Resulting Speedup”, IEEE Trans. Comput., vol C-21, pp. 1293–1310, Dec. 1972
H. T. Kung, C. E. Leiserson, “Algorithms for VLSI Processor Arrays”, Ch. 8.3 in C. Mead, L. Conway, Introduction to VLSI systems, Addison-Wesley, Reading, MA, 1980
H. T. Kung, W. T. Lin, An Algebra for VLSI Algorithm Design, Technical Report, Dept. Comput. Sci., Carnegie-Mellon Univ., PA, 1983
L. Lamport, “The Parallel Execution of DO Loops”, CACM vol. 17 (Feb. 1974), pp. 83–93
H. Lev-Ari, Modular Computing Networks: a New Methodology for Analysis and Design of Parallel Algorithms/Architectures, ISI Report 29, Integrated Systems Inc., Dec. 1983
H. Lev-Ari, Canonical Realizations of Completely Regular Modular Computing Networks, ISI Report 41, Integrated Systems Inc., May 1984
B. Lisper, Description and Synthesis of Systolic Arrays, Technical Report TRITA-NA-8318, NADA, R.I.T., Stockholm, 1983
B. Lisper, Hardware Synthesis from Specification with Polynomials, Technical Report TRITA-NA-8506, NADA, R.I.T., Stockholm, 1985
B. Lisper, Ph. D. Thesis, to appear
W. L. Miranker, A. Winkler, “Spacetime Representations of Computational Structures”, Computing, vol. 32 (1984), pp. 93–114
D. T. Moldovan, “On the Analysis and Synthesis of VLSI algorithms”, IEEE Trans. Comput., vol. C-31 (Oct. 1982), pp. 1121–1126
Y. Muraoka, Parallelism Exposure and Exploitation in Programs, Ph. D. Thesis, Dept. Comput. Sci., University of Illinois at Urbana-Champaign, 1971
M. Nielsen, G. Plotkin, G. Winskel, “Petri Nets, Event Structures and Domains, Part I”, TCS vol. 13 (1981), pp. 85–108
I. V. Ramakrishnan, D. S. Fussell, A. Silberschatz, Towards a Characterization of Programs for a Model of VLSI Array-Processors, Technical Report TR-202, Dept. Comput. Sci., University of Texas at Austin, July 1982
H. S. Stone, “Parallel Processing with the Perfect Shuffle”, IEEE Trans. Comput., vol C-20 (Feb. 1971), pp. 153–161
U. Weiser, A. L. Davis, “A Wavefront Tool for VLSI Design”, in H. T. Kung, B. Sproull and G. Steele eds. VLSI Systems and Computations, Springer-Verlag, Berlin, 1981, pp. 226–234
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lisper, B. (1986). Synthesis and equivalence of concurrent systems. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_72
Download citation
DOI: https://doi.org/10.1007/3-540-16761-7_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16761-7
Online ISBN: 978-3-540-39859-2
eBook Packages: Springer Book Archive