Sciweavers

42 search results - page 3 / 9
» A Model of Dynamic Separation for Transactional Memory
Sort
View
IEEEPACT
2009
IEEE
13 years 3 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...
POPL
2009
ACM
14 years 6 months ago
Feedback-directed barrier optimization in a strongly isolated STM
Speed improvements in today's processors have largely been delivered in the form of multiple cores, increasing the importance of ions that ease parallel programming. Software...
Nathan Grasso Bronson, Christos Kozyrakis, Kunle O...
VEE
2010
ACM
218views Virtualization» more  VEE 2010»
14 years 15 days ago
Improving compiler-runtime separation with XIR
Intense research on virtual machines has highlighted the need for flexible software architectures that allow quick evaluation of new design and implementation techniques. The inte...
Ben Titzer, Thomas Würthinger, Doug Simon, Ma...
ESANN
2007
13 years 7 months ago
Three-dimensional self-organizing dynamical systems for discrete structures memorizing and retrieval
The synthesis concept for dynamical system with the memory of multiple states defined with the quaternion algebra usage is considered. The system memorizes numerous configurations ...
Alexander Yudashkin
WADS
2009
Springer
223views Algorithms» more  WADS 2009»
14 years 3 days ago
Fault Tolerant External Memory Algorithms
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
Gerth Stølting Brodal, Allan Grønlun...