{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:06:19Z","timestamp":1699833979393},"reference-count":9,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":9249,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1981,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A new marking algorithm for garbage collection is presented. Although the method is a variation of the usual simple stacking algorithm, in practice this algorithm has quite improved both in stack space and processing time. One significant modification is to stack a node only when both the sublists are unmarked. The other innovation is a \u2018stacked\u2010node\u2010checking\u2019 method invoked after each stack\u2010overflow. With this method, a number of unnecessary nodes are eliminated, the stack is compacted, and the marking process can resume using the generated space in the stack. This algorithm has been used for LISP1.9 garbage collection for years, and succeeded in showing good figures.<\/jats:p>","DOI":"10.1002\/spe.4380110703","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:12:15Z","timestamp":1163765535000},"page":"671-682","source":"Crossref","is-referenced-by-count":0,"title":["A new fast and safe marking algorithm"],"prefix":"10.1002","volume":"11","author":[{"given":"Toshiaki","family":"Kurokawa","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Fundamental algorithms, The Art of Computer Programming 1","author":"Knuth D. E.","year":"1968"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/363534.363554"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009079"},{"issue":"11","key":"e_1_2_1_5_2","first-page":"1056","article-title":"LISP1.9 Programming System","volume":"17","author":"Kurokawa T.","year":"1976","journal-title":"Journal of Information Processing Society in Japan"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380080305"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/360666.360669"},{"key":"e_1_2_1_8_2","unstructured":"T.Kurokawa \u2018New marking algorithms for garbage collection\u2019 Proc. of 2nd USA\u2010JAPAN Computer Conference(Aug1975)."},{"key":"e_1_2_1_9_2","unstructured":"H.Stoyan Private communications (Jan.1979)."},{"key":"e_1_2_1_10_2","unstructured":"A. C.Hearn REDUCE 2 User's Manual UCP\u201019 Univeristy of Utah Mar.1973."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380110703","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380110703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:39:50Z","timestamp":1699789190000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380110703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,7]]},"references-count":9,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1981,7]]}},"alternative-id":["10.1002\/spe.4380110703"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380110703","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,7]]}}}