{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:19:58Z","timestamp":1740028798190,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008521"},{"type":"electronic","value":"9783540365693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36569-9_44","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:05Z","timestamp":1269897125000},"page":"650-663","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Multi-processor Architecture for Parallel Cyclic Reference Counting"],"prefix":"10.1007","author":[{"given":"Rafael Dueire","family":"Lins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"44_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Concurrent Cycle Collection in Reference Counted Systems","author":"D.F. Bacon","year":"2001","unstructured":"D.F. Bacon and V.T. Rajan. Concurrent Cycle Collection in Reference Counted Systems, Proceedings of European Conference on Object-Oriented Programming, June, 2001, Springer Verlag, LNCS vol 2072."},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"D.F. Bacon, C.R. Attanasio, H.B. Lee, R.T. Rajan and S. Smith. Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector, Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, June, 2001 (SIGPLAN Not. 36,5).","DOI":"10.1145\/378795.378819"},{"issue":"3","key":"44_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/579.587","volume":"6","author":"M. Ben-Ari","year":"1984","unstructured":"M. Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions on Programming Languages and Systems, 6(3):333\u2013344, July 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"G. Blelloch and P. Cheng, On Bonding Time and Space for Multiprocessor Garbage Collection. In Proc. of ACM SIGPLAN Conference on Programming Languages Design and Architecture, March 1999.","DOI":"10.1145\/301618.301648"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"D.G. Bobrow, Managing reentrant structures using reference counts, ACM Trans. On Prog. Languages and Systems 2 (3) (1980).","DOI":"10.1145\/357103.357104"},{"issue":"12","key":"44_CR6","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1145\/367487.367501","volume":"3","author":"G.E. Collins","year":"1960","unstructured":"G.E. Collins, A method for overlapping and erasure of lists, Comm. of the ACM, 3(12):655\u2013657, Dec.1960.","journal-title":"Comm. of the ACM"},{"issue":"11","key":"44_CR7","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1145\/359642.359655","volume":"21","author":"E.W. Dijkstra","year":"1978","unstructured":"E.W. Dijkstra, L. Lamport, A.J. Martin, C.S. Scholten & E.M.F. Steffens. On-the-fly garbage collection: an exercise in cooperation. Communications of ACM, 21(11):966\u2013975, November 1978.","journal-title":"Communications of ACM"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Kakuta, Nakamura and Iida, Information Proc. Letters, 23(1):33\u201337, 1986..H.T.Kung and S.W.Song. An efficient parallel garbage collection system and its correctness proof. In IEEE Symposium on Foundations of Computer Science, pages 120\u2014131. IEEE, 1977.","DOI":"10.1109\/SFCS.1977.5"},{"key":"44_CR9","unstructured":"L. Lamport. Garbage collection with multiple processes: an exercise in parallelism. In Proc. of IEEE Conference on Parallel Processing, pages 50\u201354. IEEE, 1976."},{"issue":"12","key":"44_CR10","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/359897.359903","volume":"20","author":"D. Gries","year":"1977","unstructured":"D. Gries. An exercise in proving parallel programs correct. Communications of ACM, 20(12):921\u2013930, December 1977.","journal-title":"Communications of ACM"},{"key":"44_CR11","unstructured":"R.E. Jones and R.D. Lins. Garbage Collection Algorithms for Dynamic Memory Management, John Wiley & Sons, 1996. (Revised edition in 1999)."},{"key":"44_CR12","first-page":"31.35","volume":"34","author":"R.D. Lins","year":"1991","unstructured":"R.D. Lins. A shared memory architecture for parallel cyclic reference counting, Microprocessing and microprogramming, 34:31.35, Sep. 1991.","journal-title":"Microprocessing and microprogramming"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0165-6074(92)90369-I","volume":"35","author":"R.D. Lins","year":"1992","unstructured":"R.D. Lins. A multi-processor shared memory architecture for parallel cyclic reference counting, Microprocessing and microprogramming, 35:563\u2013568, Sep. 1992.","journal-title":"Microprocessing and microprogramming"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(92)90088-D","volume":"44","author":"R.D. Lins","year":"1992","unstructured":"R.D. Lins. Cyclic Reference counting with lazy mark-scan, IPL 44(1992) 215\u2013220, Dec. 1992.","journal-title":"IPL"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0020-0190(93)90190-K","volume":"46","author":"R.D. Lins","year":"1993","unstructured":"R.D. Lins. Generational cyclic reference counting, IPL 46(1993) 19\u201320, 1993.","journal-title":"IPL"},{"issue":"3","key":"44_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(01)00328-3","volume":"83","author":"R.D. Lins","year":"2002","unstructured":"R.D. Lins. An Efficient Algorithm for Cyclic Reference Counting, Information Processing Letters, vol 83 (3), 145\u2013150, North Holland, August 2002.","journal-title":"Information Processing Letters"},{"key":"44_CR17","unstructured":"R.D. Lins. Garbage Collection in Shared Memory Architectures, in preparattiion. R.D.Lins and R.E.Jones, Cyclic weighted reference counting, in K. Boyanov (ed.), Proc. of Intern. Workshop on Parallel and Distributed Processing, NH, May 1993."},{"issue":"9","key":"44_CR18","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/367593.367649","volume":"6","author":"J.H. McBeth","year":"1963","unstructured":"J.H. McBeth, On the reference counter method, Comm. of the ACM, 6(9):575, Sep. 1963.","journal-title":"Comm. of the ACM"},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(90)90226-N","volume":"34","author":"A.D. Martinez","year":"1990","unstructured":"A.D. Martinez, R. Wachenchauzer and R.D. Lins. Cyclic reference counting with local mark-scan, IPL 34(1990) 31\u201335, North Holland, 1990.","journal-title":"IPL"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"F.J. Pollack, G.W. Cox, D.W. Hammerstein, K.C. Kahn, K.K. Lai, and J.R. Rattner. Supporting Ada memory management in the iAPX-432, Proceedings of the Symposium on Architectural Support for Programming Languages and Operating Systems, pages 117\u2013131. SIGPLAN Not. (ACM) 17,4, 1982.","DOI":"10.1145\/960120.801835"},{"issue":"09","key":"44_CR21","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1145\/361002.361005","volume":"18","author":"G.L. Steele","year":"1975","unstructured":"G.L. Steele. Multiprocessing compactifying garbage collection. Communications of ACM, 18(09):495\u2013508, September 1975.","journal-title":"Communications of ACM"},{"key":"44_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-15975-4_43","volume-title":"Design for a multiprocessing heap with on-board reference counting","author":"D.S. Wise","year":"1985","unstructured":"D.S. Wise. Design for a multiprocessing heap with on-board reference counting, In J.P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, volume LNCS 201, pages 289\u2013304. Springer-Verlag, 1985."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science \u2014 VECPAR 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36569-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:12:10Z","timestamp":1739992330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36569-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008521","9783540365693"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36569-9_44","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}