This paper reviews the current state of programming language standards activities with respect to the anomalies which exist between the various published and proposed standards for Fortran, Cobol, PL/I, and Basic. Proposals are …
John A. N. Lee
Pages 788-794
Two families of probability distributions were needed for use by a virtual memory simulation model: headway between page fault distributions, and working set size distributions. All members of both families can be derived from …
Rollins Turner, Bill Strecker
Pages 795-798
Certain defects, such as jagged edges and disappearing detail, have long been an annoyance in digitally generated shaded images. Although increasing the resolution or defocusing the display can attenuate them, an understanding …
Franklin C. Crow
Pages 799-805
The problem of sharing data among asynchronous processes is considered. It is assumed that only one process at a time can modify the data, but concurrent reading and writing is permitted. Two general theorems are proved, and
…
Leslie Lamport
Pages 806-811
This paper reports simulation data showing that, in dynamic memory allocation, the average free-to-allocated-block ratio can differ considerably and in both directions from the predictions of the 50 percent rule. A new derivation …
John E. Shore
Pages 812-820
G. C. Stockman, A. K. Agrawala
Pages 820-822
The population of programming languages is steadily growing, and there is no end of this growth in sight. Many language definitions appear in journals, many are found in technical reports, and perhaps an even greater number remains …
Niklaus Wirth
Pages 822-823
Earlier it was shown by the present author [1] that among the classical algorithms for the generation of permutation sequences, only the Trotter-Johnson algorithm [2, 3] has the property that the reflection of any permutation …
Mohit Kumar Roy
Page 823
The classical fixedpoint approach toward recursive programs suggests choosing the “least defined fixedpoint” as the most appropriate solution to a recursive program. A new approach is described which introduces an “optimal fixedpoint …
Zohar Manna, Adi Shamir
Pages 824-831
Application development today is too labor-intensive. In recent years, very high-level languages have been increasingly explored as a solution to this problem. The Business Definition Language (BDL) is such a language, one aimed …
Michael Hammer, W. Gerry Howe, Vincent J. Kruskal, Irving Wladawsky
Pages 832-840
A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of identifiers, two methods are presented for building, in a mechanical way, perfect hashing functions …
Renzo Sprugnoli
Pages 841-850
A simple algorithm which uses an indexed temporary table to perform reduction of operator strength in strongly connected regions is presented. Several extensions, including linear function test replacement, are discussed. These …
John Cocke, Ken Kennedy
Pages 850-856
A new technique of program transformation, called “recursion introduction,” is described and applied to two algorithms which solve pattern matching problems. By using recursion introduction, algorithms which manipulate a stack …
R. S. Bird
Pages 856-863
e of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation …
Norman R. Nielsen
Pages 864-873
Sequences of character strings with an order relation imposed between sequences are considered. An encoding scheme is described which produces a single, order-preserving string from a sequence of strings. The original sequence …
Michael W. Blasgen, Richard G. Casey, Kapali P. Eswaran
Pages 874-878
The file allocation problem — i.e. the problem of finding the optimal set of network sites at which to locate copies of a file — is known to be, in general, polynomial complete. Heuristics and other aids to finding optimal, or …
Enrique Grapa, Geneva G. Belford
Pages 878-882
Robert L. Ashenhurst
Pages 888-890
M. Stuart Lynn
Pages 783-784
