Sciweavers

95 search results - page 18 / 19
» Constructive, Deterministic Implementation of Shared Memory ...
Sort
View
INFOCOM
2006
IEEE
13 years 11 months ago
RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...
Jin Liang, Klara Nahrstedt
CONCURRENCY
1998
139views more  CONCURRENCY 1998»
13 years 5 months ago
Applications experience in Jade
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
Martin C. Rinard
PDCN
2004
13 years 6 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
PODC
2011
ACM
12 years 8 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
CCS
2006
ACM
13 years 9 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...