June 1975 - Vol. 18 No. 6
Features
Algorithm 492: Generation of all the cycles of a graph from a set of basic cycles [H]
The PL/I procedure CYCLE_GENERATOR is an implementation of Gibbs' algorithm [1] for finding all the cycles in a graph from a set of basic cycles.
Illumination for computer generated pictures
The quality of computer generated images of three-dimensional scenes depends on the shading technique used to paint the objects on the cathode-ray tube screen. The…
A cost oriented algorithm for data set allocation in storage hierarchies
Data set allocation in today's multilevel storage systems is usually based on qualitative, ad hoc decisions. While it would be desirable to obtain an optimal solution to…
This paper compares a new method of simulation organization, called the significant event method, with an old one, called the clock pulse method, using as examples two…
An efficient arrangement for interpretive code is described. It is related to Bell's notion of threaded code but requires less space and is more amenable to machine…
A simplified recombination scheme for the Fibonacci buddy system
A simplified recombination scheme for the Fibonacci buddy system which requires neither tables nor repetitive calculations and uses only two additional bits per buffer is…
Efficient string matching: an aid to bibliographic search
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of…
A linear space algorithm for computing maximal common subsequences
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in…
Addition in an arbitrary base without radix conversion
hnique; using it, one may add and subtract numbers represented in any radix, including a mixed radix, and stored one digit per byte in bytes of sufficient size. Radix…
Improved event-scanning mechanisms for discrete event simulation
Simulation models of large, complex “real-world” applications have occasionally earned the reputation of eating up hours of computer time. This problem may be…