Sciweavers

3378 search results - page 579 / 676
» A universe of binding and computation
Sort
View
107
Voted
PPOPP
2009
ACM
16 years 1 months ago
Effective performance measurement and analysis of multithreaded applications
Understanding why the performance of a multithreaded program does not improve linearly with the number of cores in a sharedmemory node populated with one or more multicore process...
Nathan R. Tallent, John M. Mellor-Crummey
96
Voted
PODC
2009
ACM
16 years 1 months ago
Partial synchrony based on set timeliness
d Abstract] Marcos K. Aguilera Microsoft Research Silicon Valley Mountain View, CA, USA Carole Delporte-Gallet Universit? Paris 7 Paris, France Hugues Fauconnier Universit? Paris ...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
103
Voted
CAV
2009
Springer
165views Hardware» more  CAV 2009»
16 years 1 months ago
Symbolic Counter Abstraction for Concurrent Software
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
Daniel Kroening, Gérard Basler, Michele Maz...
HPCA
2009
IEEE
16 years 1 months ago
Prediction router: Yet another low latency on-chip router architecture
Network-on-Chips (NoCs) are quite latency sensitive, since their communication latency strongly affects the application performance on recent many-core architectures. To reduce th...
Hiroki Matsutani, Michihiro Koibuchi, Hideharu Ama...
106
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 1 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs