Sciweavers

36 search results - page 6 / 8
» Composite Abortable Locks
Sort
View
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
14 years 7 days ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden
VLDB
2001
ACM
93views Database» more  VLDB 2001»
13 years 12 months ago
Transaction Timestamping in (Temporal) Databases
Many database applications need accountability and trace-ability that necessitate retaining previous database states. For a transaction-time database supporting this, the choice o...
Christian S. Jensen, David B. Lomet
PLDI
2009
ACM
14 years 2 days ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
RTSS
2008
IEEE
14 years 1 months ago
Predictable Interrupt Management and Scheduling in the Composite Component-Based System
This paper presents the design of user-level scheduling hierarchies in the Composite component-based system. The motivation for this is centered around the design of a system that...
Gabriel Parmer, Richard West
CORR
2011
Springer
150views Education» more  CORR 2011»
13 years 2 months ago
Program Optimization Based Pointer Analysis and Live Stack-Heap Analysis
In this paper, we present type systems for flow-sensitive pointer analysis, live stack-heap (variables) analysis, and program optimization. The type system for live stack-heap ana...
Mohamed A. El-Zawawy