Sciweavers

835 search results - page 19 / 167
» Scheduling to maximize participation
Sort
View
75
Voted
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
15 years 3 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 1 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
POPL
1998
ACM
15 years 1 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
93
Voted
TON
2010
173views more  TON 2010»
14 years 7 months ago
Minimizing delay and maximizing lifetime for wireless sensor networks with anycast
—In this paper, we are interested in minimizing the delay and maximizing the lifetime of event-driven wireless sensor networks, for which events occur infrequently. In such syste...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...
INFOCOM
2008
IEEE
15 years 3 months ago
Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
Gil Zussman, Andrew Brzezinski, Eytan Modiano