Sciweavers

1448 search results - page 49 / 290
» Restricted Stack Implementations
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
13 years 7 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
SPAA
2009
ACM
14 years 8 days ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
DC
2006
13 years 7 months ago
On the inherent weakness of conditional primitives
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...
Faith Ellen Fich, Danny Hendler, Nir Shavit
FAST
2009
13 years 5 months ago
BORG: Block-reORGanization for Self-optimizing Storage Systems
This paper presents the design, implementation, and evaluation of BORG, a self-optimizing storage system that performs automatic block reorganization based on the observed I/O wor...
Medha Bhadkamkar, Jorge Guerra, Luis Useche, Sam B...
PPOPP
2012
ACM
12 years 3 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank