Quadtree layout

Sourav Bhattacharya, Shekar Kirani, Wei Tek Tsai

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

Abstract

Quadtree data structure has been used in a number of applications. However, VLSI embedding of quadtree based parallel architecture using grid model has not been studied. This paper studies VLSI embedding of quadtree using grid model. H-tree layout for binary tree is extended for trivial quadtree layout, followed by developing two layout strategies for rectangular grids. Then, two generic layout styles (standard layout and X-layout) are proposed for higher order grids (e.g., hexagonal and octagonal grids). Base tile layout patterns are proposed for area compaction with recursive X-layout. In each case, layout dimensions and I/O bandwidth are computed. We demonstrate how the two generic layouts can be mixed to obtain higher I/O bandwidth and estimate the area sacrifice. An improved recursive layout mixing strategy is proposed.

Original languageEnglish (US)
Title of host publicationProc Second Great Lakes Symp VLSI
Place of PublicationLos Alamitos, CA, United States
PublisherPubl by IEEE
Pages74-81
Number of pages8
StatePublished - 1991
Externally publishedYes
EventProceedings of the Second Great Lakes Symposium on VLSI - Kalamazoo, MI, USA
Duration: Feb 28 1992Feb 29 1992

Other

OtherProceedings of the Second Great Lakes Symposium on VLSI
CityKalamazoo, MI, USA
Period2/28/922/29/92

Fingerprint

Bandwidth
Binary trees
Parallel architectures
Tile
Data structures
Compaction

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Bhattacharya, S., Kirani, S., & Tsai, W. T. (1991). Quadtree layout. In Proc Second Great Lakes Symp VLSI (pp. 74-81). Los Alamitos, CA, United States: Publ by IEEE.

Quadtree layout. / Bhattacharya, Sourav; Kirani, Shekar; Tsai, Wei Tek.

Proc Second Great Lakes Symp VLSI. Los Alamitos, CA, United States : Publ by IEEE, 1991. p. 74-81.

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

Bhattacharya, S, Kirani, S & Tsai, WT 1991, Quadtree layout. in Proc Second Great Lakes Symp VLSI. Publ by IEEE, Los Alamitos, CA, United States, pp. 74-81, Proceedings of the Second Great Lakes Symposium on VLSI, Kalamazoo, MI, USA, 2/28/92.
Bhattacharya S, Kirani S, Tsai WT. Quadtree layout. In Proc Second Great Lakes Symp VLSI. Los Alamitos, CA, United States: Publ by IEEE. 1991. p. 74-81
Bhattacharya, Sourav ; Kirani, Shekar ; Tsai, Wei Tek. / Quadtree layout. Proc Second Great Lakes Symp VLSI. Los Alamitos, CA, United States : Publ by IEEE, 1991. pp. 74-81
@inproceedings{3e0bd77722604ff888caee44ab30c5d3,
title = "Quadtree layout",
abstract = "Quadtree data structure has been used in a number of applications. However, VLSI embedding of quadtree based parallel architecture using grid model has not been studied. This paper studies VLSI embedding of quadtree using grid model. H-tree layout for binary tree is extended for trivial quadtree layout, followed by developing two layout strategies for rectangular grids. Then, two generic layout styles (standard layout and X-layout) are proposed for higher order grids (e.g., hexagonal and octagonal grids). Base tile layout patterns are proposed for area compaction with recursive X-layout. In each case, layout dimensions and I/O bandwidth are computed. We demonstrate how the two generic layouts can be mixed to obtain higher I/O bandwidth and estimate the area sacrifice. An improved recursive layout mixing strategy is proposed.",
author = "Sourav Bhattacharya and Shekar Kirani and Tsai, {Wei Tek}",
year = "1991",
language = "English (US)",
pages = "74--81",
booktitle = "Proc Second Great Lakes Symp VLSI",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Quadtree layout

AU - Bhattacharya, Sourav

AU - Kirani, Shekar

AU - Tsai, Wei Tek

PY - 1991

Y1 - 1991

N2 - Quadtree data structure has been used in a number of applications. However, VLSI embedding of quadtree based parallel architecture using grid model has not been studied. This paper studies VLSI embedding of quadtree using grid model. H-tree layout for binary tree is extended for trivial quadtree layout, followed by developing two layout strategies for rectangular grids. Then, two generic layout styles (standard layout and X-layout) are proposed for higher order grids (e.g., hexagonal and octagonal grids). Base tile layout patterns are proposed for area compaction with recursive X-layout. In each case, layout dimensions and I/O bandwidth are computed. We demonstrate how the two generic layouts can be mixed to obtain higher I/O bandwidth and estimate the area sacrifice. An improved recursive layout mixing strategy is proposed.

AB - Quadtree data structure has been used in a number of applications. However, VLSI embedding of quadtree based parallel architecture using grid model has not been studied. This paper studies VLSI embedding of quadtree using grid model. H-tree layout for binary tree is extended for trivial quadtree layout, followed by developing two layout strategies for rectangular grids. Then, two generic layout styles (standard layout and X-layout) are proposed for higher order grids (e.g., hexagonal and octagonal grids). Base tile layout patterns are proposed for area compaction with recursive X-layout. In each case, layout dimensions and I/O bandwidth are computed. We demonstrate how the two generic layouts can be mixed to obtain higher I/O bandwidth and estimate the area sacrifice. An improved recursive layout mixing strategy is proposed.

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

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

M3 - Conference contribution

AN - SCOPUS:0026379353

SP - 74

EP - 81

BT - Proc Second Great Lakes Symp VLSI

PB - Publ by IEEE

CY - Los Alamitos, CA, United States

ER -