{"id":"https://openalex.org/W2041212364","doi":"https://doi.org/10.1145/1296907.1296928","title":"Mark-sweep or copying?","display_name":"Mark-sweep or copying?","publication_year":2007,"publication_date":"2007-10-21","ids":{"openalex":"https://openalex.org/W2041212364","doi":"https://doi.org/10.1145/1296907.1296928","mag":"2041212364"},"language":"en","primary_location":{"id":"doi:10.1145/1296907.1296928","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296928","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th international symposium on Memory management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024520227","display_name":"S. Stanchina","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sylvain Stanchina","raw_affiliation_strings":["University of Stuttgart, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036669476","display_name":"Matthias Meyer","orcid":"https://orcid.org/0000-0002-5121-5488"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Meyer","raw_affiliation_strings":["University of Stuttgart, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024520227"],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":2.5333,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.89114226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1998","issue":null,"first_page":"173","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8013311624526978},{"id":"https://openalex.org/keywords/copying","display_name":"Copying","score":0.7842801809310913},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.6192801594734192},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5384748578071594},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.4715587794780731},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.343269944190979},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.3302391469478607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32876449823379517},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24858957529067993},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.20505079627037048}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8013311624526978},{"id":"https://openalex.org/C2779151265","wikidata":"https://www.wikidata.org/wiki/Q1156791","display_name":"Copying","level":2,"score":0.7842801809310913},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.6192801594734192},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5384748578071594},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.4715587794780731},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.343269944190979},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.3302391469478607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32876449823379517},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24858957529067993},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.20505079627037048},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1296907.1296928","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296928","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th international symposium on Memory management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W203369619","https://openalex.org/W1985154153","https://openalex.org/W2043319140","https://openalex.org/W2046839064","https://openalex.org/W2058972142","https://openalex.org/W2060241714","https://openalex.org/W2073033774","https://openalex.org/W2079813853","https://openalex.org/W2080605748","https://openalex.org/W2102514162","https://openalex.org/W2116316682","https://openalex.org/W2120088534","https://openalex.org/W2145092757","https://openalex.org/W2148746214","https://openalex.org/W2158525816","https://openalex.org/W2161531345","https://openalex.org/W2163937626","https://openalex.org/W2168561902","https://openalex.org/W2170614426","https://openalex.org/W2172099608","https://openalex.org/W3005367838","https://openalex.org/W3023256115","https://openalex.org/W3083018334","https://openalex.org/W4239686243"],"related_works":["https://openalex.org/W1700460898","https://openalex.org/W1524351898","https://openalex.org/W4297378365","https://openalex.org/W2524496484","https://openalex.org/W1487406077","https://openalex.org/W2147299991","https://openalex.org/W1588734579","https://openalex.org/W4250131244","https://openalex.org/W2148255588","https://openalex.org/W2335513707"],"abstract_inverted_index":{"Copying":[0],"collectors":[1,49,65],"offer":[2],"a":[3,92,116,144],"number":[4],"of":[5,85,102,110,125,130],"advantages":[6],"over":[7],"their":[8],"mark-sweep":[9,111],"counterparts.":[10],"First,":[11],"they":[12,27,36],"do":[13,28],"not":[14,29],"have":[15],"to":[16],"deal":[17],"with":[18,106],"mark":[19,23],"stacks":[20],"and":[21,54,70,100],"potential":[22],"stack":[24],"overflows.":[25],"Second,":[26],"suffer":[30],"from":[31],"unpredictable":[32],"fragmentation":[33],"overheads":[34],"since":[35],"inherently":[37],"compact":[38],"the":[39,42,56,82,98,107,123,162,166],"heap.":[40],"Third,":[41],"tospace":[43],"invariant":[44],"maintained":[45],"by":[46],"many":[47],"copying":[48,64,104,146],"allows":[50],"for":[51,81,119,157],"incremental":[52],"compaction":[53],"provides":[55],"basisfor":[57],"efficient":[58],"real-time":[59,120,158],"implementations.":[60],"Unfortunately,":[61],"however,":[62],"standard":[63],"depend":[66],"on":[67,133],"two":[68],"semispaces":[69],"therefore":[71],"need":[72],"at":[73,161],"least":[74],"twice":[75],"as":[76,79],"much":[77],"memory":[78,108,155],"required":[80],"maximum":[83],"amount":[84],"live":[86],"data.In":[87],"this":[88],"paper,":[89],"we":[90,114],"introduce":[91],"novel":[93,140],"mark-compact":[94,141],"algorithm":[95,105,142],"that":[96,138],"combines":[97],"elegance":[99],"simplicity":[101],"Baker's":[103],"efficiency":[109],"algorithms.":[112],"Furthermore,":[113],"present":[115],"hardware-supported":[117],"implementation":[118],"applications":[121],"in":[122,148],"framework":[124],"an":[126,134],"object-based":[127],"RISC":[128],"architecture.Measurements":[129],"Java":[131],"programs":[132],"FPGA-based":[135],"prototype":[136],"show":[137],"our":[139],"outperforms":[143],"corresponding":[145],"collector":[147],"every":[149],"respect.":[150],"It":[151],"requires":[152],"far":[153],"less":[154],"space":[156],"behavior":[159],"and,":[160],"same":[163],"time,":[164],"reduces":[165],"overall":[167],"runtime":[168],"overhead":[169],"under":[170],"typical":[171],"operating":[172],"conditions.":[173]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}