{"id":"https://openalex.org/W4414736138","doi":"https://doi.org/10.1145/3731569.3764807","title":"Scalable Address Spaces using Concurrent Interval Skiplist","display_name":"Scalable Address Spaces using Concurrent Interval Skiplist","publication_year":2025,"publication_date":"2025-10-01","ids":{"openalex":"https://openalex.org/W4414736138","doi":"https://doi.org/10.1145/3731569.3764807"},"language":"en","primary_location":{"id":"doi:10.1145/3731569.3764807","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731569.3764807","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGOPS 31st Symposium on Operating Systems Principles","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3731569.3764807","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tae Woo Kim","orcid":"https://orcid.org/0000-0003-4257-5294"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Tae Woo Kim","raw_affiliation_strings":["KAIST, Daejeon, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0003-4257-5294","affiliations":[{"raw_affiliation_string":"KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019825813","display_name":"Youngjin Kwon","orcid":"https://orcid.org/0000-0001-5602-2397"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Youngjin Kwon","raw_affiliation_strings":["KAIST, Daejeon, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0001-5602-2397","affiliations":[{"raw_affiliation_string":"KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078763719","display_name":"Jeehoon Kang","orcid":"https://orcid.org/0000-0002-2115-0871"},"institutions":[{"id":"https://openalex.org/I4210101116","display_name":"Kai Research (United States)","ror":"https://ror.org/015nmh932","country_code":"US","type":"company","lineage":["https://openalex.org/I4210101116"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeehoon Kang","raw_affiliation_strings":["KAIST / FuriosaAI, Seoul, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0002-2115-0871","affiliations":[{"raw_affiliation_string":"KAIST / FuriosaAI, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I4210101116"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28329049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1131","last_page":"1148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","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"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9979000091552734,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6563000082969666},{"id":"https://openalex.org/keywords/address-space","display_name":"Address space","score":0.6312999725341797},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6068999767303467},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5224999785423279},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5199999809265137},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.3959999978542328},{"id":"https://openalex.org/keywords/logical-address","display_name":"Logical address","score":0.3483999967575073}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.784500002861023},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6563000082969666},{"id":"https://openalex.org/C144240696","wikidata":"https://www.wikidata.org/wiki/Q367204","display_name":"Address space","level":2,"score":0.6312999725341797},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6068999767303467},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5224999785423279},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5199999809265137},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4489000141620636},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44440001249313354},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37229999899864197},{"id":"https://openalex.org/C186799414","wikidata":"https://www.wikidata.org/wiki/Q3494571","display_name":"Logical address","level":4,"score":0.3483999967575073},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.30979999899864197},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.262800008058548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3731569.3764807","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731569.3764807","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGOPS 31st Symposium on Operating Systems Principles","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3731569.3764807","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731569.3764807","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGOPS 31st Symposium on Operating Systems Principles","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W172574161","https://openalex.org/W2008242909","https://openalex.org/W2069852267","https://openalex.org/W2100817684","https://openalex.org/W2130055503","https://openalex.org/W2751343396","https://openalex.org/W2916456461","https://openalex.org/W4205342357","https://openalex.org/W4210252123","https://openalex.org/W4243704263","https://openalex.org/W4248322017","https://openalex.org/W4251954952","https://openalex.org/W4285658328"],"related_works":[],"abstract_inverted_index":{"A":[0],"kernel's":[1],"address":[2,11,50],"space":[3,12],"design":[4],"can":[5],"significantly":[6],"bottleneck":[7],"multi-threaded":[8],"applications,":[9],"as":[10,15,33],"operations":[13,59],"such":[14],"mmap()":[16],"and":[17],"munmap()":[18],"are":[19,61],"serialized":[20],"by":[21],"coarsegrained":[22],"locks":[23,28],"like":[24],"Linux's":[25],"mmap_lock.":[26],"Such":[27],"have":[29,47],"long":[30],"been":[31],"known":[32],"one":[34],"of":[35],"the":[36],"most":[37],"intractable":[38],"contention":[39],"points":[40],"in":[41],"memory":[42],"management.":[43],"While":[44],"prior":[45],"works":[46],"attempted":[48],"to":[49,56],"this":[51],"issue,":[52],"they":[53],"either":[54],"fail":[55],"sufficiently":[57],"parallelize":[58],"or":[60],"impractical":[62],"for":[63],"real-world":[64],"kernels.":[65]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
