Sciweavers

40 search results - page 4 / 8
» Computing with Reads and Writes in the Absence of Step Conte...
Sort
View
SIGECOM
2005
ACM
118views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Content availability, pollution and poisoning in file sharing peer-to-peer networks
Copyright holders have been investigating technological solutions to prevent distribution of copyrighted materials in peer-to-peer file sharing networks. A particularly popular t...
Nicolas Christin, Andreas S. Weigend, John Chuang
IPPS
2006
IEEE
14 years 1 months ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen
SPAA
2009
ACM
14 years 8 months ago
Scalable reader-writer locks
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
Yossi Lev, Victor Luchangco, Marek Olszewski
VMCAI
2007
Springer
14 years 1 months ago
DIVINE: DIscovering Variables IN Executables
Abstract. This paper addresses the problem of recovering variable-like entities when analyzing executables in the absence of debugging information. We show that variable-like entit...
Gogul Balakrishnan, Thomas W. Reps
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume