735 search results - page 57 / 147 » Randomization in Parallel Stringology |
134
click to vote
IOPADS
1997
15 years 3 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
159
Voted
PERCOM
2005
ACM
16 years 2 months ago
2005
ACM
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
115
click to vote
ICPP
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
100
click to vote
JPDC
2006
15 years 2 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
139
click to vote
FCCM
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...