References 1. Randell, B. A note on storage fragmentation and program segmentation. Comm. A C M 12, 7 (July 1969), 365-372. 2. Collins, G.O. Experience in automatic storage allocation. Comm. A C M 4, 10 (Oct. 1961), 436-440. 3. Knuth, D.E. The Art o f Computer Programming, Vol. I: Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968, Sect. 2.5. 4. Margolin, B.H., Parmalee, R.P., and Schatzoff, M. Analysis of free-storage algorithms. IBM S Y S T J . 4, (1971), 283-304. 5. Hirschberg, D.S. A class of dynamic memory allocation algorithms. Comm. A C M 16, 10 (Oct. 1973), 615-618. 6. Shen, K.K., and Peterson, J.L. A weighted buddy method for dynamic storage allocation. Comm. A C M 17, 10 (Oct. 1974), 558562; corrigendum Comm. A C M 18, 4 (April 1975), 202. 7. Shore, J.E. On the external storage fragmentation produced by first-fit and best-fit allocation strategies. Comm. A C M 18, 8 (Aug. 1975), 433-440. 8. Fenton, J.S., and Payne, D.W. Dynamic storage allocation of arbitrary sized segments. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 344-348. 9. Weinstock, C.B. Dynamic storage allocation techniques. Ph.D. Th., Carnegie Mellon U., Pittsburgh, Pa., April 1976. 10. Bays, C. A comparison of next-fit, first-fit, and best-fit. Comm. A C M 20, 3 (March 1977), 191-192. 11. Wolman, E. A fixed optimum cell-size for records of varying lengths. J. A C M 12, 1 (Jan. 1965), 53-70. 12. Gelenbe, E., Boekhorst, J.C.A., and Kessels, J.L.W. Minimizing wasted space in partitioned segmentation. Comm. A C M 16, 6 (June 1973), 343-349. 13. Purdom, P.W., and Stigler, S.M. Statistical properties of the buddy system. J. A C M 17, 4 (Oct. 1970), 683-697. 14. Betteridge, T. An analytic storage allocation model. Acta Informatica 4 (1974), 101-122. 15. Denning, P.J. Virtual memory. Computing Surveys 2, 3 (Sept. 1970), 153-189. 16. Platt, J.R. Strong inference. Science 146 (1964), 347-353.
[1]
David J. Farber,et al.
A Parallel Mechanism for Detecting Curves in Pictures
,
1975,
IEEE Transactions on Computers.
[2]
Jack Sklansky,et al.
Finding circles by an array of accumulators
,
1975,
Commun. ACM.
[3]
Paul Walton Purdom,et al.
Statistical Properties of the Buddy System
,
1970,
JACM.
[4]
John E. Shore.
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
,
1975,
CACM.
[5]
Jeffrey S. Fenton,et al.
Dynamic Storage Allocation of Arbitrary Sized Segments
,
1974,
IFIP Congress.
[6]
Richard O. Duda,et al.
Use of the Hough transformation to detect lines and curves in pictures
,
1972,
CACM.
[7]
Erol Gelenbe.
Minimizing wasted space in partitioned segmentation
,
1973,
CACM.
[8]
Thomas O. Binford,et al.
A corner finder for visual feedback
,
1973,
Comput. Graph. Image Process..
[9]
Azriel Rosenfeld,et al.
Picture Processing by Computer
,
1969,
CSUR.
[10]
Charles Burr Weinstock.
Dynamic storage allocation techniques.
,
1976
.