Sciweavers

13 search results - page 2 / 3
» Proving Liveness with Fairness Using Rewriting
Sort
View
ACTA
2011
13 years 6 days ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink
ICDCS
2008
IEEE
13 years 11 months ago
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
Vijay Anand Reddy, Prateek Mittal, Indranil Gupta
ISM
2006
IEEE
253views Multimedia» more  ISM 2006»
13 years 11 months ago
Gossip Based Streaming with Incentives for Peer Collaboration
— Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute band...
Sachin Agarwal, Shruti Dube
MM
2004
ACM
94views Multimedia» more  MM 2004»
13 years 10 months ago
Towards automated story analysis using participatory design
Involving a school teacher in the development of the intelligent writing tutor StoryStation allowed progress to be made on the problem of story classification, an aspect of story...
Harry Halpin, Johanna D. Moore, Judy Robertson
DC
2010
13 years 5 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh