Sciweavers

429 search results - page 76 / 86
» Transactional memory
Sort
View
HOTOS
2007
IEEE
14 years 1 months ago
Automatic Mutual Exclusion
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...
Michael Isard, Andrew Birrell
HOTOS
2007
IEEE
14 years 1 months 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
EDBT
2008
ACM
144views Database» more  EDBT 2008»
14 years 10 months ago
BI batch manager: a system for managing batch workloads on enterprise data-warehouses
Modern enterprise data warehouses have complex workloads that are notoriously difficult to manage. An important problem in workload management is to run these complex workloads `o...
Abhay Mehta, Chetan Gupta, Umeshwar Dayal
ASPLOS
2012
ACM
12 years 5 months ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han