Sciweavers

3360 search results - page 259 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...
ATAL
2008
Springer
15 years 8 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
EDBT
2008
ACM
161views Database» more  EDBT 2008»
16 years 6 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
ICPP
2003
IEEE
15 years 12 months ago
Scheduling Algorithms with Bus Bandwidth Considerations for SMPs
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
Christos D. Antonopoulos, Dimitrios S. Nikolopoulo...
IPPS
2002
IEEE
15 years 11 months ago
A SIMD Vectorizing Compiler for Digital Signal Processing Algorithms
Short vector SIMD instructions on recent microprocessors, such as SSE on Pentium III and 4, speed up code but are a major challenge to software developers. We present a compiler t...
Franz Franchetti, Markus Püschel