[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-86107-en":3,"doc-seo-86107-105":30,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":21,"is_downloadable":21,"audit_status":21,"page_count":22,"language":23,"language_code":24,"site_id":25,"html_lang":24,"table_of_contents":26,"faqs":27,"seo_title":13,"seo_description":14,"update_tm":28,"read_time":29},86107,1374391974468,"Eden","https://ap-avatar.wpscdn.com/davatar_29158cc5080c5b710cf443261637dec0",8,"Research & Report","Domain Extension of Lock-Freedom and Wait-Freedom for Group Computations","Domain extension broadens a definition so it applies to a wider set of cases without breaking logical consistency or introducing ambiguity. This paper extends lock-freedom and wait-freedom—originally formulated for single-thread task completion—toward group computations, where multiple threads collaborate to complete one task (gl-freedom and gw-freedom). The work argues backward compatibility when a group has one thread, enabling progress characterization for distributed, NUMA, and private-data systems, supported by illustrative examples and applications to concurrency progress properties.","arXiv :2607 . 11014v1 [ cs .DC] 13 Jul 2026  \nDomain Extension of Lock-Freedom and Wait-Freedom for Group Computations  \nRAAGHAV RAVISHANKAR, Michigan State University, USA SANDEEP KULKARNI, Michigan State University, USA SATHYA PERI, Indian Institute of Technology Hyderabad, India GOKARNA SHARMA, Kent State University, USA  \nMANASWINI PIDUGURALLA, Indian Institute of Technology Hyderabad, India YASHI RASTOGI, Indian Institute of Technology Hyderabad, India  \nA domain extension1 of a definition refers to broadening the scope of a definition so that it applies to a larger set of cases than originally specified. The notion of lock-free and wait-free computation is designed for the domain of tasks that are completed by a single thread (in competition with other threads) . The goal of this paper is to extend the definition of lock-freedom and wait-freedom to group-computations (denoted by gl-freedom and gw-freedom) that require that the task at hand must be completed by a collaboration between multiple threads. When extending a definition, certain constraints must be respected: the new domain must remain logically consistent with the original meaning, the extension should not introduce contradictions or ambiguities, and it must preserve the essential properties that make the definition valid and useful. We demonstrate this by showing that our extended definition is consistent with the original definition when the group consists of a single thread. We note that extension allows us to characterize programs in a new domain (distributed computing, NUMA computation systems, systems with private data for different threads, etc.) instead of relegating them to be in the same category (deadlock/livelock-free) without regard to the actual properties of that program. We also illustrate this definition with various examples.  \n1You ask a child in elementary school for the definition of 􀀰􀀽 and they will tell you it is 􀀰 times 􀀰 times 􀀰 , 􀀽 times. When the child grows up, they learn that the domain of 􀀽 can be broadened so that we can define terms such as 􀀰0.5 or even more complex terms such as 􀀰 􀀸 , Any domain extension in this manner must ensure that they do not violate existing terms (e.g., the value of 􀀰2 cannot change with a new definition) and existing properties (e.g., 􀀰􀁇 ∗ 􀀰􀁾 = 􀀰􀁇 +􀁾) remain true.  \nGiven the importance of lock-freedom and wait-freedom in defining progress of operations, in this paper, we want to expand the domain to which it can be applied while ensuring that this extension is backward compatible with the current definition. And, this extended definition allows us to distinguish between different executions that would previously have been only deemed deadlock-free. We argue that this lack of nuance distorts algorithm’s critical attributes and, therefore, focus on domain extension for these definitions.  \nAuthors’ Contact Information: Raaghav Ravishankar, Michigan State University, USA, [ravisha7@msu.edu](ravisha7@msu.edu); Sandeep Kulkarni, Michigan State University, USA, [sandeep@cse.msu.edu](sandeep@cse.msu.edu); Sathya Peri, Indian Institute of Technology Hyderabad, India, [sathya_p@cse.iith.ac.in](sathya_p@cse.iith.ac.in); Gokarna Sharma, Kent State University, USA; Manaswini Piduguralla, Indian Institute of Technology Hyderabad, India, [cs20resch11007@iith.ac.in](cs20resch11007@iith.ac.in); Yashi Rastogi, Indian Institute of Technology Hyderabad, India, [cs23resch11007@iith.ac.in](cs23resch11007@iith.ac.in).  \n1 Introduction  \nWait-freedom and lock-freedom are highly desirable [9, 11] properties of a concurrent (multi-core) system. They offer strong guarantees of progress beyond deadlock-freedom and starvation-freedom. For example, wait-freedom guarantees that there is a worst-case response time for the operation. This is critical in real-time systems [5] .  \nA key characteristic of these definitions is that they are thread-based, i.e., they assume that thereis a (single) thread that invokes the operation and the ","cbCailraftRLDGcn","https://ap.wps.com/l/cbCailraftRLDGcn","pdf",606606,2,1,19,"English","en",105,"# Introduction\n## Progress guarantees in concurrent systems\n## Thread-based assumptions vs collaborative tasks\n## Problem setting: group scheduling and competition/collaboration relationships","[{\"question\":\"Why does the paper propose extending lock-freedom and wait-freedom beyond single-thread tasks?\",\"answer\":\"Because the original definitions assume the invoking thread can complete the operation in isolation. The paper targets scenarios where completion requires collaboration among multiple threads, making the single-thread assumption inadequate.\"},{\"question\":\"How does the paper ensure the extended definitions remain consistent with the original ones?\",\"answer\":\"The extension is designed to preserve essential properties and avoid contradictions; it is demonstrated to be consistent with the original definitions when the group consists of a single thread.\"},{\"question\":\"What is the practical value of domain extension for these progress properties?\",\"answer\":\"It allows programs in new execution domains (e.g., distributed computing, NUMA systems, and systems with private data per thread) to be characterized using meaningful progress guarantees rather than being lumped into deadlock/livelock-free categories.\"}]",1784208562,48,{"code":4,"msg":31,"data":32},"ok",{"site_id":25,"language":24,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":28},"domain-extension-of-lock-freedom-and-wait-freedom-for-group-computations","",{"@graph":36,"@context":85},[37,53,68],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,47,50],{"item":41,"name":42,"@type":43,"position":21},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":20},"https://docshare.wps.com/document/","Document",{"item":48,"name":12,"@type":43,"position":49},"https://docshare.wps.com/document/research-report/",3,{"item":51,"name":13,"@type":43,"position":52},"https://docshare.wps.com/document/domain-extension-of-lock-freedom-and-wait-freedom-for-group-computations/86107/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":24,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":41,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-26","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"Why does the paper propose extending lock-freedom and wait-freedom beyond single-thread tasks?","Question",{"text":75,"@type":76},"Because the original definitions assume the invoking thread can complete the operation in isolation. The paper targets scenarios where completion requires collaboration among multiple threads, making the single-thread assumption inadequate.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"How does the paper ensure the extended definitions remain consistent with the original ones?",{"text":80,"@type":76},"The extension is designed to preserve essential properties and avoid contradictions; it is demonstrated to be consistent with the original definitions when the group consists of a single thread.",{"name":82,"@type":73,"acceptedAnswer":83},"What is the practical value of domain extension for these progress properties?",{"text":84,"@type":76},"It allows programs in new execution domains (e.g., distributed computing, NUMA systems, and systems with private data per thread) to be characterized using meaningful progress guarantees rather than being lumped into deadlock/livelock-free categories.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":25},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":21,"doc_module":4,"doc_module_name":46,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":20,"doc_module":4,"doc_module_name":46,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":46,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":46,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":46,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":46,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":46,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":46,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":46,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":22,"doc_module":4,"doc_module_name":46,"category_name":136,"show_sort_weight":106,"slug":137},"General","general"]