A. B. Kahn
Abstract
Topological Sorting is a procedure required for many problems involving analysis of networks. An example of one such problem is PERT. The present paper presents a very general method for obtaining topological order. It permits treatment of larger networks than can be handled on present procedures and achieves this with greater efficiency. Although the procedure can be adapted to any machine, it is discussed in terms of the 7090. A PERT network of 30,000 activities can be ordered in less than one hour of machine time.
The method was developed as a byproduct of procedure needed by Westinghouse, Baltimore. It has not been programmed and at present there are no plans to implement it. In regard to the techniques described, Westinghouse's present and anticipated needs are completely served by the Lockheed program, which is in current use.
- 1 Anonymous (1958), Summary Report, Phases 1 and 2, Program Evaluation Research Task. U. S. Government Printing Office, Washington, D.C.Google Scholar
- 2 D. J. LASSER (1961), Topological ordering of a list of randomlynumbered elements of a network. Comm. ACM 4, 12 (1961). Google ScholarDigital Library
Recommendations
Sorting networks: To the end and back again
AbstractNew properties of the front and back ends of sorting networks are studied, illustrating their utility when searching for bounds on optimal networks. Search focuses first on the “out-sides” of the network and then on the inner part. ...
Highlights- Faster sorting networks for 17, 19, and 20 inputs.
- 10 parallel steps are ...
Optimal-depth sorting networks
We prove depth optimality of sorting networks from "The Art of Computer Programming".Sorting networks posses symmetry that can be used to generate a few representatives.These representatives can be efficiently encoded using regular expressions.We ...
Reactive sorting networks
REBLS 2020: Proceedings of the 7th ACM SIGPLAN International Workshop on Reactive and Event-Based Languages and SystemsSorting is a central problem in computer science and one of the key components of many applications. To the best of our knowledge, no reactive programming implementation of sorting algorithms has ever been presented.
In this paper we present reactive ...
Comments