서브메뉴
검색
Fault-Tolerant and Fault-Recovering Garbage Collection for the Actor Model: A Collage-Based Approach
Fault-Tolerant and Fault-Recovering Garbage Collection for the Actor Model: A Collage-Based Approach
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260202105703
- ISBN
- 9798263308025
- DDC
- 004
- 저자명
- Plyukhin, Dan.
- 서명/저자
- Fault-Tolerant and Fault-Recovering Garbage Collection for the Actor Model: A Collage-Based Approach
- 발행사항
- [Sl] : University of Illinois at Urbana-Champaign, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 176 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 87-05, Section: B.
- 주기사항
- Advisor: Agha, Gul.
- 학위논문주기
- Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2024.
- 초록/해제
- 요약An actor garbage collector (actor GC) is a tool for automatically identifying actors that are safe to delete, and reclaiming their resources. Actor GC could be particularly useful in distributed applications, because programmers have difficulty reclaiming resources after faults such as crashed nodes or dropped messages. Unfortunately, faults are a pain point in existing actor GCs: in existing approaches, an actor on a crashed node with a reference to an actor on a healthy node will prevent the healthy actor---and its references---from ever being garbage collected. Moreover, existing GC algorithms have poor scalability in a distributed systems. This is because of the synchronization and message overhead they introduce by requiring causal delivery, or by introducing a large number of control messages. For these reasons, it has not been practical to add actor GC to popular frameworks like Akka and Erlang. This thesis explores an emerging technique for actor GC, dubbed the collage-based approach. Collage-based GCs are capable of high performance because they do not dictate when an actor should participate in garbage collection, and by design they naturally make progress with only partial information. The thesis presents two collage-based GCs: PRL and CRGC. Both GCs are provably correct and impose no locks, memory barriers, or message ordering requirements. PRL uses distributed reference listing to collect acyclic garbage and allows node-local garbage collectors to detect distributed cyclic garbage via a lightweight gossip protocol. We then use insights from PRL to develop CRGC: the first actor GC capable of recovering from crashed nodes and dropped messages. We have formalized CRGC in TLA+ and implemented CRGC in Akka. Preliminary evaluation shows that CRGC imposes little overhead in practice and is capable of collecting actors that become garbage caused by crashed nodes.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 키워드
- Actor model
- 키워드
- Concurrency
- 키워드
- Fault tolerance
- 기타저자
- University of Illinois at Urbana-Champaign Computer Science
- 기본자료저록
- Dissertations Abstracts International. 87-05B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2024 us c eng d■001000017361084
■00520260202105703
■006m o d
■007cr#unu||||||||
■020 ▼a9798263308025
■035 ▼a(MiAaPQ)AAI32409896
■035 ▼a(MiAaPQ)124328
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aPlyukhin, Dan.
■24510▼aFault-Tolerant and Fault-Recovering Garbage Collection for the Actor Model: A Collage-Based Approach
■260 ▼a[Sl]▼bUniversity of Illinois at Urbana-Champaign▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a176 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 87-05, Section: B.
■500 ▼aAdvisor: Agha, Gul.
■5021 ▼aThesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2024.
■520 ▼aAn actor garbage collector (actor GC) is a tool for automatically identifying actors that are safe to delete, and reclaiming their resources. Actor GC could be particularly useful in distributed applications, because programmers have difficulty reclaiming resources after faults such as crashed nodes or dropped messages. Unfortunately, faults are a pain point in existing actor GCs: in existing approaches, an actor on a crashed node with a reference to an actor on a healthy node will prevent the healthy actor---and its references---from ever being garbage collected. Moreover, existing GC algorithms have poor scalability in a distributed systems. This is because of the synchronization and message overhead they introduce by requiring causal delivery, or by introducing a large number of control messages. For these reasons, it has not been practical to add actor GC to popular frameworks like Akka and Erlang. This thesis explores an emerging technique for actor GC, dubbed the collage-based approach. Collage-based GCs are capable of high performance because they do not dictate when an actor should participate in garbage collection, and by design they naturally make progress with only partial information. The thesis presents two collage-based GCs: PRL and CRGC. Both GCs are provably correct and impose no locks, memory barriers, or message ordering requirements. PRL uses distributed reference listing to collect acyclic garbage and allows node-local garbage collectors to detect distributed cyclic garbage via a lightweight gossip protocol. We then use insights from PRL to develop CRGC: the first actor GC capable of recovering from crashed nodes and dropped messages. We have formalized CRGC in TLA+ and implemented CRGC in Akka. Preliminary evaluation shows that CRGC imposes little overhead in practice and is capable of collecting actors that become garbage caused by crashed nodes.
■590 ▼aSchool code: 0090.
■650 4▼aComputer science
■650 4▼aComputer engineering
■653 ▼aActor model
■653 ▼aConcurrency
■653 ▼aFault tolerance
■653 ▼aDistributed systems
■653 ▼aDistributed computing
■653 ▼aGarbage collection
■690 ▼a0984
■690 ▼a0464
■71020▼aUniversity of Illinois at Urbana-Champaign▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g87-05B.
■790 ▼a0090
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17361084▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
