Sciweavers

65 search results - page 12 / 13
» When does a correct mutual exclusion algorithm guarantee mut...
Sort
View
ALGOSENSORS
2009
Springer
14 years 1 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
ICWN
2003
13 years 8 months ago
Providing Secondary Access in a Cellular Network
— Most wireless systems receive a license that gives them exclusive access to a block of spectrum. Exclusivity guarantees adequate quality of service, but it also leads to inefï¬...
Sooksan Panichpapiboon, Jon M. Peha
MICRO
2010
IEEE
172views Hardware» more  MICRO 2010»
13 years 5 months ago
Architectural Support for Fair Reader-Writer Locking
Abstract--Many shared-memory parallel systems use lockbased synchronization mechanisms to provide mutual exclusion or reader-writer access to memory locations. Software locks are i...
Enrique Vallejo, Ramón Beivide, Adriá...
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
Distributed spatial multiplexing with 1-bit feedback
— We analyze the feasibility of distributed spatial multiplexing with limited feedback in a slow-fading interference network with MN non-cooperating single-antenna sources and M ...
J. Thukral, Helmut Bölcskei
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 11 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla