{"id":160720,"date":"2026-02-12T17:11:59","date_gmt":"2026-02-12T15:11:59","guid":{"rendered":"https:\/\/prohoster.info\/blog\/novosti-interneta\/v-yazyke-nim-predstavlen-yrc-potokobezopasnyj-sborshhik-cziklicheskih-ssylok"},"modified":"2026-02-12T17:11:59","modified_gmt":"2026-02-12T15:11:59","slug":"v-yazyke-nim-predstavlen-yrc-potokobezopasnyj-sborshhik-cziklicheskih-ssylok","status":"publish","type":"post","link":"https:\/\/prohoster.info\/ro\/blog\/news\/v-yazyke-nim-predstavlen-yrc-potokobezopasnyj-sborshhik-cziklicheskih-ssylok","title":{"rendered":"\u00cen limbajul Nim a fost introdus YRC \u2014 un colector de linkuri ciclice thread-safe","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"
Andreas Rumpf (Araq), creator of the Nim programming language, has announced a new memory management algorithm, YRC (pronounced \u2018Yurk\u2019), which addresses one of the key issues of existing mechanisms in Nim: the inability to correctly handle circular references crossing thread boundaries. <\/p>\n
Before YRC, Nim's offered memory management algorithms had the following limitations: ARC \u2014 did not support multithreading or cycle processing; Atomic ARC \u2014 was thread-safe but did not handle circular references; ORC \u2014 handled circular references but could only do so correctly within a single thread (using shared references between threads resulted in memory leaks). <\/p>\n
The proposed YRC combines thread safety and cycle processing across threads through a combined approach: atomic reference counting is applied for acyclic data, and a write barrier is used for cyclic data, which is activated only when assigning pointers. In the proposed implementation: the collector is activated as needed (no stop-the-world pauses); the root RC objects are explicitly defined and combined once (no need to scan thread stacks); multithreaded deletion during iteration is avoided (no global sweep phase); mutators freely read data; any thread can start the garbage collector as needed (without a dedicated GC thread). <\/p>\n
YRC utilizes complete information about incRef\/decRef events, which traditional tracing garbage collectors discard and then have to recover through stack scanning and graph traversal. The implementation consists of only 550 lines of code and has formal verification of safety and absence of deadlocks through specification in TLA+ and proof in the Lean toolkit. YRC is positioned as 'almost the last reference-counting cycle collector' (the letter Y precedes Z in the alphabet), as well as the simplest thread-safe garbage collector \u2014 according to the author, it does not require many complex mechanisms inherent in traditional tracing garbage collectors. <\/p>\n
YRC ofer\u0103 aceea\u0219i API ca ORC, cu executarea destructorilor \u00een timpul colect\u0103rii de\u0219eurilor. Colectorul proceseaz\u0103 doar acele subgrafuri de obiecte cu care lucreaz\u0103 firele, f\u0103r\u0103 a atinge structurile de date necorelate (cache-uri, obiecte de lung\u0103 durat\u0103) \u2014 o abordare similar\u0103 unui colector de de\u0219euri generativ \u201eideal\u201d f\u0103r\u0103 utilizarea genera\u021biilor. Principala problem\u0103 este performan\u021ba: YRC arat\u0103 o \u00eencetinire de 1,5-2,0 ori comparativ cu ORC \u00een testul de performan\u021b\u0103 orcbench. Autorul consider\u0103 c\u0103 aceasta este o compensa\u021bie acceptabil\u0103 pentru procesarea complet sigur\u0103 din punct de vedere al firului a referin\u021belor circulare. <\/p>\n
YRC este deja disponibil \u00een versiunea de dezvoltare a Nim \u0219i se activeaz\u0103 cu flagul \u201e--mm:yrc\u201d. Totu\u0219i, \u00een mesajele ulterioare, autorul a recunoscut c\u0103 implementarea ini\u021bial\u0103 con\u021binea erori grave \u0219i nu colecta corect ciclurile. La momentul public\u0103rii, a fost preg\u0103tit un set de corecturi care elimin\u0103 principalele gre\u0219eli. Autorul continu\u0103 ajustarea heuristicilor de colectare \u0219i corectarea erorilor r\u0103mase, \u00een timp ce algoritmul de baz\u0103 \u0219i verificarea sa formal\u0103 r\u0103m\u00e2n corecte. \n Sursa: opennet.ro<\/a> <\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"