54 search results - page 6 / 11 » Proving Copyless Message Passing |
112
click to vote
PLDI
2012
ACM
13 years 1 days 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...
DC
2010
14 years 9 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
ENTCS
2008
14 years 9 months ago
2008
Object orientation and component-based development have both proven useful for the elaboration of open distributed systems. These paradigms are offered by the Creol language. Creo...
PERCOM
2010
ACM
15 years 1 months ago
2010
ACM
Abstract—People waste many hours driving each day. Although unavoidable, this time can be very boring to motorists. Similar to people taking mass transit who often pass the time ...
SOFSEM
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by a potentially flawed deployment of the one time pad in a recent quantum cryptographic application securing a bank transfer [12], we show how to implement a statistica...