Sciweavers

352 search results - page 6 / 71
» Parallel Algorithms for Hypercube Allocation
Sort
View
ICPP
1993
IEEE
13 years 11 months ago
Data-Parallel R-Tree Algorithms
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les....
Erik G. Hoel, Hanan Samet
FCS
2006
13 years 8 months ago
A Theoretical Study of Parallel Voronoi Diagram
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
Rashid Muhammad
ICPP
1990
IEEE
13 years 11 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin
SPDP
1993
IEEE
13 years 11 months ago
Fault Tolerant Broadcasting in SIMD Hypercubes
- In this paper, we propose an optimal fault tolerant broadcasting algorithm which requires only n+1 steps for an SIMD hypercube with up to n-1 faulty nodes. The basic idea of the ...
Y. Chang
ICPADS
1998
IEEE
13 years 11 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee