Sciweavers

1765 search results - page 247 / 353
» Communication Scheduling
Sort
View
155
Voted
ISCC
2003
IEEE
15 years 8 months ago
Throughput Achievable with No Relaying in a Mobile Interference Network
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
Elif Uysal-Biyikoglu, Abtin Keshavarzian
141
Voted
MOBIHOC
2003
ACM
15 years 8 months ago
Improving fairness among TCP flows crossing wireless ad hoc and wired networks
In scenarios where wireless ad hoc networks are deployed, sometimes it would be desirable that ad hoc nodes can communicate with servers in wired networks to upload or download da...
Luqing Yang, Winston Khoon Guan Seah, Qinghe Yin
108
Voted
STOC
1998
ACM
108views Algorithms» more  STOC 1998»
15 years 7 months ago
On Indexed Data Broadcast
We consider the problem of efficient information retrieval in asymmetric communication environments where multiple clients with limited resources retrieve information from a power...
Sanjeev Khanna, Shiyu Zhou
162
Voted
ICDCS
1995
IEEE
15 years 7 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
Raed Alqadi, Parameswaran Ramanathan
104
Voted
ICS
1995
Tsinghua U.
15 years 7 months ago
On the Utility of Threads for Data Parallel Programming
Threads provide a useful programming model for asynchronous behavior because of their ability to encapsulate units of work that can then be scheduled for execution at runtime, bas...
Thomas Fahringer, Matthew Haines, Piyush Mehrotra