Scheduling Tree-Dags Using FIFO Queues: A (2008)
Control-memory Tradeo, Sandeep N. Bhatt, F. Thomson Leighton, Arnold L. Rosenberg
Abstract. We study here a combinatorial problem that is motivated by a genre of architecture-independent scheduler for parallel computations. Such schedulers are often used, for instance, when...
Sandeep N. Bhatt, New Brunswick, F. Thomson Leighton, Arnold L. Rosenberg
1 Abstract. We study aspects of the parallel scheduling problem for a new modality of parallel computing: having one workstation “steal cycles ” from another. We focus on a draconian mode of...
Sandeep N. Bhatt, Gianfranco Bilardi, Abhiram Ranade, Arnold L. Rosenberg, Eric J. Schwabe
Illinois We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this...
Authors ' Mailing Addresses (2007)
Sandeep N. Bhatt, Sandeep N. Bhatt, Abhiram Ranade, Abhiram Ranade, Arnold L. Rosenberg, Arnold L. Rosenberg, ...
2
Proposed Running Head Tight Bounds on Parallel List Marking (2007)
Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Abhiram Ranade
Universit`a di Padova
Sandeep N. Bhatt, Gianfranco Bilardi, Abhiram Ranade, Arnold L. Rosenberg, Eric J. Schwabe
We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this paradigm,...
Authors ' Mailing Addresses (2007)
Sandeep N. Bhatt, Sandeep N. Bhatt, Abhiram Ranade, Abhiram Ranade, Arnold L. Rosenberg, Arnold L. Rosenberg, ...
2
Sandeep N. Bhatt, F. Thomson Leighton, Arnold L. Rosenberg
Abstract. We study a combinatorial problem that is motivated by "client-server " schedulers for parallel computations. Such schedulers are often used, for instance, when...
How to Embed Trees in Hypercubes. (2002)
Bhatt,Sandeep N., Ipsen,Ilse C. F.
Many parallel machines based on the interconnections of the boolean hypercube are now commercially available. A distinctive feature of the hypercube is its universality-computer programs written for...
Area-Universal Circuits with Constant Slowdown (1999)
Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci
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...
Area-universal circuits with constant slowdown (1999)
Sandeep N. Bhatt, Gianfranco Bilardi
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...
An Approximation Algorithm for Manhattan Routing, (1998)
Baker,Brenda S., Bhatt,Sandeep N., Leighton,Frank Thomson
Channel routing plays a central role in the development of automated layout systems for integrated circuits. One of the most common models for channel routing is known as Manhattan routing. In...
Optimal Simulations by Butterfly Networks: Extended Abstract, (1998)
Bhatt, Sandeep N., Chung, Fan R., Hong, Jia-Wei, Leighton, F. T., Rosenberg, Arnold
We investigate the power of the Butterfly network (which is the FFT network with inputs and outputs identified) relative to other proposed multicomputer interconnection networks, by considering how...
Optimal Simulations by Butterfly Networks. (1998)
Bhatt, Sandeep N., Chung, Fan R., Hong, Jia-Wei, Leighton, F. T., Rosenberg, Arnold L.
The power of Butterfly-type networks relative to other proposed multicomputer interconnection networks is studied, by considering how efficiently the Butterfly can simulate the other networks....
The Fluent Abstract Machine. (1997)
Ranade, Abhiram G., Bhatt, Sandeep N., Johnsson, S. L.
The fluent abstract machine supports a very powerful programming model. In addition to arbitrary access patterns, the instruction repertoire of the fluent machine also includes the multiprefix...
Augmented Ring Networks (1996)
William Aiello Sandeep, Sandeep N. Bhatt, Arnold L. Rosenberg, Ramesh K. Sitaraman
We study three augmentations of ring networks that are intended to decrease a ring's diameter significantly while increasing its structural complexity only modestly. Chordal rings enhance a ring...
Augmented Ring Networks (1996)
William Aiello, Sandeep N. Bhatt, Arnold L. Rosenberg, Ramesh K. Sitaraman
We study three augmentations of ring networks that are intended to decrease a ring's diameter significantly while increasing its structural complexity only modestly. Chordal rings enhance a ring...
Optimal Emulations by Butterfly-Like Networks (1996)
Sandeep N. Bhatt, Jia-wei Hong, F. Thomson Leighton, Arnold L. Rosenberg, Eric J. Schwabe, ...
The power of butterfly-like networks as multicomputer interconnection networks is studied, by considering how efficiently the butterfly can emulate other networks. Emulations are studied formally via...
Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Tradeoff (1996)
Sandeep N. Bhatt, F. Thomson Leighton, Arnold L. Rosenberg
. We study here a combinatorial problem that is motivated by a genre of architecture-independent scheduler for parallel computations. Such schedulers are often used, for instance, when computations...
On Optimal Strategies for Stealing Cycles (1995)
Sandeep N. Bhatt, New Brunswick, F. Thomson Leighton, Arnold L. Rosenberg
. The growing importance of networked workstations as a computing milieu has created a new modality of parallel computing, namely, the possibility of having one workstation "steal cycles"...
Salvage-embeddings of complete trees (1995)
Sandeep N. Bhatt, F. Thomson Leighton, Arnold L. Rosenberg
Abstract. A salvage-embedding (S-embedding) maps a complete binary tree G into a larger complete binary tree H some fraction of whose leaves have been labeled good. The S-embedding maps leaves of G...
Universal graphs for bounded-degree trees and planar graphs (1989)
Sandeep N. Bhatt, F. T. Leighton, L. Rosenberg
Abstract. How small can a graph be that contains as subgraphs all trees on n vertices with maximum degree d? In this paper, this question is answered by constructing such universal graphs that have n...
A framework for solving VLSI graph layout problems (1984)
Sandeep N. Bhatt, Frank T. Leighton, Frank Thomson Leighton
This blank age,as inserted to reser,,e aginatio,