Sciweavers

2041 search results - page 294 / 409
» Balance Machines: Computing = Balancing
Sort
View
IPPS
1999
IEEE
15 years 2 months ago
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
Hettihe P. Dharmasena, Ramachandran Vaidyanathan
RAID
1999
Springer
15 years 2 months ago
SNMS - Shadow Network Management System
Putting in more security measures and access controls within an organisation runs contrary to operational e ciency and convenience. Although the balance between security and opera...
Tiang Hwee Ong, Chung Pheng Tan, Yong Tai Tan, Chr...
RT
1999
Springer
15 years 2 months ago
Decoupling Polygon Rendering from Geometry using Rasterization Hardware
The dramatically increasing size of polygonal models resulting from 3D scanning devices and advanced modeling techniques requires new approaches to reduce the load of geometry tran...
Rüdiger Westermann, Ove Sommer, Thomas Ertl
SPAA
1998
ACM
15 years 2 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
ICPADS
1994
IEEE
15 years 2 months ago
Efficient Fault Tolerance: An Approach to Deal with Transient Faults in Multiprocessor Architectures
Dynamic error processing approaches are an important mechanism to increase the reliability in a multiprocessor system, while making efficient use of the available resources. To th...
Andrea Bondavalli, Silvano Chiaradonna, Felicita D...