Techniques for storage allocation algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Techniques for storage allocation algorithms

Full text

Pdf (709 KB)

Source

Communications of the ACM archive
Volume 4 , Issue 10 (October 1961) table of contents

Pages: 449 - 454

Year of Publication: 1961

ISSN:0001-0782

Author

J. E. Kelley, Jr.

Manchly Associates, Inc., Ft. Washington Industrial Park, PA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 17, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/366786.366806 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	CHURCHMAN, C. W.; ACKOEF, .Pt,. L.; AND ARNOFF, E. L. Introduction to Operations Research. John Wiley and Sons, inc., 1957.
	2	KUHN, H. W.; AND TUCKER, A. W. (Eds) Linear Inequalities and Related Systems. Princeton University Press, 1956.
	3	DANTZIG, G.B. Discrete variable extremum problems. Operations Res. 5 (1957), 161-310.
	4	----, Note on solving linear programs in integers. Naval Res. Log. Quart. 6 (1959) 75-76.
	5	GOMORY, R .E . An algorithm for integer solutions to linear prograins. Princeton-IBM Mathematics Research Report No. 1, Nov. 17, 1958.
	6	----, Outline of an algorithnl for integer solutions to linear programs. Bull. Amer. Math. Soc. 64 (1958) 275-278.
	7	----, All-integer integer programming algorithm. IBM Research Center, Yorktown Heights, N. Y., Jan. 29, 1960.
	8	Richard Ernest Bellman, Dynamic Programming, Dover Publications, Incorporated, 2003
	9	----, Notes on the theory of dynamic programming. IV--Maximization over discrete sets. Naval Res. Log. Quart. 3 (1956), 67-70.
	10	----, The theory of dynamic programming. In Modern Mathematics for the Engineer, McGraw-Hill Book Co., Inc., New York, 1956, pp. 243-278.
	11	E. F. Codd, Multiprogram scheduling: parts 1 and 2. introduction and theory, Communications of the ACM, v.3 n.6, p.347-350, June 1960 [doi>10.1145/367297.367317]
	12	HELLER, J. Some numerical experiments for an M X J flow shop and its decision theoretic aspects. Operations Res. 8 (1960), 178-184.
	13	GIFFLER, B.; AND THOMPSON, G. Algorithms for solving production scheduling problems. Operations Res. 8 (1960), 487-503.
	14	NEWELL, A.; SHAW, J. C.; AND SIMON, H.A. Empirical explorations of the logic theory machine. Proc. Western Joint Comput. Conf., Feb. 1957.
	15	SIMON, H. A.; AND NEWELL, A. Heuristic problem solving: the next advance in operations research. Operations Res. 6 (1958), 1-10.
	16	TONGE, F.M. A heuristic program for assembly line balancing. The RAND Corp., 1960. To be published.
	17	POLYA, G. How to Solve It. Princeton University Press, 1948.
	18	----, Mathematics and Plausible Reasoning (2 vols.). Princeton University Press, 1954.
	19	BERGE, CLAUDE. Theorie des Graphes et ses Applications. Dunod, Paris, 1958.
	20	DANTZIG, G. B.; AND HOFFMAN, A. J. Dilworth's theorem on partially ordered sets. In Linear Inequalities and Related Systems, Princeton University Press, 1956, pp. 207-214.
	21	FORD, L. R,., AND :FULKERSON, D. R. Maximal flow through a network. Canadian J. Math. 8 (1956), 399-404.
	22	----, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canadian J. Math. 9 (1957), 210-218.
	23	----, Network flows and systems of representatives. Canadian J. Math. 10 (1958), 78-84.
	24	----, Constructing maximal dynamic flows from static flows. Operations Res. 6 (1958), 419-433.
	25	FULKERSON, D.R. A network-flow feasibility theorem and combinatorial applications. Canadian J. Math. 11 (1959).
	26	KOENIG, D. Theorie der Graphen. Chelsea Publishing Co., New York, 1950.

CITED BY 2

	Jesse H. Katz, Optimizing bit-time computer simulation, Communications of the ACM, v.6 n.11, p.679-685, Nov. 1963
	Peter J. Denning, Virtual Memory, ACM Computing Surveys (CSUR), v.2 n.3, p.153-189, Sept. 1970