1257 search results - page 159 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
158
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
117
click to vote
ISAAC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
CLUSTER
2008
IEEE
15 years 4 months ago
2008
IEEE
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...