If the ultimate aim of a computing network is resource sharing, then the human component as well as the technical component of networking must be fully investigated to achieve this goal. This research is a first step toward assisting …
Sandra A. Mamrak
Pages 461-468
This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to …
Manfred Ruschitzka, R. S. Fabry
Pages 469-477
In order for the nodes of a distributed computer network to communicate, each node must have information about the network's topology. Since nodes and links sometimes crash, a scheme is needed to update this information. One
…
William D. Tajibnapis
Pages 477-485
This paper describes a system for full-duplex communication between a time-shared computer and its terminals. The system consists of a communications computer directly connected to the time-shared system, a number of small remote …
Paul G. Heckel, Butler W. Lampson
Pages 486-494
SITAR, a low-cost interactive text handling and text analysis system for nontechnical users, is in many ways comparable to interactive bibliographical search and retrieval systems, but has several additional features. It is implemented …
Ben Ross Schneider, Reid M. Watts
Pages 495-499
In the monitor concept, as proposed by Brinch Hansen and Hoare, event queues are used for synchronization. This paper describes another synchronizing primitive which is nearly as expressive as the conditional wait, but can be …
J. L. W. Kessels
Pages 500-503
ertification mechanism for verifying the secure flow of information through a program. Because it exploits the properties of a lattice structure among security classes, the procedure is sufficiently simple that it can easily …
Dorothy E. Denning, Peter J. Denning
Pages 504-513
This paper discusses techniques which enable automatic storage reclamation overhead to be partially shifted to compile time. The paper assumes a transaction oriented collection scheme, as proposed by Deutsch and Bobrow, the necessary …
Jeffrey M. Barth
Pages 513-518
Lucid is a formal system in which programs can be written and proofs of programs carried out. The proofs are particularly easy to follow and straightforward to produce because the statements in a Lucid program are simply axioms …
E. A. Ashcroft, W. W. Wadge
Pages 519-526
J. Nevil Brownlee
Pages 527-529
Robert L. Ashenhurst
Page 534
Robert L. Ashenhurst
Pages 459-460
