A Proposal for the BSP Worldwide Standard Library (preliminary version) (2007)
Mark Goudreau, Kevin Lang, Bill Mccoll, Satish B. Rao, Dan C. Stefanescu, ...
This memory area is reguarded as unregistered. 6. The explicit registration mechanism removes possible implicit assumptions about the compilation of static data as used by the Cray SHMEM and Oxford...
F. T. Leighton, Bruce M. Maggs, Satish B. Rao
In this paper, we prove that there exists a schedule for routing any set of packets with edge-simple paths, on any network, in O(c+d) steps, where c is the congestion of the paths in the network, and...
Mark W. Goudreau, Stavros G. Kolliopoulos, Satish B. Rao
A basic problem faced by designers of high-bandwidth switches and routers is to provide effective techniques for scheduling the routing of cells through crossbars. The problem is particularly...
Portable and Efficient Parallel Computing Using the BSP Model (1999)
Mark Goudreau, Kevin Lang, Satish B. Rao, Torsten Suel, Thanasis Tsantilas
The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware. In theory, the BSP model has been shown to allow the asymptotically...
BOS is Boss: A Case for Bulk-Synchronous Object Systems (1999)
Mark W. Goudreau, Kevin Lang, Girija Narlikar, Satish B. Rao
A key issue for parallel systems is the development of useful programming abstractions that can coexist with good performance. We describe a communication library that supports an object-based...
BSPlib: The BSP Programming Library (1998)
Bill Mccoll, Dan C. Stefanescu, Mark W. Goudreau, Kevin Lang, Satish B. Rao, ...
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full definition of BSPlib in C, motivates...
Improved Approximation Schemes for Geometrical Graphs Via Spanners and Banyans (1998)
Satish B. Rao, Warren D. Smith
We give deterministic and randomized algorithms to find a Euclidean traveling salesman tour (TST) of length within (1 + 1=s) times optimal. They run in O(N log N) time and O(N) space for constant...
Approximating Geometrical Graphs Via Spanners and Banyans (1998)
Satish B. Rao, Warren D. Smith
The main result of this paper is an improvement of Arora's method to find (1+ ffl) approximations for geometric NP-hard problems including the Euclidean Traveling Salesman Problem and the...
BSPlib: The BSP Programming Library (1998)
Jonathan Hill, Bill Mccoll, Dan C. Stefanescu, Mark W. Goudreau, Kevin Lang, Satish B. Rao, ...
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full definition of BSPlib in C, motivates...
Portable and Efficient Parallel Computing Using the BSP Model (1998)
Mark W. Goudreau, Kevin Lang, Satish B. Rao, Torsten Suel, Thanasis Tsantilas
The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware. In theory, the BSP model has been shown to allow the asymptotically...
BSPlib - The BSP Programming Library (1997)
Bill Mccoll, Dan C. Stefanescu, Mark W. Goudreau, Kevin Lang, Satish B. Rao, ...
This memory area is regarded as unregistered. 6. While registration is designed for "full duplex" communication, a process can do half duplex communication by, appropriately, registering an...
Http://www.bsp-Worldwide.org/ (1997)
May Ansi, Bill Mccoll, Dan C. Stefanescu, Mark W. Goudreau, Kevin Lang, ...
This memory area is regarded as unregistered. 6. While registration is designed for "full duplex" communication, a process can do half duplex communication by, appropriately, registering an...
A maximum likelihood stereo algorithm (1996)
Ingemar J. Cox, Sunita L. Hingorani, Satish B. Rao, Bruce M. Maggs
A stereo algorithm is presented that optimizes a maximum likelihood cost function. The maximum likelihood cost function assumes that corresponding features in the left and right images are Normally...
Randomized Routing and Sorting on Fixed-Connection Networks (1994)
F.T. Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish B. Rao
This paper presents a general paradigm for the design of packet routing algorithms for fixed-connection networks. Its basis is a randomized on-line algorithm for scheduling any set of N packets whose...
Randomized routing and sorting on fixed-connection networks (1994)
F. T. Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish B. Rao
This paper presents a general paradigm for the design of packet routing algorithms for xed-connection networks. Its basis is a randomized on-line algorithm for scheduling any set of N packets whose...
Work-Preserving Emulations of Fixed-Connection Networks (1989)
Richard R. Koch, F. T. Leighton, Bruce M. Maggs, Satish B. Rao, Arnold L. Rosenberg, Eric J. Schwabe
In this paper, we study the problem of emulating TG steps of an NG -node guest network, G, on an NH -node host network, H. We call an emulation work-preserving if the time required by the host, TH ,...
Work-Preserving Emulations of Fixed-Connection Networks (1989)
Richard R. Koch, F. T. Leighton, Bruce M. Maggs, Satish B. Rao, Arnold L. Rosenberg, Eric J. Schwabe
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission...
Work-preserving emulations of fixed-connection networks (1989)
Richard R. Koch, F. T. Leighton, Bruce M. Maggs, Satish B. Rao, Arnold L. Rosenberg, Eric J. Schwabe
Abstract. In this paper, we study the problem of emulating T G steps of an N G-node guest network, G, on an N H-node host network, H. We call an emulation work-preserving if the time required by the...