{"id":"https://openalex.org/W2139595886","doi":"https://doi.org/10.1145/1296907.1296919","title":"Allocation-phase aware thread scheduling policies to improve garbage collection performance","display_name":"Allocation-phase aware thread scheduling policies to improve garbage collection performance","publication_year":2007,"publication_date":"2007-10-21","ids":{"openalex":"https://openalex.org/W2139595886","doi":"https://doi.org/10.1145/1296907.1296919","mag":"2139595886"},"language":"en","primary_location":{"id":"doi:10.1145/1296907.1296919","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296919","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/A5017494974","display_name":"Feng Xian","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Feng Xian","raw_affiliation_strings":["University of Nebraska-Lincoln, Lincoln, NE"],"affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038574274","display_name":"Witawas Srisa\u2010an","orcid":"https://orcid.org/0000-0003-0021-5696"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Witawas Srisa-an","raw_affiliation_strings":["University of Nebraska-Lincoln, Lincoln, NE"],"affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054285749","display_name":"Hong Jiang","orcid":"https://orcid.org/0000-0002-1477-9751"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hong Jiang","raw_affiliation_strings":["University of Nebraska-Lincoln, Lincoln, NE"],"affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017494974"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":1.2666,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.81767571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"79","last_page":"90"},"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.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9739000201225281,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/garbage-collection","display_name":"Garbage collection","score":0.9090579748153687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.797743558883667},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.7669312953948975},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.5893722772598267},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5804946422576904},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5697507262229919},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5213567018508911},{"id":"https://openalex.org/keywords/turnaround-time","display_name":"Turnaround time","score":0.5034551024436951},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.45801013708114624},{"id":"https://openalex.org/keywords/manual-memory-management","display_name":"Manual memory management","score":0.4454371929168701},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4437374174594879},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.4162352979183197},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37669098377227783},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09845781326293945},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08755534887313843}],"concepts":[{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.9090579748153687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.797743558883667},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.7669312953948975},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.5893722772598267},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5804946422576904},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5697507262229919},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5213567018508911},{"id":"https://openalex.org/C176553487","wikidata":"https://www.wikidata.org/wiki/Q7855819","display_name":"Turnaround time","level":2,"score":0.5034551024436951},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.45801013708114624},{"id":"https://openalex.org/C82810778","wikidata":"https://www.wikidata.org/wiki/Q6752316","display_name":"Manual memory management","level":4,"score":0.4454371929168701},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4437374174594879},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.4162352979183197},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37669098377227783},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09845781326293945},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08755534887313843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1296907.1296919","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1296907.1296919","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":31,"referenced_works":["https://openalex.org/W1509600745","https://openalex.org/W1565407209","https://openalex.org/W1583464938","https://openalex.org/W1708205384","https://openalex.org/W1981993206","https://openalex.org/W1983274120","https://openalex.org/W2000387981","https://openalex.org/W2015121755","https://openalex.org/W2022886773","https://openalex.org/W2038141711","https://openalex.org/W2054687093","https://openalex.org/W2068583978","https://openalex.org/W2076602346","https://openalex.org/W2084263997","https://openalex.org/W2094449661","https://openalex.org/W2104098106","https://openalex.org/W2120556493","https://openalex.org/W2138716216","https://openalex.org/W2155917287","https://openalex.org/W2159608022","https://openalex.org/W2161719857","https://openalex.org/W2164976101","https://openalex.org/W2166091242","https://openalex.org/W2167756215","https://openalex.org/W2223702412","https://openalex.org/W4233852314","https://openalex.org/W4243242915","https://openalex.org/W4248852436","https://openalex.org/W4252120627","https://openalex.org/W6630656549","https://openalex.org/W6633840390"],"related_works":["https://openalex.org/W3022395790","https://openalex.org/W1588734579","https://openalex.org/W2042469414","https://openalex.org/W2904040114","https://openalex.org/W2142383914","https://openalex.org/W2013466772","https://openalex.org/W1487406077","https://openalex.org/W1524351898","https://openalex.org/W2524496484","https://openalex.org/W1993544047"],"abstract_inverted_index":{"Past":[0],"studies":[1],"have":[2,24,95],"shown":[3],"that":[4,77],"objects":[5,40],"are":[6,65],"created":[7],"and":[8,36,116,169,178],"then":[9],"die":[10,42],"in":[11,56,74,101,133,147],"phases.":[12,135],"Thus,":[13,86],"one":[14],"way":[15,76],"to":[16,23,29,34,41,54,97,122,131,157],"sustain":[17],"good":[18],"garbage":[19,45,88,144],"collection":[20,89,103,145],"efficiency":[21],"is":[22,52,90],"a":[25,75,148,158],"large":[26,57],"enough":[27],"heap":[28],"allow":[30],"many":[31],"allocation":[32,83,93,113],"phases":[33,84,94],"complete":[35],"most":[37,61,92],"of":[38,142,164],"the":[39,143,165,170],"before":[43],"invoking":[44],"collection.":[46],"However,":[47],"such":[48],"an":[49],"operating":[50],"environment":[51],"hard":[53],"maintain":[55],"multithreaded":[58],"applications":[59],"because":[60],"typical":[62],"time-sharing":[63],"schedulers":[64],"not":[66],"allocation-phase":[67,124],"cognizant;":[68],"i.e.,":[69],"they":[70],"often":[71],"schedule":[72],"threads":[73,132],"prevents":[78],"them":[79],"from":[80,153,176],"completing":[81],"their":[82],"quickly.":[85],"when":[87,155],"invoked,":[91],"yet":[96],"be":[98,123],"completed,":[99],"resulting":[100],"poor":[102],"efficiency.":[104],"We":[105],"introduce":[106],"two":[107],"new":[108],"scheduling":[109],"strategies,":[110],"LARF":[111],"(lower":[112],"rate":[114],"first)":[115],"MQRR":[117],"(memory-quantum":[118],"round":[119,159],"robin)":[120],"designed":[121],"aware":[125],"by":[126],"assigning":[127],"higher":[128],"execution":[129,167],"priority":[130],"computation-oriented":[134],"The":[136,162],"simulation":[137],"results":[138],"show":[139],"thatallthe":[140],"reductions":[141,163],"time":[146,168,174],"generational":[149],"collector":[150],"can":[151],"range":[152,175],"0%-27%":[154],"compare":[156],"robin":[160],"scheduler.":[161],"overall":[166],"average":[171],"thread":[172],"turnaround":[173],"-0.1%-3%":[177],"-0.1%-13%,":[179],"respectively.":[180]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}