Sciweavers

675 search results - page 8 / 135
» Using Fairness to Make Abstractions Work
Sort
View
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á...
ICFP
2007
ACM
13 years 11 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
SIGSOFT
2009
ACM
14 years 8 months ago
Fair and balanced?: bias in bug-fix datasets
Software engineering researchers have long been interested in where and why bugs occur in code, and in predicting where they might turn up next. Historical bug-occurence data has ...
Christian Bird, Adrian Bachmann, Eirik Aune, John ...
ICRA
2009
IEEE
142views Robotics» more  ICRA 2009»
13 years 5 months ago
Making networked robots connectivity-aware
Maintaining the network connectivity in mobile Multi-Robot Systems (MRSs) is a key issue in many robotic applications. In our view, the solution to this problem consists of two mai...
Van Tuan Le, Noury Bouraqadi, Serge Stinckwich, Vi...
SIGCOMM
2005
ACM
14 years 29 days ago
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practica...
Martin Heusse, Franck Rousseau, Romaric Guillier, ...