Sciweavers

443 search results - page 43 / 89
» Relations in Concurrency
Sort
View
SIGSOFT
2008
ACM
14 years 9 months ago
Modular verification of web services using efficient symbolic encoding and summarization
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
Fang Yu, Chao Wang, Aarti Gupta, Tevfik Bultan
VLDB
2007
ACM
144views Database» more  VLDB 2007»
14 years 9 months ago
Cooperative Scans: Dynamic Bandwidth Sharing in a DBMS
This paper analyzes the performance of concurrent (index) scan operations in both record (NSM/PAX) and column (DSM) disk storage models and shows that existing scheduling policies...
Marcin Zukowski, Sándor Héman, Niels...
PPOPP
2010
ACM
14 years 6 months ago
Leveraging parallel nesting in transactional memory
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
João Barreto, Aleksandar Dragojevic, Paulo ...
POPL
2009
ACM
14 years 3 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...
DNIS
2007
Springer
114views Database» more  DNIS 2007»
14 years 3 months ago
Improving the Performance of Read-Only Transactions Through Speculation
A read-only transaction (ROT) does not modify any data. The main issues regarding processing ROTs are correctness, data currency and performance. Two-phase Locking (2PL) protocol i...
Thirumalaisamy Ragunathan, P. Krishna Reddy