5448 search results - page 534 / 1090 » Breakpoints and Time in Distributed Computations |
155
click to vote
SPAA
1990
ACM
15 years 11 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
185
click to vote
SPAA
1995
ACM
15 years 10 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
187
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
209
click to vote
IPPS
2010
IEEE
15 years 5 months ago
2010
IEEE
With wide adoption of chip multiprocessors (CMPs) in modern computers, there is an increasing demand for large capacity main memory systems. The emerging PCM (Phase Change Memory) ...
207
click to vote
NOSSDAV
2009
Springer
16 years 1 months ago
2009
Springer
Data dissemination in decentralized networks is often realized by using some form of swarming technique. Swarming enables nodes to gather dynamically in order to fulfill a certai...