6105 search results - page 412 / 1221 » A Parallel Algorithm for Bound-Smoothing |
184
click to vote
COR
2006
15 years 6 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
157
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
233
click to vote
PE
2000
Springer
15 years 6 months ago
2000
Springer
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
180
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
176
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...