[1]

Fisher, A. L.*et al.*, Design of the PSC: A Programmable Systolic Chip,*Proc. Third Caltech Conf. on VLSI*, March 1983, pp. 287–302.

[2]

Kung, S. Y., On Supercomputing with Systolic/Wavefront Array Processors,

*Proc. IEEE*, Vol. 72, July 1984, pp. 867–884.

CrossRef[3]

Li, G., and Wah, B. W., The Design of Optimal Systolic Arrays,

*IEEE Trans. Comput.*, Vol. C-34, January 1985, pp. 66–77.

CrossRef[4]

Bokhari, S. H., On the Mapping Problem,

*IEEE Trans. Comput.*, Vol. C-30, March 1981, pp. 207–214.

CrossRefMathSciNet[5]

Koren, I., and Silberman, G. M., A Direct Mapping of Algorithms onto VLSI Processing Arrays Based on the Data Flow Approach,*Proc. 12th International Conf. on Parallel Processing*, August 1983, pp. 335–337.

[6]

Special issue on Data Flow Systems,*IEEE Comput.*, Vol. 15, No. 2, February 1982.

[7]

Koren, I., and Peled, I., The Concept and Implementation of Data-Driven Processor Arrays,*IEEE Comput.*, Vol. 20, No. 7, July 1987, pp. 102–103.

[8]

Mendelson, B., and Silberman, G. M., Mapping Data Flow Programs on a VLSI Array of Processors,*Proc. 14th International Symp. on Computer Architecture*, Pittsburgh, PA, June 1987, pp. 72–80.

[9]

Ackerman, W. B., and Dennis, J. B., VAL—A Value-Oriented Algorithmic Language; Preliminary Reference Manual, Technical Report MIT/LCS/TR-218, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 1974.

[10]

Mizraian, A., Channel Routing in VLSI,*Proc. 16th Annual ACM Symp. on Theory of Computing*, 1984, pp. 101–107.

[11]

Preparata, F. P., and Lipski, W., Optimal Three-Layer Channel Routing,

*IEEE Trans. Comput.*, Vol. C-33, 1984, pp. 427–437.

CrossRef[12]

Atallah, M. J., and Hambrusch, S. E., Optimal Rotation Problems in Channel Routing,

*IEEE Trans. Comput.*, Vol. C-35, September 1986, pp. 843–847.

CrossRef[13]

Savage, J. E., Heuristics in the SLAP Layout System,*Proc. International Conf. on Computer Design (ICCD)*, Port Chester, New York, October 1983, pp. 637–640.

[14]

Knuth, D. E.,*The Art of Computer Programming*, Vol. 3, Addison-Wesley, Reading, MA, 1973, Section 5.3.4.

[15]

Erdös, P., Linial, N., and Moran, S., Extremal Problems on Permutations under Cyclic Equivalence,

*Discrete Math.*, Vol. 64, No. 1, 1987, pp. 1–13.

CrossRefMathSciNetMATH