Sciweavers

Share
20 search results - page 2 / 4
» A local greedy scheduling scheme with provable performance g...
Sort
View
WIOPT
2006
IEEE
8 years 10 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
DAC
2009
ACM
9 years 5 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
TWC
2008
87views more  TWC 2008»
8 years 4 months ago
A token-based scheduling scheme for WLANs supporting voice/data traffic and its performance analysis
Most of the existing medium access control (MAC) protocols for wireless local area networks (WLANs) provide prioritized access by adjusting the contention window sizes or interfram...
Ping Wang, Weihua Zhuang
PODC
2005
ACM
8 years 10 months ago
Toward a theory of transactional contention managers
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon
MOBICOM
2009
ACM
8 years 11 months ago
Optimal beam scheduling for multicasting in wireless networks
We consider the problem of efficient link-layer multicasting in wireless networks with switched beamforming antennas. The inherent tradeoff between multicasting and beamforming ...
Karthikeyan Sundaresan, Kishore Ramachandran, Samp...
books