1257 search results - page 55 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
DKE
2007
14 years 11 months ago
2007
The use of rules in a distributed environment creates new challenges for the development of active rule execution models. In particular, since a single event can trigger multiple ...
DFG
2009
Springer
15 years 6 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communicatio...
104
click to vote
ICA3PP
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring ...