Sciweavers

339 search results - page 11 / 68
» Reducing Memory Ordering Overheads in Software Transactional...
Sort
View
IISWC
2009
IEEE
14 years 3 months ago
On the (dis)similarity of transactional memory workloads
— Programming to exploit the resources in a multicore system remains a major obstacle for both computer and software engineers. Transactional memory offers an attractive alternat...
Clay Hughes, James Poe, Amer Qouneh, Tao Li
CCS
2008
ACM
13 years 10 months ago
Enforcing authorization policies using transactional memory introspection
Correct enforcement of authorization policies is a difficult task, especially for multi-threaded software. Even in carefully-reviewed code, unauthorized access may be possible in ...
Arnar Birgisson, Mohan Dhawan, Úlfar Erling...
FPGA
2012
ACM
285views FPGA» more  FPGA 2012»
12 years 4 months ago
Optimizing SDRAM bandwidth for custom FPGA loop accelerators
Memory bandwidth is critical to achieving high performance in many FPGA applications. The bandwidth of SDRAM memories is, however, highly dependent upon the order in which address...
Samuel Bayliss, George A. Constantinides
SPAA
2009
ACM
14 years 9 months ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman
ASPLOS
2012
ACM
12 years 4 months ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...