6542 search results - page 975 / 1309 » The tao of parallelism in algorithms |
192
click to vote
ISCC
2006
IEEE
16 years 25 days ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
161
click to vote
SKG
2006
IEEE
16 years 25 days ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
199
click to vote
PODC
2006
ACM
16 years 24 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
161
click to vote
PPOPP
2006
ACM
16 years 24 days ago
2006
ACM
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
154
click to vote
SAC
2006
ACM
16 years 24 days ago
2006
ACM
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects repl...