6004 search results - page 962 / 1201 » Parallelizing query optimization |
110
click to vote
SPDP
1993
IEEE
15 years 6 months ago
1993
IEEE
- 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 ...
155
click to vote
SPAA
1994
ACM
15 years 6 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
111
Voted
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
Parallel prefix adder is the most flexible and widely-used binary adder for ASIC designs. Many high-level synthesis techniques have been developed to find optimal prefix structures...
96
Voted
CLUSTER
2007
IEEE
15 years 6 months ago
2007
IEEE
High-performance computing (HPC) systems consume a significant amount of power, resulting in high operational costs, reduced reliability, and wasting of natural resources. Therefor...
118
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...