Optimal implementation of conjunctive queries in relational data bases
It is shown that while answering conjunctive queries is NP complete (general queries are PSPACE complete), one can find an implementation that is within a constant of optimal.
Recoverability of Communication Protocols - Implications of a Theoretical Study
The time-Petri net (TPN) appears to be a suitable model for the study of practical recoverable processes and several practical communication protocols are formally designed and analyzed using this new model.
A study of the recoverability of computing systems.
- P. Merlin
- Computer Science
A Failsafe Distributed Routing Protocol
The algorithm can be employed in message as well as circuit switching networks, uses distributed computation, provides routing tables that are loop-free for each destination at all times, adapts to changes in network flows, and is completely failsafe.
On the Construction of Submodule Specifications and Communication Protocols
A new method for the construction of submodule specifications is described which defines the specification of the additional submodule in the general case where module specifications are given in terms of sets of possible execution sequences, and interaction occurs when several modules participate in the execution of an atomic interaction.
A Parallel Mechanism for Detecting Curves in Pictures
This correspondence shows how this method can be used to detect any given curve in a specific orientation and can be easily implemented and efficiently implemented in a parallel machine.
Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock
The proposed deadlock avoidance mechanism works for any network topology and any finite routing algorithm and increases the efficiency of buffer use.
Deadlock Avoidance in Store-And-Forward Networks
Specification and Validation of Protocols
- P. Merlin
- Computer ScienceIEEE Transactions on Communications
- 1 November 1979
The "topology" of a protocol is defined, and protocols that are intended to work in a variety of configurations, as well as configurations which may change in time (i.e. "evolving topologies").
Deadlock Avoidance in Store-and-Forward Networks - II: Other Deadlock Types
The solution presented here has the novel features of not requiring preallocation of reassembly buffers before transmission of multiple packets of a multipacket message, and not requiring dedication of buffer space at intermediate nodes for individual messages.