Sciweavers

631 search results - page 58 / 127
» Composable memory transactions
Sort
View
ICPP
1999
IEEE
15 years 2 months ago
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
Jim Nilsson, Fredrik Dahlgren
DSD
2010
IEEE
153views Hardware» more  DSD 2010»
14 years 10 months ago
Simulation of High-Performance Memory Allocators
—Current general-purpose memory allocators do not provide sufficient speed or flexibility for modern highperformance applications. To optimize metrics like performance, memory us...
José Luis Risco-Martín, José ...
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
15 years 3 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don
FPL
2010
Springer
146views Hardware» more  FPL 2010»
14 years 7 months ago
Software Managed Distributed Memories in MPPAs
When utilizing reconfigurable hardware there are many applications that will require more memory than is available in a single hardware block. While FPGAs have tools and mechanisms...
Robin Panda, Jimmy Xu, Scott Hauck
PODC
2010
ACM
15 years 1 months ago
On maintaining multiple versions in STM
An effective way to reduce the number of aborts in software transactional memory (STM) is to keep multiple versions of transactional objects. In this paper, we study inherent prop...
Dmitri Perelman, Rui Fan, Idit Keidar