1257 search results - page 91 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
GLOBECOM
2006
IEEE
15 years 7 months ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
110
click to vote
PPAM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
135
click to vote
TMC
2012
13 years 4 months ago
2012
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
109
click to vote
RTCSA
2000
IEEE
15 years 6 months ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
147
Voted
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...