Distributed Computing最新文献

{"title":"A topological characterization of stabilizing consensus.","authors":"Ulrich Schmid, Stephan Felber, Hugo Rincon Galeana","doi":"10.1007/s00446-026-00508-z","DOIUrl":"10.1007/s00446-026-00508-z","url":null,"abstract":"<p><p>We provide a complete characterization of the solvability/impossibility of deterministic stabilizing consensus in virtually any computing model with benign process and communication faults using point-set topology. Relying on the topologies for infinite executions introduced by Nowak, Schmid and Winkler (JACM, 2024) for terminating consensus, we show that semi-open decision sets and semi-continuous decision functions as introduced by Levin (AMM, 1963) are the appropriate means for this characterization: Unlike the continuous decision functions for terminating consensus, semi-continuous functions do not require the inverse image of an open set to be open and hence allow to map a connected space to a disconnected one. We also show that multi-valued stabilizing consensus with weak and strong validity are equivalent, as is the case for terminating consensus. By applying our results to (variants of) all the known possibilities/impossibilities for stabilizing consensus, we easily provide a topological explanation of these results.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"39 3","pages":"17"},"PeriodicalIF":1.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13287106/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148320236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Approach of agents with restricted fuel tanks.","authors":"Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, Grzegorz Stachowiak","doi":"10.1007/s00446-026-00518-x","DOIUrl":"https://doi.org/10.1007/s00446-026-00518-x","url":null,"abstract":"<p><p>Two mobile agents, modeled as points in the plane moving at speed 1, have to get at a distance at most 1 from each other. This task is known as approach or rendezvous in the plane. An adversary initially places both agents at distinct points, called their bases, at distance at most <i>D</i>, and wakes them up at possibly different times. Each of the agents has a fuel tank that allows them to traverse a trajectory of length <i>D</i>, and can be replenished at the base of the agent. The algorithm of each agent consists of a series of actions which are either moves at a chosen distance in a chosen direction or staying idle for a chosen period of time. For a given instance of the approach task, the execution time of an approach algorithm is the length of the period between the start of the later agent and the moment of approach. Our goal is to design approach algorithms with optimal time complexity . We consider two independent <i>coherence assumptions</i>. One of them is <i>time coherence</i>, i.e., agents start simultaneously, and the other is <i>orientation coherence</i>: agents have compatible compasses, showing the same North direction. Our main result is establishing optimal time complexity of the approach problem with restricted fuel tanks. It turns out that this optimal complexity heavily depends on the above coherence assumptions. If both of them are satisfied then approach can be performed in time <math><mrow><mi>O</mi> <mo>(</mo> <msup><mi>D</mi> <mn>2</mn></msup> <mo>)</mo></mrow> </math> and we show that this complexity is optimal. If any of the two coherence assumptions is missing then approach can be performed in time <math><mrow><mi>O</mi> <mo>(</mo> <msup><mi>D</mi> <mn>2</mn></msup> <msqrt><mi>D</mi></msqrt> <mo>)</mo></mrow> </math> and we prove that this order of magnitude cannot be improved. Our main technical contributions are lower bounds showing that, for each of the considered scenarios, our fairly natural approach algorithms are, in fact, optimal.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"39 4","pages":"26"},"PeriodicalIF":1.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13601203/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149041814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Connectivity Labeling in Faulty Colored Graphs.","authors":"Asaf Petruschka, Shay Sapir, Elad Tzalik","doi":"10.1007/s00446-026-00506-1","DOIUrl":"10.1007/s00446-026-00506-1","url":null,"abstract":"&lt;p&gt;&lt;p&gt;Fault-tolerant connectivity labelings are schemes that, given an &lt;i&gt;n&lt;/i&gt;-vertex graph &lt;math&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt; &lt;mo&gt;=&lt;/mo&gt; &lt;mo&gt;(&lt;/mo&gt; &lt;mi&gt;V&lt;/mi&gt; &lt;mo&gt;,&lt;/mo&gt; &lt;mi&gt;E&lt;/mi&gt; &lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt; &lt;/math&gt; and a parameter &lt;i&gt;f&lt;/i&gt;, produce succinct yet informative labels for the elements of the graph. Given &lt;i&gt;only the labels&lt;/i&gt; of two vertices &lt;i&gt;u&lt;/i&gt;, &lt;i&gt;v&lt;/i&gt; and of the elements in a faulty-set &lt;i&gt;F&lt;/i&gt; with &lt;math&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt; &lt;mi&gt;F&lt;/mi&gt; &lt;mo&gt;|&lt;/mo&gt; &lt;mo&gt;≤&lt;/mo&gt; &lt;mi&gt;f&lt;/mi&gt;&lt;/mrow&gt; &lt;/math&gt; , one can determine if &lt;i&gt;u&lt;/i&gt;, &lt;i&gt;v&lt;/i&gt; are connected in &lt;math&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt; &lt;mo&gt;-&lt;/mo&gt; &lt;mi&gt;F&lt;/mi&gt;&lt;/mrow&gt; &lt;/math&gt; , the surviving graph after removing &lt;i&gt;F&lt;/i&gt;. For the edge or vertex faults models, i.e., &lt;math&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt; &lt;mo&gt;⊆&lt;/mo&gt; &lt;mi&gt;E&lt;/mi&gt;&lt;/mrow&gt; &lt;/math&gt; or &lt;math&gt;&lt;mrow&gt;&lt;mi&gt;F&lt;/mi&gt; &lt;mo&gt;⊆&lt;/mo&gt; &lt;mi&gt;V&lt;/mi&gt;&lt;/mrow&gt; &lt;/math&gt; , a sequence of recent work established schemes with &lt;math&gt;&lt;mrow&gt;&lt;mo&gt;poly&lt;/mo&gt; &lt;mo&gt;(&lt;/mo&gt; &lt;mi&gt;f&lt;/mi&gt; &lt;mo&gt;,&lt;/mo&gt; &lt;mo&gt;log&lt;/mo&gt; &lt;mi&gt;n&lt;/mi&gt; &lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt; &lt;/math&gt; -bit labels for general graphs. This paper considers the &lt;i&gt;color faults&lt;/i&gt; model, recently introduced in the context of spanners [Petruschka, Sapir and Tzalik, ITCS '24], which accounts for known correlations between failures. Here, the edges (or vertices) of the input &lt;i&gt;G&lt;/i&gt; are arbitrarily colored, and the faulty elements in &lt;i&gt;F&lt;/i&gt; are colors; a failing color causes all edges (vertices) of that color to crash. While treating color faults by naïvly applying solutions for many failing edges or vertices is inefficient, the known correlations could potentially be exploited to provide better solutions. Our main contribution is settling the label length complexity for connectivity under one color fault ( &lt;math&gt;&lt;mrow&gt;&lt;mi&gt;f&lt;/mi&gt; &lt;mo&gt;=&lt;/mo&gt; &lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt; &lt;/math&gt; ). The existing implicit solution, by black-box application of the state-of-the-art scheme for edge faults of [Dory and Parter, PODC '21], might yield labels of &lt;math&gt;&lt;mrow&gt;&lt;mi&gt;Ω&lt;/mi&gt; &lt;mo&gt;(&lt;/mo&gt; &lt;mi&gt;n&lt;/mi&gt; &lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt; &lt;/math&gt; bits. We provide a deterministic scheme with labels of &lt;math&gt; &lt;mrow&gt;&lt;mover&gt;&lt;mi&gt;O&lt;/mi&gt; &lt;mo&gt;~&lt;/mo&gt;&lt;/mover&gt; &lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt; &lt;msqrt&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/msqrt&gt; &lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt; &lt;/mrow&gt; &lt;/math&gt; bits in the worst case, and a matching lower bound. Moreover, our scheme is &lt;i&gt;universally optimal&lt;/i&gt;: even schemes tailored to handle only colorings of one specific graph topology (i.e., may store the topology \"for free\") cannot produce asymptotically smaller labels. We characterize the optimal length by a new graph parameter &lt;math&gt;&lt;mrow&gt;&lt;mi&gt;bp&lt;/mi&gt; &lt;mo&gt;(&lt;/mo&gt; &lt;mi&gt;G&lt;/mi&gt; &lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt; &lt;/math&gt; called the &lt;i&gt;ball packing number&lt;/i&gt;. We further extend our labeling approach to yield a routing scheme avoiding a single forbidden color, with routing tables of size &lt;math&gt; &lt;mrow&gt;&lt;mover&gt;&lt;mi&gt;O&lt;/mi&gt; &lt;mo&gt;~&lt;/mo&gt;&lt;/mover&gt; &lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt; &lt;mi&gt;bp&lt;/mi&gt; &lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt; &lt;mi&gt;G&lt;/mi&gt; &lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt; &lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt; &lt;/mrow&gt; &lt;/math&gt; bits. We also consider the &lt;i&gt;centralized&lt;/i&gt; setting, and show an &lt;math&gt; &lt;mrow&gt;&lt;mover&gt;&lt;mi&gt;O&lt;/mi","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"39 2","pages":"14"},"PeriodicalIF":1.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13056742/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147647133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election.","authors":"Rex Fernando, Yuval Gelles, Ilan Komargodski","doi":"10.1007/s00446-026-00519-w","DOIUrl":"https://doi.org/10.1007/s00446-026-00519-w","url":null,"abstract":"<p><p>Distributed agreement is a general name for the task of ensuring consensus among non-faulty nodes in the presence of faulty or malicious behavior. Well-known instances of agreement tasks are Byzantine Agreement, Broadcast, and Committee or Leader Election. Since agreement tasks lie at the heart of many modern distributed applications, there has been an increased interest in designing <i>scalable</i> protocols for these tasks. Specifically, we want protocols where the per-party communication complexity scales sublinearly with the number of parties. With unconditional security, the state of the art protocols have <math> <mrow><mover><mi>O</mi> <mo>~</mo></mover> <mrow><mo>(</mo> <msqrt><mi>n</mi></msqrt> <mo>)</mo></mrow> </mrow> </math> per-party communication and <math> <mrow><mover><mi>O</mi> <mo>~</mo></mover> <mrow><mo>(</mo> <mn>1</mn> <mo>)</mo></mrow> </mrow> </math> rounds, where <i>n</i> stands for the number of parties, tolerating <math><mrow><mn>1</mn> <mo>/</mo> <mn>3</mn> <mo>-</mo> <mi>ϵ</mi></mrow> </math> fraction of corruptions for any <math><mrow><mi>ϵ</mi> <mo>></mo> <mn>0</mn></mrow> </math> . There are matching lower bounds showing that these protocols are essentially optimal among a large class of protocols. Recently, Boyle-Cohen-Goel (PODC '21, Journal of Cryptology '24) relaxed the attacker to be computationally bounded and using strong cryptographic assumptions showed a protocol with <math> <mrow><mover><mi>O</mi> <mo>~</mo></mover> <mrow><mo>(</mo> <mn>1</mn> <mo>)</mo></mrow> </mrow> </math> per-party communication and rounds (similarly, tolerating <math><mrow><mn>1</mn> <mo>/</mo> <mn>3</mn> <mo>-</mo> <mi>ϵ</mi></mrow> </math> fraction of corruptions). The security of their protocol relies on SNARKs for NP with linear-time extraction, a somewhat strong and non-standard assumption. Their protocols further rely on a public-key infrastructure (PKI) and a common-reference-string (CRS). In this work, we present a new synchronous protocol with <math> <mrow><mover><mi>O</mi> <mo>~</mo></mover> <mrow><mo>(</mo> <mn>1</mn> <mo>)</mo></mrow> </mrow> </math> per-party communication and rounds but relying only on the standard Learning With Errors (LWE) assumption. Our protocol also relies on a PKI and a CRS, and tolerates <math><mrow><mn>1</mn> <mo>/</mo> <mn>3</mn> <mo>-</mo> <mi>ϵ</mi></mrow> </math> fraction of corruptions, similarly to Boyle et al. Technically, we leverage (multi-hop) BARGs for NP directly and in a generic manner that significantly deviates from the framework of Boyle et al.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"39 4","pages":"27"},"PeriodicalIF":1.5,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13630810/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149117935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimal message-passing with noisy beeps.","authors":"Peter Davies-Peck","doi":"10.1007/s00446-025-00488-6","DOIUrl":"10.1007/s00446-025-00488-6","url":null,"abstract":"<p><p>Beeping models are models for networks of weak devices, such as sensor networks or biological networks. In these networks, nodes are allowed to communicate only via emitting beeps: unary pulses of energy. Listening nodes have only the capability of <i>carrier sensing</i>: they can only distinguish between the presence or absence of a beep, but receive no other information. The noisy beeping model further assumes listening nodes may be disrupted by random noise. Despite this extremely restrictive communication model, it transpires that complex distributed tasks can still be performed by such networks. In this paper we provide an optimal procedure for simulating general message passing in the beeping and noisy beeping models. We show that a round of Broadcast CONGEST can be simulated in <math><mrow><mi>O</mi> <mo>(</mo> <mi>Δ</mi> <mo>log</mo> <mi>n</mi> <mo>)</mo></mrow> </math> rounds of the noisy (or noiseless) beeping model, and a round of CONGEST can be simulated in <math><mrow><mi>O</mi> <mo>(</mo> <msup><mi>Δ</mi> <mn>2</mn></msup> <mo>log</mo> <mi>n</mi> <mo>)</mo></mrow> </math> rounds (where <math><mi>Δ</mi></math> is the maximum degree of the network). We also prove lower bounds demonstrating that no simulation can use asymptotically fewer rounds. This allows a host of graph algorithms to be efficiently implemented in beeping models. We present several example applications, including an <math><mrow><mi>O</mi> <mo>(</mo> <mo>log</mo> <mi>n</mi> <mo>)</mo></mrow> </math> -round Broadcast CONGEST algorithm for maximal matching, which, when simulated using our method, immediately implies a near-optimal <math><mrow><mi>O</mi> <mo>(</mo> <mi>Δ</mi> <msup><mo>log</mo> <mn>2</mn></msup> <mi>n</mi> <mo>)</mo></mrow> </math> -round maximal matching algorithm in the noisy beeping model. A preliminary version of this paper appeared in the proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (PODC) [14].</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"38 3","pages":"247-260"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12397199/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144977332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A wait-free queue with polylogarithmic step complexity","authors":"Hossein Naderibeni, Eric Ruppert","doi":"10.1007/s00446-024-00471-7","DOIUrl":"https://doi.org/10.1007/s00446-024-00471-7","url":null,"abstract":"<p>We present a novel linearizable wait-free queue implementation using single-word CAS instructions. Previous lock-free queue implementations from <span>CAS</span> all have amortized step complexity of <span>(Omega (p))</span> per operation in worst-case executions, where <i>p</i> is the number of processes that access the queue. Our new wait-free queue takes <span>(O(log p))</span> steps per enqueue and <span>(O(log ^2 p +log q))</span> steps per dequeue, where <i>q</i> is the size of the queue. A bounded-space version of the implementation has <span>(O(log p log (p+q)))</span> amortized step complexity per operation.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"11 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142178793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Deterministic near-optimal distributed listing of cliques","authors":"Keren Censor-Hillel, Dean Leitersdorf, David Vulakh","doi":"10.1007/s00446-024-00470-8","DOIUrl":"https://doi.org/10.1007/s00446-024-00470-8","url":null,"abstract":"<p>The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether deterministic algorithms can be as efficient as their randomized counterparts, where the latter are known to be tight up to polylogarithmic factors. We give deterministic distributed algorithms for listing cliques of size <i>p</i> in <span>(n^{1 - 2/p + o(1)})</span> rounds in the <span>Congest</span> model. For triangles, our <span>(n^{1/3+o(1)})</span> round complexity improves upon the previous state of the art of <span>(n^{2/3+o(1)})</span> rounds (Chang and Saranurak, in: 2020 IEEE 61st annual symposium on foundations of computer science (FOCS), pp 377–388. IEEE Computer Society, Los Alamito, 2020. https://doi.org/10.1109/FOCS46700.2020.00043). For cliques of size <span>(p ge 4)</span>, ours are the first non-trivial deterministic distributed algorithms. Given known lower bounds, for all values <span>(p ge 3)</span> our algorithms are tight up to an <span>(n^{o(1)})</span> subpolynomial factor, which comes from the deterministic routing procedure we use.\u0000</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"62 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141504260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On implementing SWMR registers from SWSR registers in systems with Byzantine failures","authors":"Xing Hu, Sam Toueg","doi":"10.1007/s00446-024-00465-5","DOIUrl":"https://doi.org/10.1007/s00446-024-00465-5","url":null,"abstract":"<p>The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport’s pioneering work (Lamport in Distrib Comput 1(2):77–101, 1986), this problem has been extensively studied in the context of asynchronous processes with crash failures. In this paper, we investigate this problem in the context of Byzantine process failures, with and without process signatures. We first prove that, without signatures, there is no wait-free linearizable implementation of a 1-writer <i>n</i>-reader register from atomic 1-writer 1-reader registers. In fact, we show a stronger result, namely, even under the assumption that the writer can only crash and at most one reader can be malicious, there is no linearizable implementation of a 1-writer <i>n</i>-reader register from atomic 1-writer <span>((n-1))</span>-reader registers that ensures that every correct process eventually completes its operations. In light of this impossibility result, we give two implementations of a 1-writer <i>n</i>-reader register from atomic 1-writer 1-reader registers that work under different assumptions. The first implementation is linearizable (under any combination of Byzantine process failures), but it guarantees that every correct process eventually completes its operations only under the assumption that the writer is correct or no reader is Byzantine—thus matching the impossibility result. The second implementation assumes process signatures; it is wait-free and linearizable under any number and combination of Byzantine process failures.\u0000</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"40 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141549333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Developing Irelands first National Student Mental Health and Suicide Prevention Framework for Higher Education.","authors":"J Surdey, D Byrne, T Fox","doi":"10.1017/ipm.2022.10","DOIUrl":"10.1017/ipm.2022.10","url":null,"abstract":"<p><p>This article focuses on the development of Ireland's first National Student Mental Health and Suicide Prevention Framework for Higher Education. There is growing concern for student mental health in higher education nationally and globally. The majority of students are aged between 18 and 24, which is identified as a high-risk group for mental health difficulties. Recent surveys of student mental illness, mental distress, and low well-being have been recognized by the World Health Organization, the Union of Students in Ireland National Report on Student Mental Health in Third Level Education, the My World survey and the My World 2 study. The Higher Education Authority in Ireland made a commitment to the Department of Health Connecting for Life (Ireland's National Strategy to Reduce Suicide 2015-2020) to form national guidelines for suicide prevention in higher education. In order to deliver on this commitment, The National Student Mental Health and Suicide Prevention Framework was developed. The Framework is informed by international evidence and was the product of a collaborative cross sector and cross disciplinary team including health professionals, government representatives, educators, students, policy makers, community organizations, researchers and clinicians.</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"1 1","pages":"254-258"},"PeriodicalIF":2.1,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89836997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Asymmetric distributed trust","authors":"Orestis Alpos, Christian Cachin, Björn Tackmann, Luca Zanolini","doi":"10.1007/s00446-024-00469-1","DOIUrl":"https://doi.org/10.1007/s00446-024-00469-1","url":null,"abstract":"<p>Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other problems. This paper introduces <i>asymmetric Byzantine quorum systems</i> that model subjective trust. Every process is free to choose which combinations of other processes it trusts and which ones it considers faulty. Asymmetric quorum systems strictly generalize standard Byzantine quorum systems, which have only one global trust assumption for all processes. This work also presents protocols that implement abstractions of shared memory, broadcast primitives, and a consensus protocol among processes prone to Byzantine faults and asymmetric trust. The model and protocols pave the way for realizing more elaborate algorithms with asymmetric trust.\u0000</p>","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"48 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141165449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}