Sciweavers

2703 search results - page 24 / 541
» Optimizing memory transactions
Sort
View
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 8 months ago
Approximate Frequency Counts over Data Streams
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
Gurmeet Singh Manku, Rajeev Motwani
HOTOS
2007
IEEE
14 years 15 days ago
Is the Optimism in Optimistic Concurrency Warranted?
Optimistic synchronization allows concurrent execution of critical sections while performing dynamic conflict detection and recovery. Optimistic synchronization will increase perf...
Donald E. Porter, Owen S. Hofmann, Emmett Witchel
IPPS
2010
IEEE
13 years 5 months ago
Clustering JVMs with software transactional memory support
Affordable transparent clustering solutions to scale non-HPC applications on commodity clusters (such as Terracotta) are emerging for Java Virtual Machines (JVMs). Working in this ...
Christos Kotselidis, Mikel Luján, Mohammad ...
ASPLOS
2006
ACM
14 years 2 months ago
Tradeoffs in transactional memory virtualization
For transactional memory (TM) to achieve widespread acceptance, transactions should not be limited to the physical resources of any specific hardware implementation. TM systems s...
JaeWoong Chung, Chi Cao Minh, Austen McDonald, Tra...
PPOPP
2006
ACM
14 years 2 months ago
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hu...