1257 search results - page 115 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
139
Voted
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
122
click to vote
ICPP
1993
IEEE
15 years 5 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
125
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
TON
2002
15 years 1 months ago
2002
We consider input-queued switch architectures dealing at their interfaces with variable-size packets, but internally operating on fixed-size cells. Packets are segmented into cells...
110
Voted
HIPC
2005
Springer
15 years 7 months ago
2005
Springer
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is ...