• Publications
  • Influence
Parallelism in random access machines
A model of computation based on random access machines operating in parallel and sharing a common memory is presented and can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines.
The Directed Subgraph Homeomorphism Problem
The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem
Disk scheduling in a multimedia I/O system
A new scheduling algorithm is proposed, SCAN-EDF, that combines the features of SCAN type of seek optimizing algorithm with an Earliest Deadline First (EDF) type of real-time scheduling algorithm.
The Complexity of Parallel Computations
This thesis describes an algorithm for the off-line MIN that organizes its computation in the form of a complete binary tree that relies on redundancy in its representation of the input graph, and introduces three techniques that permit the design of parallel algorithms that are efficient in terms of both their time and processor requirements.
I/O issues in a multimedia system
This work restricts itself to the support provided at the server, with special emphasis on two service phases: disk scheduling and SCSI bus contention, and analyze how trade-offs that involve buffer space affect the performance of scheduling policies.
Experience with transactions in QuickSilver
Examples of how transactions are used in QuickSilver and measurements of their use demonstrate that the transaction mechanism provides an efficient and powerful means for solving many of the problems introduced by operating system extensibility and distribution.
Implementing Atomicity in Two Systems: Techniques, Tradeoffs, and Experience
It is demonstrated that the support of atomicity with high performance requires a variety of techniques carefully chosen to balance the amount of data logged, the level of concurrency allowed, and the mutual consistency requirements of sets of objects.
QuickSilver distributed file services: an architecture for horizontal growth
  • L. Cabrera, J. Wyllie
  • Computer Science
    [] Proceedings. 2nd IEEE Conference on Computer…
  • 7 March 1988
An architecture is presented for a file service capable of supporting a very large number of users. It provides each user with a lifetime involvement with the file service while giving the appearance