Sciweavers

3616 search results - page 86 / 724
» Conditional Memory Ordering
Sort
View
SIAMCOMP
2008
154views more  SIAMCOMP 2008»
15 years 3 months ago
Cryptography in the Bounded-Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
HIPEAC
2009
Springer
15 years 9 months ago
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
Mohammad Ansari, Mikel Luján, Christos Kots...
ASPDAC
2011
ACM
217views Hardware» more  ASPDAC 2011»
14 years 8 months ago
Realization and performance comparison of sequential and weak memory consistency models in network-on-chip based multi-core syst
This paper studies realization and performance comparison of the sequential and weak consistency models in the network-on-chip (NoC) based distributed shared memory (DSM) multi-cor...
Abdul Naeem, Xiaowen Chen, Zhonghai Lu, Axel Jants...
ETFA
2006
IEEE
15 years 10 months ago
Memory-Aware Feedback Scheduling of Control Tasks
This paper presents the incorporation of an auto-tuning real-time garbage collector into a feedback-based on-line scheduling system. The studied feedback scheduler is designed to ...
Sven Gestegard Robertz, Dan Henriksson, Anton Cerv...
ICML
2008
IEEE
16 years 5 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona