Abstract
Several authors have studied the problem of implementing CSP rendezvous on networks of machines. Their research mainly concentrates on the implementation of a fair non-deterministic choice and assumes a correct functionning of processors and communication media.In this paper, we address the problem of efficient implementation of atomic rendezvous in presence of processors failures in a multiprocessor machine. Both atomicity and efficiency are obtained by using special hardware devices: high speed stable storages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.-P. Banâtre, M. Banatre, G. Muller, Ensuring Data Security and Integrity with a fast stable storage, Proc. 4 to conf. on Data Engineering, Los Angeles, February 1988, pp. 285–293.
A. J. Bernstein, Output guards and Nondeterminism in “Communicating Sequential Processes”, ACM Trans. Program. Lang. Syst., vol. 2, n° 2, pp. 234–238, April 1980.
A. D. Birrell and B. J. Nelson, Implementing Remote Procedure Calls, ACM Trans, on Computer Systems, vol. 2, n° 1, pp. 39–59, February 1984.
G. N. Buckley and A. Silberschatz, An Effective Implementation for the Generalized Input-output Construct of CSP, ACM Trans. Program. Lang. Syst., vol. 5, n° 2, pp. 223–235, April 1983.
J.N. Gray, Notes on data base operating systems, In lecture Notes in Computer Science, G. Goos and J. Hartmanis Eds., Springer Verlag, New York, pp. 393–481, 1978.
C. A. R. Hoare, Communicating Sequential Processes, Commun. ACM, vol. 21, n°8, pp. 666–677, August 1978.
L. Lamport, Time, clocks, and the ordering of events in a distributed system, Commun. ACM, vol.21, n° 7, pp. 558–565, July 1978.
B. Lampson and H. Sturgis, Atomic transactions, in Lecture Notes in Computer Science, vol. 105, New York: Springer-Verlag, 1981, pp. 246–265.
B. Liskov, Distributed programming in ARGUS, Commun. ACM, vol. 31, n° 3, pp. 300–312, March 1988.
J. G. Mitchell and J. Dion, A comparison of two network-based file servers, Commun, of the ACM, vol. 25, n° 4, pp. 233–245, April 1982.
B.J.Nelson, Remote Procedure Call, Tech. Rep. CSL-81–9, Xerox Palo Alto Research Center, Palo Alto, Calif. 1981.
Schneider F.B. Fail-stop Processors in Digest of Papers from Spring Compon’83. March, San-Francisco 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morin, C. (1989). A Fault-tolerant Implementation of CSP Input-Output Commands. In: Görke, W., Sörensen, H. (eds) Fehlertolerierende Rechensysteme / Fault-tolerant Computing Systems. Informatik-Fachberichte, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75002-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-75002-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51565-4
Online ISBN: 978-3-642-75002-1
eBook Packages: Springer Book Archive