LCS Publications: Recent submissions
Now showing items 316-318 of 1152
-
Using Cycles and Scaling in Parallel Algorithms
(1989-08)We introduce the technique of decomposing an undirected graph by finding a maximal set of edge-disjoint cycles. We give a parallel algorithm to find this decomposition in O(log n) time on (m+ n)/log n processors. We ... -
ParaTran: A Transparent, Transaction Based Runtime Mechanism for Parallel Execution of Scheme
(1989-07)The number of applications requiring high speed symbolic computation and the performance requirements of these projects are both rapidly increasing. However, the computer science community's ability to produce high ... -
Optimistic Concurrency Control for Nested Distributed Transactions
(1989-06)Optimistic concurrency control techniques allow atomic transactions (or actions for short) to execute without synchronization, relying on commit-time validation to ensure serializability. Previous work in this area has ...
