Distributed Computing最新文献_第4页

Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity 从读/写操作设置可线性化的实现：集、获取和增量、堆栈和具有多重性的队列

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-12-07 DOI: 10.1007/s00446-022-00440-y

Armando Castañeda, S. Rajsbaum, M. Raynal

引用次数: 0

Special issue on DISC 2020 DISC 2020特刊

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-10-25 DOI: 10.1007/s00446-022-00438-6

H. Attiya

引用次数: 0

Making Byzantine consensus live 让拜占庭式的共识活下去

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-09-02 DOI: 10.1007/s00446-022-00432-y

Manuel Bravo, G. Chockler, Alexey Gotsman

引用次数: 38

Extending the wait-free hierarchy to multi-threaded systems 将无等待层次结构扩展到多线程系统

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-08-01 DOI: 10.1007/s00446-022-00425-x

Matthieu Perrin, A. Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza

引用次数: 5

PerformERL: a performance testing framework for erlang PerformERL: erlang的性能测试框架

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-08-01 DOI: 10.1007/s00446-022-00429-7

W. Cazzola, Francesco Cesarini, Luca Tansini

引用次数: 1

Special issue on PODC 2020 PODC 2020特刊

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-07-19 DOI: 10.1007/s00446-022-00434-w

H. Attiya

引用次数: 0

Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC RNC中具有小希望界的线性大小的希望集和常希望界的希望集

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-06-29 DOI: 10.1007/s00446-022-00431-z

Michael Elkin, Ofer Neiman

{"title":"Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC","authors":"Michael Elkin, Ofer Neiman","doi":"10.1007/s00446-022-00431-z","DOIUrl":"https://doi.org/10.1007/s00446-022-00431-z","url":null,"abstract":"Hopsets are a fundamental graph-theoretic and graph-algorithmic construct, and they are widely used for distance-related problems in a variety of computational settings. Currently existing constructions of hopsets produce hopsets either with (Omega (n log n)) edges, or with a hopbound (n^{Omega (1)}). In this paper we devise a construction of linear-size hopsets with hopbound (ignoring the dependence on (epsilon )) ((log log n)^{log log n + O(1)}). This improves the previous hopbound for linear-size hopsets almost exponentially. We also devise efficient implementations of our construction in PRAM and distributed settings. The only existing PRAM algorithm [19] for computing hopsets with a constant (i.e., independent of n) hopbound requires (n^{Omega (1)}) time. We devise a PRAM algorithm with polylogarithmic running time for computing hopsets with a constant hopbound, i.e., our running time is exponentially better than the previous one. Moreover, these hopsets are also significantly sparser than their counterparts from [19]. We apply these hopsets to achieve the following online variant of shortest paths in the PRAM model: preprocess a given weighted graph within polylogarithmic time, and then given any query vertex v, report all approximate shortest paths from v in constant time. All previous constructions of hopsets require either polylogarithmic time per query or polynomial preprocessing time.","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"20 10","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138507820","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}

引用次数: 0

Near-optimal distributed dominating set in bounded arboricity graphs 有界树度图中的近最优分布支配集

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-06-10 DOI: 10.1145/3519270.3538437

Michal Dory, M. Ghaffari, S. Ilchi

{"title":"Near-optimal distributed dominating set in bounded arboricity graphs","authors":"Michal Dory, M. Ghaffari, S. Ilchi","doi":"10.1145/3519270.3538437","DOIUrl":"https://doi.org/10.1145/3519270.3538437","url":null,"abstract":"We describe a simple deterministic $$O( varepsilon ^{-1} log Delta )$$ O ( ε - 1 log Δ ) round distributed algorithm for $$(2alpha +1)(1 + varepsilon )$$ ( 2 α + 1 ) ( 1 + ε ) approximation of minimum weighted dominating set on graphs with arboricity at most $$alpha $$ α . Here $$Delta $$ Δ denotes the maximum degree. We also show a lower bound proving that this round complexity is nearly optimal even for the unweighted case, via a reduction from the celebrated KMW lower bound on distributed vertex cover approximation (Kuhn et al. in JACM 63:116, 2016). Our algorithm improves on all the previous results (that work only for unweighted graphs) including a randomized $$O(alpha ^2)$$ O ( α 2 ) approximation in $$O(log n)$$ O ( log n ) rounds (Lenzen et al. in International symposium on distributed computing, Springer, 2010), a deterministic $$O(alpha log Delta )$$ O ( α log Δ ) approximation in $$O(log Delta )$$ O ( log Δ ) rounds (Lenzen et al. in international symposium on distributed computing, Springer, 2010), a deterministic $$O(alpha )$$ O ( α ) approximation in $$O(log ^2 Delta )$$ O ( log 2 Δ ) rounds (implicit in Bansal et al. in Inform Process Lett 122:21–24, 2017; Proceeding 17th symposium on discrete algorithms (SODA), 2006), and a randomized $$O(alpha )$$ O ( α ) approximation in $$O(alpha log n)$$ O ( α log n ) rounds (Morgan et al. in 35th International symposiumon distributed computing, 2021). We also provide a randomized $$O(alpha log Delta )$$ O ( α log Δ ) round distributed algorithm that sharpens the approximation factor to $$alpha (1+o(1))$$ α ( 1 + o ( 1 ) ) . If each node is restricted to do polynomial-time computations, our approximation factor is tight in the first order as it is NP-hard to achieve $$alpha - 1 - varepsilon $$ α - 1 - ε approximation (Bansal et al. in Inform Process Lett 122:21-24, 2017).","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"1 1","pages":"1-12"},"PeriodicalIF":1.3,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47763316","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}

引用次数: 3

Linial for lists 列表的Linial

IF 1.3 4区计算机科学

Distributed Computing Pub Date : 2022-05-17 DOI: 10.1007/s00446-022-00424-y

Yannic Maus, Tigran Tonoyan

引用次数: 2

Posterior chamber phakic intraocular lens implantation after laser in situ keratomileusis. 激光原位角膜磨镶术后的后房型人工晶体植入术。

IF 4.1 4区计算机科学

Distributed Computing Pub Date : 2022-04-11 DOI: 10.1186/s40662-022-00282-6

Kazutaka Kamiya, Kimiya Shimizu, Akihito Igarashi, Yoshihiro Kitazawa, Takashi Kojima, Tomoaki Nakamura, Kazuo Ichikawa, Sachiko Fukuoka, Kahoko Fujimoto

{"title":"Posterior chamber phakic intraocular lens implantation after laser in situ keratomileusis.","authors":"Kazutaka Kamiya, Kimiya Shimizu, Akihito Igarashi, Yoshihiro Kitazawa, Takashi Kojima, Tomoaki Nakamura, Kazuo Ichikawa, Sachiko Fukuoka, Kahoko Fujimoto","doi":"10.1186/s40662-022-00282-6","DOIUrl":"10.1186/s40662-022-00282-6","url":null,"abstract":"Background: To assess the multicenter outcomes of posterior chamber phakic intraocular lens implantation with a central hole (EVO-ICL, STAAR Surgical) for patients undergoing previous laser in situ keratomileusis (LASIK).Methods: This case series enrolled 31 eyes of 21 consecutive patients undergoing EVO-ICL implantation to correct residual refractive errors after LASIK at 7 nationwide major surgical sites. We investigated safety, efficacy, predictability, stability, and adverse events at 1 week, 1, 3, and 6 months postoperatively, and at the final visit.Results: The mean observation period was 1.6 ± 1.8 years. Uncorrected and corrected visual acuities were - 0.14 ± 0.11 and - 0.22 ± 0.09 logMAR at 6 months postoperatively. At 6 months postoperatively, 81% and 100% of eyes were within ± 0.5 D and ± 1.0 D, respectively, of the targeted correction. We found neither significant manifest refraction changes of 0.05 ± 0.38 D from 1 week to 6 months nor apparent intraoperative or postoperative complications in any case.Conclusions: Our multicenter study confirmed that the EVO-ICL provided good outcomes in safety, efficacy, predictability, and stability, even in post-LASIK eyes. Therefore, EVO-ICL implantation may be a viable surgical option, even for correcting residual refractive errors after LASIK. Trial registration University Hospital Medical Information Network Clinical Trial Registry (000045295).","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"1 1","pages":"15"},"PeriodicalIF":4.1,"publicationDate":"2022-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9008970/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89832009","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}

引用次数: 0