Sciweavers

365 search results - page 42 / 73
» Types for Safe Locking
Sort
View
POPL
1989
ACM
14 years 28 days ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
14 years 1 months 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
ICTAC
2005
Springer
14 years 2 months ago
Finding Resource Bounds in the Presence of Explicit Deallocation
Abstract. A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from st...
Hoang Truong, Marc Bezem
SCP
2008
89views more  SCP 2008»
13 years 8 months ago
A challenge for atomicity verification
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...
Wim H. Hesselink
PC
2012
223views Management» more  PC 2012»
12 years 4 months ago
Using shared arrays in message-driven parallel programs
This paper describes a safe and efficient combination of the object-based message-driven execution and shared array parallel programming models. In particular, we demonstrate how ...
Phil Miller, Aaron Becker, Laxmikant V. Kalé...