On high-speed computing with a programmable linear array

Pei Zong Lee, Zvi Kedem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A simple programmable linear systolic array capable of solving a large number of problems drawn from a variety of applications is designed. The methodology is applicable to problems solvable by sequential algorithms that can be specified as nested FOT-loops of arbitrary depth. The algorithms of this form that can be computed on the array include 25 algorithms dealing with signal and image processing, algebraic computations, matrix arithmetic, pattern matching, database operations, sorting, and transistive closure. Assuming bounded I/O, for 18 of those algorithms the time and storage complexities are optimal, and therefore no improvement can be expected by utilizing dedicated special-purpose linear systolic arrays designed for individual algorithms.

Original languageEnglish (US)
Title of host publicationProc Supercomputing 88
PublisherPubl by IEEE
Pages425-432
Number of pages8
ISBN (Print)081860882X
StatePublished - 1988

Fingerprint

Systolic arrays
Pattern matching
Sorting
Signal processing
Image processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lee, P. Z., & Kedem, Z. (1988). On high-speed computing with a programmable linear array. In Proc Supercomputing 88 (pp. 425-432). Publ by IEEE.

On high-speed computing with a programmable linear array. / Lee, Pei Zong; Kedem, Zvi.

Proc Supercomputing 88. Publ by IEEE, 1988. p. 425-432.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, PZ & Kedem, Z 1988, On high-speed computing with a programmable linear array. in Proc Supercomputing 88. Publ by IEEE, pp. 425-432.
Lee PZ, Kedem Z. On high-speed computing with a programmable linear array. In Proc Supercomputing 88. Publ by IEEE. 1988. p. 425-432
Lee, Pei Zong ; Kedem, Zvi. / On high-speed computing with a programmable linear array. Proc Supercomputing 88. Publ by IEEE, 1988. pp. 425-432
@inproceedings{50de76047f2d4533bb7001017f6f4159,
title = "On high-speed computing with a programmable linear array",
abstract = "A simple programmable linear systolic array capable of solving a large number of problems drawn from a variety of applications is designed. The methodology is applicable to problems solvable by sequential algorithms that can be specified as nested FOT-loops of arbitrary depth. The algorithms of this form that can be computed on the array include 25 algorithms dealing with signal and image processing, algebraic computations, matrix arithmetic, pattern matching, database operations, sorting, and transistive closure. Assuming bounded I/O, for 18 of those algorithms the time and storage complexities are optimal, and therefore no improvement can be expected by utilizing dedicated special-purpose linear systolic arrays designed for individual algorithms.",
author = "Lee, {Pei Zong} and Zvi Kedem",
year = "1988",
language = "English (US)",
isbn = "081860882X",
pages = "425--432",
booktitle = "Proc Supercomputing 88",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - On high-speed computing with a programmable linear array

AU - Lee, Pei Zong

AU - Kedem, Zvi

PY - 1988

Y1 - 1988

N2 - A simple programmable linear systolic array capable of solving a large number of problems drawn from a variety of applications is designed. The methodology is applicable to problems solvable by sequential algorithms that can be specified as nested FOT-loops of arbitrary depth. The algorithms of this form that can be computed on the array include 25 algorithms dealing with signal and image processing, algebraic computations, matrix arithmetic, pattern matching, database operations, sorting, and transistive closure. Assuming bounded I/O, for 18 of those algorithms the time and storage complexities are optimal, and therefore no improvement can be expected by utilizing dedicated special-purpose linear systolic arrays designed for individual algorithms.

AB - A simple programmable linear systolic array capable of solving a large number of problems drawn from a variety of applications is designed. The methodology is applicable to problems solvable by sequential algorithms that can be specified as nested FOT-loops of arbitrary depth. The algorithms of this form that can be computed on the array include 25 algorithms dealing with signal and image processing, algebraic computations, matrix arithmetic, pattern matching, database operations, sorting, and transistive closure. Assuming bounded I/O, for 18 of those algorithms the time and storage complexities are optimal, and therefore no improvement can be expected by utilizing dedicated special-purpose linear systolic arrays designed for individual algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0024176712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024176712&partnerID=8YFLogxK

M3 - Conference contribution

SN - 081860882X

SP - 425

EP - 432

BT - Proc Supercomputing 88

PB - Publ by IEEE

ER -