Results 311 to 320 of about 1,914,541 (354)
Some of the next articles are maybe not open access.
Unbounded Hardware Transactional Memory for a Hybrid DRAM/NVM Memory System
Micro, 2020Persistent memory programming requires failure atomicity. To achieve this in an efficient manner, recent proposals use hardware-based logging for atomic-durable updates and hardware transactional memory (HTM) for isolation.
Jungi Jeong +4 more
semanticscholar +1 more source
ACM SIGARCH Computer Architecture News, 1993
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object.
Maurice Herlihy, J. Eliot B. Moss
openaire +1 more source
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object.
Maurice Herlihy, J. Eliot B. Moss
openaire +1 more source
Lightweight Hardware Transactional Memory for GPU Scratchpad Memory
IEEE transactions on computers, 2018Graphics Processing Units (GPUs) have become the accelerator of choice for data-parallel applications, enabling the execution of thousands of threads in a Single Instruction - Multiple Thread (SIMT) fashion.
Alejandro Villegas +4 more
semanticscholar +1 more source
Fast Scheduling in Distributed Transactional Memory
Theory of Computing Systems, 2017We investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects.
C. Busch +3 more
semanticscholar +1 more source
ACM SIGARCH Computer Architecture News, 2006
Transactional memory (TM) promises to substantially reduce the difficulty of writing correct, efficient, and scalable concurrent programs. But "bounded" and "best-effort" hardware TM proposals impose unreasonable constraints on programmers, while more flexible software TM implementations are considered too slow.
Peter Damron +5 more
openaire +2 more sources
Transactional memory (TM) promises to substantially reduce the difficulty of writing correct, efficient, and scalable concurrent programs. But "bounded" and "best-effort" hardware TM proposals impose unreasonable constraints on programmers, while more flexible software TM implementations are considered too slow.
Peter Damron +5 more
openaire +2 more sources
Proceedings of the 4th ACM/IEEE international conference on Human robot interaction, 2009
This paper introduces Transactive Memory System (TMS) theory to the study of human-robot interaction in a complex work setting comprised of people with complementary domains of expertise. New insights regarding the development of TMS in human-robot incident response teams are presented.
Lei Liu, Pamela J. Hinds
openaire +1 more source
This paper introduces Transactive Memory System (TMS) theory to the study of human-robot interaction in a complex work setting comprised of people with complementary domains of expertise. New insights regarding the development of TMS in human-robot incident response teams are presented.
Lei Liu, Pamela J. Hinds
openaire +1 more source
Empirical Study of Transactional Management for Persistent Memory
IEEE Non-Volatile Memory System and Applications Symposium, 2018Emerging Non-Volatile Memories (NVMs) possess unique features including byte-addressability, non-volatility and DRAM-like performance, while consistency and persistency are the two main concerns when using NVM.
H. Shu +5 more
semanticscholar +1 more source
Visualizing transactional memory
Proceedings of the 21st international conference on Parallel architectures and compilation techniques, 2012This paper presents TMProf, a transactional memory (TM) profiler, based on three visualization principles. These principles are (i) the precise graphical representation of transaction interactions including cross-correlated information and source code, (ii) visualized soft real-time playback of concurrently executing transactions, and (iii) dynamic ...
Justin E. Gottschlich +3 more
openaire +1 more source
Composable memory transactions
Communications of the ACM, 2005Writing concurrent programs is notoriously difficult and is of increasing practical importance. A particular source of concern is that even correctly implemented concurrency ions cannot be composed together to form larger ions. In this paper we present a concurrency model, based on transactional memory, that offers far richer composition. All the usual
Tim Harris +3 more
openaire +1 more source