Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Message passing systems"'
Autor:
Basu, Samik a, ⁎, Bultan, Tevfik b
Publikováno v:
In Theoretical Computer Science 20 December 2016 656 Part A:60-75
Autor:
Bonnet, François, Raynal, Michel ⁎
Publikováno v:
In Theoretical Computer Science 2011 412(33):4273-4284
Autor:
Welch, Jennifer L.
Atomic shared objects, whose operations take place instantaneously, are a powerful technique for designing complex concurrent programs. Since they are not always available, they are typically substituted with software implementations. A prominent con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99f7ee8efc13dfc81aeb5399437b01b8
Autor:
Belardinelli, F. a, Lomuscio, A. b, ⁎
Publikováno v:
In Artificial Intelligence 2009 173(9):982-1013
Publikováno v:
In Journal of Parallel and Distributed Computing 2008 68(9):1263-1282
Publikováno v:
Programming Languages and Systems
Asynchronous message-passing systems are employed frequently to implement distributed mechanisms, protocols, and processes. This paper addresses the problem of precise data flow analysis for such systems. To obtain good precision, data flow analysis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53f77350c48181891d67eb27b4e0de87
Publikováno v:
35th International Symposium on Distributed Computing, {DISC} 2021
A key way to construct complex distributed systems is through modular composition of linearizable concurrent objects. A prominent example is shared registers, which have crash-tolerant implementations on top of message-passing systems, allowing the a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7050e157046afdc026197889590fd2f3
Autor:
Henriksen, Jesper G. a, 1, Mukund, Madhavan b, ⁎, Kumar, K. Narayan b, Sohoni, Milind c, Thiagarajan, P.S. d, 2
Publikováno v:
In Information and Computation 2005 202(1):1-38
Publikováno v:
In Journal of Parallel and Distributed Computing 2005 65(6):692-713
Publikováno v:
In Theoretical Computer Science 2003 290(1):221-239