Herbert R. J. Grosch
Page 368
McFarlan and Nolan have made a strong case for adding a course on information systems administration to the 13 courses proposed by the ACM Curriculum Committee on Computer Education for Management for Graduate Professional Programs …
S. D. Conte, M. H. Halstead
Pages 369-370
Two formal models for parallel computation are presented: an abstract conceptual model and a parallel-program model. The former model does not distinguish between control and data states. The latter model includes the capability …
Robert M. Keller
Pages 371-384
This paper describes the symbolic execution of programs. Instead of supplying the normal inputs to a program (e.g. numbers) one supplies symbols representing arbitrary values. The execution proceeds as in a normal execution except …
James C. King
Pages 385-394
Ethernet is a branching broadcast communication system for carrying digital data packets among locally distributed computing stations. The packet transport mechanism provided by Ethernet has been used to build systems which can …
Robert M. Metcalfe, David R. Boggs
Pages 395-404
Decision tables can be used as an effective tool during an interview to record the logic of processes to be automated. The result of such an interview is not a structure of complete decision tables but rather sets of decision …
Cheng-Wen Cheng, Jonas Rabin
Pages 404-406
This paper describes a method of generating gamma variates that appears to be less costly than Wallace's recently suggested method. For large shape parameter
&agr;; the cost of computation is proportional to √
&agr;, whereas Wallace's …
George S. Fishman
Pages 407-409
This paper presents a new data structure, called a compressed trie or C-trie, to be used in information retrieval systems. It has the same underlying m-ary tree structure as a trie, where m is a parameter of the trie, but whereas …
Kurt Maly
Pages 409-415
A generalization of the buddy system for storage allocation is described. The set of permitted block sizes {
SIZEi}
ni=0 must satisfy the condition
SIZEi =
SIZEi-1 +
SIZEi-k(i) where
k may be any meaningful integral-valued function …
Warren Burton
Pages 416-417
I read with great interest F.P. Wyman's paper “Improved Event-Scanning Mechanisms for Discrete Event Simulation” [10] which, I found, makes a careful study of some techniques for event-list scanning.
Gaston H. Gonnet
Pages 417-418
Pages 422-424
