Sciweavers

311 search results - page 23 / 63
» Software-Controlled Multithreading Using Informing Memory Op...
Sort
View
HASKELL
2009
ACM
14 years 2 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
CCS
2007
ACM
14 years 1 months ago
Non-volatile memory and disks: avenues for policy architectures
As computing models change, so too do the demands on storage. Distributed and virtualized systems introduce new vulnerabilities, assumptions, and performance requirements on disks...
Kevin R. B. Butler, Stephen E. McLaughlin, Patrick...
IEEEPACT
2002
IEEE
14 years 21 days ago
Increasing and Detecting Memory Address Congruence
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...
Samuel Larsen, Emmett Witchel, Saman P. Amarasingh...
HPCA
2008
IEEE
14 years 8 months ago
Runahead Threads to improve SMT performance
In this paper, we propose Runahead Threads (RaT) as a valuable solution for both reducing resource contention and exploiting memory-level parallelism in Simultaneous Multithreaded...
Tanausú Ramírez, Alex Pajuelo, Olive...
DAMON
2007
Springer
14 years 1 months ago
The five-minute rule twenty years later, and how flash memory changes the rules
In 1987, Gray and Putzolo presented the five-minute rule, which was reviewed and renewed ten years later in 1997. With the advent of flash memory in the gap between traditional RA...
Goetz Graefe