1257 search results - page 80 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
187
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We propose FIT, a flexible, light-weight and real-time scheduling system for wireless sensor platforms. There are three salient features of FIT. First, its two-tier hiera...
151
click to vote
ICPP
2000
IEEE
15 years 10 months ago
2000
IEEE
A runtime parallel incremental DAG scheduling approach is described in this paper. A DAG is expanded incrementally, scheduled, and executed on a parallel machine. A DAG scheduling...
156
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
159
click to vote
FGCS
2007
15 years 6 months ago
2007
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
144
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...