Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Phil Kearns"'
Publikováno v:
Scientific Programming, Vol 14, Iss 2, Pp 151-170 (2006)
Capturing and examining the causal and concurrent relationships of a distributed system is essential to a wide range of distributed systems applications. Many approaches to gathering this information rely on trace files of executions. The information
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f5765d0f21a1da718fb78ed7d2f0f69
https://doaj.org/article/de2a07ba6bb143f2854628eb82959898
https://doaj.org/article/de2a07ba6bb143f2854628eb82959898
Autor:
Jean Mayo, Phil Kearns
Publikováno v:
Information Processing Letters. 52:105-108
A distributed and fully symmetric solution to the distributed termination problem is presented. The solution developed applies to systems in which each processor has a physical clock which is roughly synchronized with all other processors' physical c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d118d62b785726a8d5ac88298b584d5
https://doi.org/10.1016/0020-0190(94)00129-4
https://doi.org/10.1016/0020-0190(94)00129-4
Autor:
William S. Lloyd, Phil Kearns
Publikováno v:
Journal of Systems and Software. 21:201-214
Tracing the execution of a sequential program is easy — one need merely single step the program and record the elements of the program's state which are changed. Such a trace would be useful in validating that a program meets its specifications or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1820a8e94dacffd9dcae24b52b2b93dd
https://doi.org/10.1016/0164-1212(93)90023-q
https://doi.org/10.1016/0164-1212(93)90023-q
Publikováno v:
IEEE Transactions on Software Engineering. 19:366-378
Flush channels generalize conventional asynchronous communication constructs such as virtual circuits and datagrams. They permit the programmer to specify receipt-order restrictions on a message-by-message basis, providing an opportunity for more con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf353dbf65fa857fe6aa3adfb02ab306
https://doi.org/10.1109/32.223804
https://doi.org/10.1109/32.223804
Autor:
Phil Kearns, J. Mayo
Publikováno v:
ICDCS
Inexpensive but accurate hardware clocks are now commonplace on many systems. A clock synchronization protocol can keep the collection of clocks for a group of networked systems roughly synchronized without the expenditure of a great deal of processo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b1ce6f186e012f5911eaaa9422ad8e7
https://doi.org/10.1109/icdcs.1999.776522
https://doi.org/10.1109/icdcs.1999.776522
Autor:
B. Koodalattupuram, Phil Kearns
Publikováno v:
ICDCS
A technique is presented by which a centralized service facility in a distributed system can honor client requests in the global order in which those requests were made. Unlike traditional approaches to this problem, the server provides immediate ser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4492ec4a94127e9f121a00761a61550
https://doi.org/10.1109/icdcs.1989.37995
https://doi.org/10.1109/icdcs.1989.37995
Publikováno v:
ICDCS
Flush channels generalize more conventional asynchronous message passing protocols. A distributed system that uses flush channels allows a programmer the flexibility of specifying the delivery order of each message in relation to other messages trans
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49bb0d962c0de5a224f6a47cfa9f98ed
https://doi.org/10.1109/icdcs.1992.235023
https://doi.org/10.1109/icdcs.1992.235023
Autor:
S.L. Peterson, Phil Kearns
Publikováno v:
SRDS
Causality, as made concrete by Lamport's "happened before" relation, is the central underlying basis in the design of optimistic protocols for checkpoint and recovery. After the recovery of a formerly failed process, all events and messages which cau
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92407a16ce078095b28b65d785bb306f
https://doi.org/10.1109/reldis.1993.393472
https://doi.org/10.1109/reldis.1993.393472
Autor:
D. Edwards, Phil Kearns
Publikováno v:
SPDP
We present a straightforward and sample method of visualizing the execution of a distributed system as it is recorded in a collection of per-process traces. The technique is based directly on Lamport's space-time diagrams and the notion of causal pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7430f37d962893bc10bc02f4c1ca7db4
https://doi.org/10.1109/spdp.1994.346156
https://doi.org/10.1109/spdp.1994.346156
Autor:
Phil Kearns, W.S. Lloyd
Publikováno v:
ICDCS
Two principles are proposed for proving and tracing distributed programs: it is necessary to assert in proofs only what can be readily traced, and trace just what can be asserted in the proofs. A proof system and tracing strategy are described for CS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5494d607ad348074ed86f77a65d9596c
https://doi.org/10.1109/icdcs.1991.148725
https://doi.org/10.1109/icdcs.1991.148725