Sciweavers

1534 search results - page 99 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
ICS
2003
Tsinghua U.
14 years 3 months ago
Enhancing memory level parallelism via recovery-free value prediction
—The ever-increasing computational power of contemporary microprocessors reduces the execution time spent on arithmetic computations (i.e., the computations not involving slow me...
Huiyang Zhou, Thomas M. Conte
CLUSTER
2009
IEEE
13 years 8 months ago
Coordinating the use of GPU and CPU for improving performance of compute intensive applications
GPUs have recently evolved into very fast parallel co-processors capable of executing general purpose computations extremely efficiently. At the same time, multi-core CPUs evolutio...
George Teodoro, Rafael Sachetto Oliveira, Olcay Se...
CONCUR
2008
Springer
13 years 12 months ago
Modeling Computational Security in Long-Lived Systems
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
RSA
2000
170views more  RSA 2000»
13 years 10 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
ISORC
2002
IEEE
14 years 3 months ago
ARTISST: An Extensible and Modular Simulation Tool for Real-Time Systems
ARTISST (ARTISST is a Real-Time System Simulation Tool) is a modular event-driven simulation framework for real-time systems. It is targeted towards the performance evaluation of ...
David Decotigny, Isabelle Puaut