432 search results - page 49 / 87 » Internally deterministic parallel algorithms can be fast |
111
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
103
Voted
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Learning the underlying model from distributed data is often useful for many distributed systems. In this paper, we study the problem of learning a non-parametric model from distr...
105
Voted
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
We address the design of complex monolithic systems, where processing cores generate and consume a varying and large amount of data, thus bringing the communication links to the e...
109
Voted
LCPC
2007
Springer
15 years 8 months ago
2007
Springer
The use of multiprocessor tasks (M-tasks) has been shown to be successful for mixed task and data parallel implementations of algorithms from scientific computing. The approach o...
113
Voted
IPCO
1998
15 years 3 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...