Mapping Homogeneous Graphs on Linear Arrays

Authors:
I. V. Ramakrishnan;D. S. Fussell;A. Silberschatz
Affiliations:
Department of Computer Science, State University of New York;-;-
Venue:
IEEE Transactions on Computers
Year:
1986

Citing 16
Cited 0

Configuration of VLSI Arrays in the Presence of Defects

Journal of the ACM (JACM)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Systolic (VLSI) arrays for relational database operations

SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
On Mapping Cube Graphs onto VLSI Arrays

Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Synchronizing large VLSI processor arrays

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Automatic synthesis of systolic arrays from uniform recurrent equations

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
A theory of mapping program graphs onto linear arrays

A theory of mapping program graphs onto linear arrays
Algorithm transformations for parallel processing and vlsi architecture design

Algorithm transformations for parallel processing and vlsi architecture design
The rebound sorter: an efficient sort engine for large files

VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
The Design of Optimal Systolic Arrays

IEEE Transactions on Computers
Systolic Processing and an Implementation for Signal and Image Processing

IEEE Transactions on Computers
Modular Matrix Multiplication on a Linear Array

IEEE Transactions on Computers
The Design of Special-Purpose VLSI Chips

Computer
Why Systolic Architectures?

Computer
Wafer-scale integration of systolic arrays

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Designing Systolic Algorithms Using Sequential Machines

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper presents a formal model of linear array processors suitable for VLSI implementation as well as graph representations of programs suitable for execution on such a model. A distinction is made between correct mapping and correct execution of such graphs on this model and the structure of correctly mappable graphs are examined. The formalism developed is used to synthesize algorithms for this model.