Quadtree layouts and I/O bandwidth

S. Bhattacharya, S. Kirani, W. T. Tsai

Research output: Contribution to journalArticle

Abstract

Quadtree data structure, popular in 2-D applications, has not been studied in the context of VLSI embedding. This paper proposes two generic layout strategies for quadtree layout. Layout attributes are derived with primary focus on area-I/O trade-off. We demonstrate a simple layout mixing strategy to obtain improved boundary I/O characteristics. This is followed by development of a recursive layout mixing strategy which yields an order of improvement.

Original languageEnglish (US)
Pages (from-to)231-240
Number of pages10
JournalParallel Processing Letters
Volume5
Issue number2
StatePublished - Jun 1995
Externally publishedYes

Fingerprint

Quadtree
Layout
Bandwidth
Data structures
Data Structures
Trade-offs
Attribute
Demonstrate
Strategy

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Bhattacharya, S., Kirani, S., & Tsai, W. T. (1995). Quadtree layouts and I/O bandwidth. Parallel Processing Letters, 5(2), 231-240.

Quadtree layouts and I/O bandwidth. / Bhattacharya, S.; Kirani, S.; Tsai, W. T.

In: Parallel Processing Letters, Vol. 5, No. 2, 06.1995, p. 231-240.

Research output: Contribution to journalArticle

Bhattacharya, S, Kirani, S & Tsai, WT 1995, 'Quadtree layouts and I/O bandwidth', Parallel Processing Letters, vol. 5, no. 2, pp. 231-240.
Bhattacharya S, Kirani S, Tsai WT. Quadtree layouts and I/O bandwidth. Parallel Processing Letters. 1995 Jun;5(2):231-240.
Bhattacharya, S. ; Kirani, S. ; Tsai, W. T. / Quadtree layouts and I/O bandwidth. In: Parallel Processing Letters. 1995 ; Vol. 5, No. 2. pp. 231-240.
@article{8a4c503890fc48d188e24d6943fde07b,
title = "Quadtree layouts and I/O bandwidth",
abstract = "Quadtree data structure, popular in 2-D applications, has not been studied in the context of VLSI embedding. This paper proposes two generic layout strategies for quadtree layout. Layout attributes are derived with primary focus on area-I/O trade-off. We demonstrate a simple layout mixing strategy to obtain improved boundary I/O characteristics. This is followed by development of a recursive layout mixing strategy which yields an order of improvement.",
author = "S. Bhattacharya and S. Kirani and Tsai, {W. T.}",
year = "1995",
month = "6",
language = "English (US)",
volume = "5",
pages = "231--240",
journal = "Parallel Processing Letters",
issn = "0129-6264",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

TY - JOUR

T1 - Quadtree layouts and I/O bandwidth

AU - Bhattacharya, S.

AU - Kirani, S.

AU - Tsai, W. T.

PY - 1995/6

Y1 - 1995/6

N2 - Quadtree data structure, popular in 2-D applications, has not been studied in the context of VLSI embedding. This paper proposes two generic layout strategies for quadtree layout. Layout attributes are derived with primary focus on area-I/O trade-off. We demonstrate a simple layout mixing strategy to obtain improved boundary I/O characteristics. This is followed by development of a recursive layout mixing strategy which yields an order of improvement.

AB - Quadtree data structure, popular in 2-D applications, has not been studied in the context of VLSI embedding. This paper proposes two generic layout strategies for quadtree layout. Layout attributes are derived with primary focus on area-I/O trade-off. We demonstrate a simple layout mixing strategy to obtain improved boundary I/O characteristics. This is followed by development of a recursive layout mixing strategy which yields an order of improvement.

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

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

M3 - Article

VL - 5

SP - 231

EP - 240

JO - Parallel Processing Letters

JF - Parallel Processing Letters

SN - 0129-6264

IS - 2

ER -