1257 search results - page 15 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
103
click to vote
FEDCSIS
2011
13 years 9 months ago
2011
—An approach for resource scheduling based on multiagent model with distributed queue is discussed. Algorithms of functioning agents for distributed Grid scheduling are presented...
EUROPAR
2007
Springer
15 years 4 months ago
2007
Springer
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...
138
click to vote
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...