Skip to main navigation Skip to search Skip to main content

VLSI design and implementation of systolic tree queues

Research output: Contribution to journalArticlepeer-review

Abstract

A number of innovative designs have been proposed for hardware implementation of data structures. However, these designs have only been presented at an abstract behavioural level. In this paper, we describe the VLSI design and implementation of a 15-node 8-bit queue based on a systolic tree architecture. A layout methodology and a VLSI CAD environment that facilitate fast and efficient layout of large binary trees are described. The objective of this paper is to illustrate the implementation of tree architectures in VLSI. We demonstrate this by implementing a systolic tree queue.

Original languageEnglish
Pages (from-to)139-146
Number of pages8
JournalMicroprocessors and Microsystems
Volume19
Issue number3
DOIs
StatePublished - 1995

Bibliographical note

Funding Information:
The authors acknowledge King Fahd University of Petroleum and Minerals for support of this work. We would like to thank Dr H Youssef and Dr M Abd-EI-Barr for their comments and discussion that helped to improve the quality of this manuscript.

Keywords

  • VLSI design
  • automated layout
  • systolic tree architecture

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'VLSI design and implementation of systolic tree queues'. Together they form a unique fingerprint.

Cite this