Sciweavers

25 search results - page 5 / 5
» The locality of concurrent write barriers
Sort
View
IPPS
2007
IEEE
14 years 2 days ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
ISCA
2008
IEEE
134views Hardware» more  ISCA 2008»
14 years 5 days ago
Flexible Decoupled Transactional Memory Support
A high-concurrency transactional memory (TM) implementation needs to track concurrent accesses, buffer speculative updates, and manage conflicts. We present a system, FlexTM (FLE...
Arrvindh Shriraman, Sandhya Dwarkadas, Michael L. ...
HICSS
2002
IEEE
144views Biometrics» more  HICSS 2002»
13 years 10 months ago
Managing Long Term Communications: Conversation and Contact Management
Contact management is an important part of everyday work. People exchange business cards to try to enter each other’s contact lists. Local businesses provide refrigerator magnet...
Steve Whittaker, Quentin Jones, Loren G. Terveen
POPL
2012
ACM
12 years 1 months ago
A type system for borrowing permissions
In object-oriented programming, unique permissions to object references are useful for checking correctness properties such as consistency of typestate and noninterference of conc...
Karl Naden, Robert Bocchino, Jonathan Aldrich, Kev...
USENIX
2008
13 years 8 months ago
Vx32: Lightweight User-level Sandboxing on the x86
Code sandboxing is useful for many purposes, but most sandboxing techniques require kernel modifications, do not completely isolate guest code, or incur substantial performance co...
Bryan Ford, Russ Cox