1257 search results - page 61 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
109
click to vote
IWQOS
2004
Springer
15 years 5 months ago
2004
Springer
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
CCIA
2008
Springer
15 years 1 months ago
2008
Springer
Meetings are an important vehicle for human interaction. The Meeting Scheduling problem (MS) considers several agents, each holding a personal calendar, and a number of meetings wh...
PARELEC
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
— We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm re...