{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T04:48:02Z","timestamp":1683780482388},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02577871","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T23:32:55Z","timestamp":1174606375000},"page":"617-644","source":"Crossref","is-referenced-by-count":0,"title":["Parallel-access memory management using fast-fits"],"prefix":"10.1007","volume":"22","author":[{"given":"Theodore","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"BF02577871_CR1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0611028","volume":"11","author":"T. A. Davis","year":"1990","unstructured":"T. A. Davis and P. C. Yew, A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization,SIAM J. Matrix Anal. Appl. 11(3):383\u2013402 (1990).","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"BF02577871_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0377-0427(89)90368-3","volume":"27","author":"I. S. Duff","year":"1989","unstructured":"I. S. Duff, Multiprocessing a sparse matrix code on the Alliant FX\/8,J. Comp. Appl. Math. 27:229\u2013239 (1989).","journal-title":"J. Comp. Appl. Math."},{"key":"BF02577871_CR3","unstructured":"F. J. Roeber, Raytheon Submarine Signals Division, Personal communication (1991)."},{"key":"BF02577871_CR4","unstructured":"B. Bigler, S. Allan, and R. Olderhoeft, Parallel dynamic storage allocation,Proc. Int'l. Conf. on Parallel Processing, pp. 272\u2013275 (1985)."},{"key":"BF02577871_CR5","volume-title":"Direct Methods for Sparse Matrices","author":"I. S. Duff","year":"1986","unstructured":"I. S. Duff, A. M. Erisman, and J. K. Reid,Direct Methods for Sparse Matrices, Oxford University Press, Oxford (1986)."},{"key":"BF02577871_CR6","doi-asserted-by":"crossref","unstructured":"D. Grunwald, B. Zorn, and R. Henderson, Improving the cache locality of memory allocation,SIGPLAN Conf. on Programming Language Design and Implementation, pp. 177\u2013186 (1993).","DOI":"10.1145\/155090.155107"},{"issue":"2","key":"BF02577871_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/142181.142200","volume":"27","author":"B. Zorn","year":"1992","unstructured":"B. Zorn and D. Grunwald, Emperical measurements of six allocation-intensive C programs,ACM SIGPLAN Notices 27(2):71\u201380 (1992).","journal-title":"ACM SIGPLAN Notices"},{"key":"BF02577871_CR8","unstructured":"A. Gottlieb and J. Wilson, Parallelizing the usual buddy algorithm, Ultracomputer System Software Note 37, Courant Institute (1982)."},{"key":"BF02577871_CR9","unstructured":"T. Standish.Data Structures Techniques, Addison-Wesley (1980)."},{"issue":"4","key":"BF02577871_CR10","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1137\/0215082","volume":"15","author":"U. Manber","year":"1986","unstructured":"U. Manber, On maintaining dynamic information in a concurrent environment,SIAM Journal on Computing 15(4):1130\u20131142 (1986).","journal-title":"SIAM Journal on Computing"},{"key":"BF02577871_CR11","doi-asserted-by":"crossref","unstructured":"D. Kotz and C. S. Ellis, Evaluation of concurrent pools,Proc. Int'l. Conf. on Distrib. Comput. Syst., pp. 378\u2013385 (1989).","DOI":"10.1109\/ICDCS.1989.37968"},{"key":"BF02577871_CR12","unstructured":"S. J. Eggers and T. E. Jeremiassen, Eliminating false sharing,Proc. Int'l. Conf. on Parallel Processing, pp. 1377\u20131381 (1991)."},{"key":"BF02577871_CR13","unstructured":"C. S. Ellis and T. Olson, Concurrent dynamic storage allocation,Proc. Int'l. Conf. on Parallel Processing, pp. 502\u2013511 (1987)."},{"key":"BF02577871_CR14","unstructured":"D. Knuth,The Art of Computer Programming, Volume 1. Addison-Wesley (1968)."},{"issue":"1","key":"BF02577871_CR15","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1147\/sj.231.0044","volume":"23","author":"G. Bozman","year":"1984","unstructured":"G. Bozman, W. Buco, T. P. Daly, and W. H. Tetzlaff, Analysis of free storage algorithms\u2014revisited,IBM Systems Journal 23(1):44\u201364 (1984).","journal-title":"IBM Systems Journal"},{"issue":"6","key":"BF02577871_CR16","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/359605.359626","volume":"20","author":"J. L. Peterson","year":"1977","unstructured":"J. L. Peterson and T. A. Norman, Buddy systems,Comm. of the ACM 20(6):421\u2013431 (1977).","journal-title":"Comm. of the ACM"},{"key":"BF02577871_CR17","unstructured":"C. J. Stephenson, Fast fits: New methods for dynamic storage allocation,Proc. of the Ninth ACM Symp. of Oper. Syst. Principles, pp. 30\u201332 (1983)."},{"key":"BF02577871_CR18","series-title":"Technical report","volume-title":"Fast fits: New methods for dynamic storage allocation","author":"C. J. Stephenson","year":"1983","unstructured":"C. J. Stephenson, Fast fits: New methods for dynamic storage allocation, Technical report, IBM T. J. Watson Research Center, Yorktown Heights, New York (1983)."},{"key":"BF02577871_CR19","unstructured":"As noted in the SunOS 4.1.2 malloc man page."},{"key":"BF02577871_CR20","series-title":"Technical Report RC 9674","volume-title":"Parallel memory allocation using the fetch-and-add instruction","author":"H. Stone","year":"1982","unstructured":"H. Stone, Parallel memory allocation using the fetch-and-add instruction, Technical Report RC 9674, IBM T. J. Watson Research Center, Yorktown Heights, New York (1982)."},{"issue":"2","key":"BF02577871_CR21","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/69624.357206","volume":"5","author":"A. Gottlieb","year":"1983","unstructured":"A. Gottlieb, B. D. Lubachevsky, and L. Rudolph, Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors,ACM Trans. on Programming Languages and Systems 5(2):164\u2013189 (1983).","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"5","key":"BF02577871_CR22","first-page":"10","volume":"P","author":"R. Fod","year":"1988","unstructured":"R. Fod, Concurrent algorithms for real time memory management,IEEE Software P(5):10\u201323 (September 1988).","journal-title":"IEEE Software"},{"key":"BF02577871_CR23","unstructured":"A. Gottlieb and J. Wilson, Using the buddy system for concurrent memory allocation, Ultracomputer System Software Note 6, Courant Institute (1981)."},{"key":"BF02577871_CR24","unstructured":"J. Wilson, Operating System Data Structures for Shared-memory MIMD Machines with Fetch-and-add, PhD. thesis, NYU (1988)."},{"issue":"4","key":"BF02577871_CR25","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0129626492000544","volume":"2","author":"T. Johnson","year":"1992","unstructured":"T. Johnson and T. Davis, Parallel buddy memory management,Parallel Processing Letters 2(4):391\u2013398 (1992).","journal-title":"Parallel Processing Letters"},{"key":"BF02577871_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"R. Bayer and M. Schkolnick, Concurrency of operations on B-trees,Acta Informatica 9:1\u201321 (1977).","journal-title":"Acta Informatica"},{"key":"BF02577871_CR27","unstructured":"P. A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley (1987)."},{"issue":"4","key":"BF02577871_CR28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"J. Vuillemin, A unifying look at data structures,Commun. of the ACM 23(4):229\u2013239 (1980).","journal-title":"Commun. of the ACM"},{"key":"BF02577871_CR29","doi-asserted-by":"crossref","unstructured":"C. Aragon and R. Seidel, Randomized search trees,Proc. of the 30th Symp. on the Foundations of Computer Science, pp. 540\u2013545 (1989).","DOI":"10.1109\/SFCS.1989.63531"},{"key":"BF02577871_CR30","doi-asserted-by":"crossref","unstructured":"T. Johnson and D. Shasha, The performance of concurrent data structure algorithms,Trans. on Database Systems, pp. 51\u2013101 (March 1993).","DOI":"10.1145\/151284.151286"},{"key":"BF02577871_CR31","unstructured":"T. Johnson, A concurrent fast-fits memory manager. Technical Report TR91-009, available at anonymous ftp site ftp.cis.ufl.edu:\/cis\/tech-reports\/tr91\/tr91-009.ps.Z, University of Florida, Department of CIS, 1991."},{"issue":"1","key":"BF02577871_CR32","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/42201.42204","volume":"13","author":"D. Shasha","year":"1988","unstructured":"D. Shasha and N. Goodman, Concurrent search structure algorithms,ACM Trans. on Database Systems 13(1):53\u201390 (1988).","journal-title":"ACM Trans. on Database Systems"},{"issue":"3","key":"BF02577871_CR33","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"M. Herlihy and J. Wing, Linearizability: A. correctness condition for concurrent objects,ACM Trans. on Programming Languages and Systems 12(3):463\u2013492 (1990).","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"1","key":"BF02577871_CR34","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T. E. Anderson","year":"1990","unstructured":"T. E. Anderson, The performance of spin lock alternatives for shared memory multi-processors,IEEE Trans. on Parallel and Distrib. Syst. 1(1):6\u201316 (1990).","journal-title":"IEEE Trans. on Parallel and Distrib. Syst."},{"key":"BF02577871_CR35","doi-asserted-by":"crossref","unstructured":"R. R. Glenn, D. V. Pryor, J. M. Conroy, and T. Johnson, Characterizing memory hotspots in a shared memory MIMD machine,Supercomputing, pp. 554\u2013566, IEEE and ACM SIGARCH (1991).","DOI":"10.1145\/125826.126132"},{"key":"BF02577871_CR36","doi-asserted-by":"crossref","unstructured":"J. M. Mellor-Crummey and M. L. Scott, Synchronization without contention,Fourth Int'l. Conf. on Architect. Support for Programming Languages and Oper. Syst., pp. 269\u2013278 (1991).","DOI":"10.1145\/106974.106999"},{"key":"BF02577871_CR37","unstructured":"Kendall Square Research, 170 Tracer Lane, Waltham, Massachusetts 02154-1379,KSR1 Principles of Operation (1992)."},{"issue":"3","key":"BF02577871_CR38","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1137\/0905045","volume":"5","author":"I. S. Duff","year":"1984","unstructured":"I. S. Duff and J. K. Reid, The multifrontal solution of unsymmetric sets of linear equations,SIAM J. Sci. Statist. Comput. 5(3):633\u2013641 (1984).","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"BF02577871_CR39","unstructured":"T. A. Davis, A combined unifrontal\/multifrontal method for unsymmetric sparse matrices,Proc. of the Fifth SIAM Conf. on Applied Linear Algebra, Snowbird, Utah, pp. 413\u2013417 (1994)."},{"key":"BF02577871_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"J. J. Dongarra","year":"1990","unstructured":"J. J. Dongarra, J. Du Croz, I. S. Duff, and S. Hammarling, A set of level-3 basic linear algebra subprograms,ACM Trans. on Math. Software 16:1\u201317 (1990).","journal-title":"ACM Trans. on Math. Software"},{"key":"BF02577871_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","volume":"15","author":"I. S. Duff","year":"1989","unstructured":"I. S. Duff, R. G. Grimes, and J. G. Lewis, Sparse matrix test problems,ACM Trans. Math. Software 15:1\u201314 (1989).","journal-title":"ACM Trans. Math. Software"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02577871.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02577871\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02577871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T04:27:07Z","timestamp":1683779227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02577871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02577871"],"URL":"https:\/\/doi.org\/10.1007\/bf02577871","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}