Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci  Home/Search
Context
Related
| dei.unipd.it/~geppo/PA...arvlsi99.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dei.unipd.it/~geppo/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An area-universal VLSI circuit can be programmed to emulate every circuit of a given area, but at the cost of lower area-time performance. In particular, if a circuit with area-time bounds (A; T ) is emulated with a universal circuit with bounds (A u ; T u ); we say that the universal circuit has blowup A u =A and slowdown T u =T . A central question in VLSI theory is to investigate the inherent costs and tradeoffs of universal circuit designs. Prior to this paper, universal designs with O(1)... (Update)
Active bibliography (related documents): More All
0.9: Broadcast and Associative Operations on Fat-Trees - Bilardi, Codenotti, Corso.. (Correct)
0.4: On the Reliability of Fat-Trees - Nikoletseas, Pantziou, Psycharis.. (Correct)
0.3: An overview of the Italian National Project on "Algorithms.. - Ausiello, d'Amore (Correct)
Similar documents based on text: More All
0.4: Scattering and Gathering Messages in Networks of Processors - Bhatt, Pucci, Ranade.. (1993) (Correct)
0.4: BSP vs LogP - Bilardi, Herley, Pietracaprina.. (1996) (Correct)
0.4: On Bufferless Routing of Variable Length Messages in.. - Bhatt, Bilardi.. (1996) (Correct)
BibTeX entry: (Update)
@misc{ bhatt-areauniversal,
author = "Sandeep N. Bhatt and Gianfranco Bilardi and Geppino Pucci",
title = "Area-Universal Circuits with Constant Slowdown",
url = "citeseer.ist.psu.edu/bhatt99areauniversal.html" }
Citations (may not include all citations):264 Combinatorial algorithms for integrated circuit layout (context) - Lengauer - 1990
164 The network architecture of the Connection Machine CM - Leiserson, Abuhamdeh et al. - 1992
156 Fat-trees: universal networks for hardware-efficient superco.. (context) - Leiserson - 1985
90 Randomized routing and sorting on fixed-connection networks - Leighton, Maggs et al. - 1994
86 A framework for solving VLSI graph layout problems - Bhatt, Leighton - 1984
46 Randomized routing on fat-trees - Greenberg, Leiserson - 1989
24 Optimal rearrangeable multistage connecting networks (context) - Benes - 1964
17 Efficient simulations among several models of parallel compu.. (context) - auf - 1986
16 Time-optimal simulations of networks by universal parallel c.. - auf, Wanka - 1989
16 Deterministic on-line routing on area-universal networks (context) - Bay, Bilardi - 1995
12 The fat-pyramid and universal parallel computation independe.. - Greenberg - 1994
8 An area-universal VLSI circuit (context) - Bay, Bilardi - 1993
6 An area lower bound for a class of fat-trees (context) - Bilardi, Bay - 1994
5 Universal emulations with sublogarithmic slowdown (context) - Kaklamanis, Krizanc et al. - 1993
2 A lower bound on area-universal graphs - Bilardi, Chauduri et al. - 1994
Documents on the same site (http://www.dei.unipd.it/~geppo/papers.html): More
Fast Deterministic Parallel Branch-and-Bound - Herley, Pietracaprina, Pucci (1999) (Correct)
Parallel Algorithms for Priority Queue Operations - Pinotti, Pucci (1992) (Correct)
Three non Conventional Paradigms of Parallel Computation - Luccio, Pagli, Pucci (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC