Sciweavers

592 search results - page 85 / 119
» Fairness and Channel Coordination
Sort
View
SIGMETRICS
1998
ACM
14 years 9 months ago
Scheduling with Implicit Information in Distributed Systems
Implicitcoscheduling is a distributed algorithm fortime-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local sche...
Andrea C. Arpaci-Dusseau, David E. Culler, Alan M....
WINET
2002
124views more  WINET 2002»
14 years 9 months ago
Improving Energy Efficiency of Centrally Controlled Wireless Data Networks
Wireless network access protocols can assist nodes to conserve energy by identifying when they can enter low energy states. The goal is to put all nodes not involved in a transmiss...
John A. Stine, Gustavo de Veciana
ECRTS
2007
IEEE
15 years 3 months ago
Composition Techniques for Tree Communication Schedules
A critical resource in a distributed real-time system is its shared communication medium. Unrestrained concurrent access to the network can lead to collisions that reduce the syst...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
COORDINATION
2007
Springer
15 years 3 months ago
Reactors: A Data-Oriented Synchronous/Asynchronous Programming Model for Distributed Applications
Our aim is to define the kernel of a simple and uniform programming model—the reactor model—suitable for building and evolving internet-scale programs. A reactor consists of t...
John Field, Maria-Cristina V. Marinescu, Christian...
83
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
Kalman Filter Estimation of the Number of Competing Terminals in an IEEE 802.11 network
Abstract— Throughput performance of the IEEE 802.11 Distributed Coordination Function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper ...
Giuseppe Bianchi, Ilenia Tinnirello