Sciweavers

1471 search results - page 10 / 295
» Composing concurrency control
Sort
View
EPEW
2010
Springer
14 years 10 months ago
Composing Systems While Preserving Probabilities
Abstract. Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. Th...
Sonja Georgievska, Suzana Andova
FOCS
2010
IEEE
14 years 7 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
FMICS
2009
Springer
15 years 4 months ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan
ICC
2007
IEEE
15 years 4 months ago
Wide-Sense Nonblocking Multiplane Baseline Switching Networks Composed of d d Switches
Abstract— A new control algorithm for log2(N, 0, p) switching networks composed of 2 × 2 switching elements has been proposed recently. Under this algorithm, log2(N, 0, p) switc...
Grzegorz Danilewicz, Wojciech Kabacinski, Marek Mi...
POS
1994
Springer
15 years 1 months ago
Concurrent Shadow Paging in the Flask Architecture
The differing requirements for concurrency models in programming languages and databases are widely diverse and often seemingly incompatible. The rigid provision of a particular c...
David S. Munro, Richard C. H. Connor, Ronald Morri...