Sciweavers

33 search results - page 2 / 7
» Heaps and Stacks in Distributed Shared Memory
Sort
View
HPCC
2009
Springer
13 years 8 months ago
Dynamically Filtering Thread-Local Variables in Lazy-Lazy Hardware Transactional Memory
Abstract--Transactional Memory (TM) is an emerging technology which promises to make parallel programming easier. However, to be efficient, underlying TM system should protect only...
Sutirtha Sanyal, Sourav Roy, Adrián Cristal...
PPOPP
2010
ACM
14 years 1 months ago
Symbolic prefetching in transactional distributed shared memory
We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be...
Alokika Dash, Brian Demsky
SPAA
2004
ACM
13 years 9 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
IPPS
1996
IEEE
13 years 8 months ago
Dag-Consistent Distributed Shared Memory
We introduce dag consistency, a relaxed consistency model for distributed shared memory which is suitable for multithreaded programming. We have implemented dag consistency in sof...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
SRDS
2003
IEEE
13 years 9 months ago
Transparent Runtime Randomization for Security
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
Jun Xu, Zbigniew Kalbarczyk, Ravishankar K. Iyer