Sciweavers

1075 search results - page 46 / 215
» Parallel Programming with Transactional Memory
Sort
View
ASPDAC
2006
ACM
109views Hardware» more  ASPDAC 2006»
15 years 6 months ago
Hardware debugging method based on signal transitions and transactions
- This paper proposes a hardware design debugging method, Transition and Transaction Tracer (TTT), which probes and records the signals of interest for a long time, hours, days, or...
Nobuyuki Ohba, Kohji Takano
PPOPP
2010
ACM
15 years 11 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
PDCAT
2005
Springer
15 years 8 months ago
Performance Comparison between VOPP and MPI
View-Oriented Parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into v...
Zhiyi Huang, Martin K. Purvis, Paul Werstein
116
Voted
MIDDLEWARE
2001
Springer
15 years 6 months ago
The CORBA Activity Service Framework for Supporting Extended Transactions
Although it has long been realised that ACID transactions by themselves are not adequate for structuring long-lived applications and much research work has been done on developing...
Iain Houston, Mark C. Little, Ian Robinson, Santos...
PPOPP
1997
ACM
15 years 6 months ago
Shared Memory Performance Profiling
This paper describes a new approach to finding performance bottlenecks in shared-memory parallel programs and its embodiment in the Paradyn Parallel Performance Tools running with...
Zhichen Xu, James R. Larus, Barton P. Miller