Sciweavers

2452 search results - page 390 / 491
» The Case for Precision Sharing
Sort
View
SRDS
1996
IEEE
15 years 10 months ago
A Transparent Light-Weight Group Service
The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. Implementationsof virtual synchrony usually require...
Luís Rodrigues, Katherine Guo, Antonio Sarg...
PODC
1993
ACM
15 years 10 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ASPDAC
2007
ACM
103views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Slack-based Bus Arbitration Scheme for Soft Real-time Constrained Embedded Systems
- We present a bus arbitration scheme for soft real-time constrained embedded systems. Some masters in such systems are required to complete their work for given timing constraints...
Minje Jun, Kwanhu Bang, Hyuk-Jun Lee, Naehyuck Cha...
171
Voted
CSE
2009
IEEE
15 years 10 months ago
Social Tagging in Query Expansion: A New Way for Personalized Web Search
Social networks and collaborative tagging systems are rapidly gaining popularity as primary means for sorting and sharing data: users tag their bookmarks in order to simplify infor...
Claudio Biancalana, Alessandro Micarelli
PODC
2010
ACM
15 years 10 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...