Sciweavers

275 search results - page 26 / 55
» A Markovian Concurrency Measure
Sort
View
SIGCOMM
2006
ACM
15 years 3 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
PDP
2009
IEEE
15 years 4 months ago
Effects of Job and Task Placement on Parallel Scientific Applications Performance
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
Javier Navaridas, Jose Antonio Pascual, José...
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin
CASES
2008
ACM
14 years 11 months ago
Execution context optimization for disk energy
Power, energy, and thermal concerns have constrained embedded systems designs. Computing capability and storage density have increased dramatically, enabling the emergence of hand...
Jerry Hom, Ulrich Kremer
CLUSTER
2002
IEEE
15 years 2 months ago
COMB: A Portable Benchmark Suite for Assessing MPI Overlap
This paper describes a portable benchmark suite that assesses the ability of cluster networking hardware and software to overlap MPI communication and computation. The Communicati...
William Lawry, Christopher Wilson, Arthur B. Macca...