Sciweavers

10805 search results - page 357 / 2161
» Mapping Computation with No Memory
Sort
View
PODC
2003
ACM
16 years 24 days ago
Software transactional memory for dynamic-sized data structures
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocki...
Maurice Herlihy, Victor Luchangco, Mark Moir, Will...
SPAA
2003
ACM
16 years 24 days ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin
IPPS
2002
IEEE
16 years 15 days ago
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
SPAA
2010
ACM
16 years 11 days ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
HIPEAC
2009
Springer
16 years 5 days 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...