1226 search results - page 62 / 246 » Proofs, Programs and Abstract Complexity |
166
click to vote
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
148
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...
134
click to vote
JFP
2000
15 years 3 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
266
click to vote
SIGCOMM
2012
ACM
13 years 5 months ago
2012
ACM
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
112
click to vote
PPOPP
1995
ACM
15 years 6 months ago
1995
ACM
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...