Sciweavers

1765 search results - page 122 / 353
» Communication Scheduling
Sort
View
169
Voted
MOBICOM
2006
ACM
15 years 9 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
124
Voted
ISORC
2003
IEEE
15 years 9 months ago
The Event-Triggered and Time-Triggered Medium-Access Methods
The processes of accessing a shared communication media have been extensively researched in the dependability and real-time area. For embedded systems, the primary approaches have...
Vilgot Claesson, Cecilia Ekelin, Neeraj Suri
152
Voted
INFOCOM
1999
IEEE
15 years 8 months ago
Matching Output Queueing with a Combined Input Output Queued Switch
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaj...
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 3 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
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...
Chryssis Georgiou, Alexander Russell, Alexander A....
111
Voted
SPAA
1993
ACM
15 years 7 months ago
Optimal Broadcast and Summation in the LogP Model
We consider several natural broadcasting problems for the LogP model of distributed memory machines recently proposed by Culler et al. For each of these problems, we present algor...
Richard M. Karp, Abhijit Sahay, Eunice E. Santos, ...