This is known the duty of run time system—to deals with synchronization.
Implementation of the proposed approach and, specifically fault-tolerant semaphores will improve the performance of synchronization of the system and, at the
same time, make system resilient—no matter which process fails.
To our best knowledge, nobody neither proposed or implemented anything
similar and this is a subject of further modernization of any runtime system for
resilient computer systems.
12.8 Conclusion
• Structure of the runtime system for resilient compute is presented and explained.
• The concurrency problems of computing are outlined.
• Requirement for efficient concurrency handling are clarified.
• Shown similarities of concurrency problems for hardware and system software.
• A graph-logic model introduced explicitly separating concurrency and
parallelism.
• Control–data–predicates scheme explicitly shows a concurrency points in a
program.
• A concept of faul-tolerant semaphores for resilient computer systems is
presented.
• Tuning of known concurrency algorithms for new semaphores are explained.
Appendix: The Main Algebraic Books on Process Algebra
Are
Milner R. (1989): Communication and Concurrency, Prentice Hall
Hoare C.A.R. (1985): Communicating Sequential Processes, Prentice Hall
Hennessy M (1988): Algebraic Theory of Processes, MIT Press
Baeten J.C.M. & Weijland W.P. (1990): Process Algebra, Cambridge University
Press.
In turn, applications of the ACP approach explained and well-presented in
R. Milner R. (1990): Operational and algebraic semantics of concurrent processes,
in J. van Leeuwen, editor: Handbook of Theoretical Computer Science, Chapter 19,
Elsevier Science Publishers B.V. (North-Holland), pp. 1201–1242.
12.7 Concurrency: Further Steps: Fault-Tolerant Interactors
191
Implementation of the proposed approach and, specifically fault-tolerant semaphores will improve the performance of synchronization of the system and, at the
same time, make system resilient—no matter which process fails.
To our best knowledge, nobody neither proposed or implemented anything
similar and this is a subject of further modernization of any runtime system for
resilient computer systems.
12.8 Conclusion
• Structure of the runtime system for resilient compute is presented and explained.
• The concurrency problems of computing are outlined.
• Requirement for efficient concurrency handling are clarified.
• Shown similarities of concurrency problems for hardware and system software.
• A graph-logic model introduced explicitly separating concurrency and
parallelism.
• Control–data–predicates scheme explicitly shows a concurrency points in a
program.
• A concept of faul-tolerant semaphores for resilient computer systems is
presented.
• Tuning of known concurrency algorithms for new semaphores are explained.
Appendix: The Main Algebraic Books on Process Algebra
Are
Milner R. (1989): Communication and Concurrency, Prentice Hall
Hoare C.A.R. (1985): Communicating Sequential Processes, Prentice Hall
Hennessy M (1988): Algebraic Theory of Processes, MIT Press
Baeten J.C.M. & Weijland W.P. (1990): Process Algebra, Cambridge University
Press.
In turn, applications of the ACP approach explained and well-presented in
R. Milner R. (1990): Operational and algebraic semantics of concurrent processes,
in J. van Leeuwen, editor: Handbook of Theoretical Computer Science, Chapter 19,
Elsevier Science Publishers B.V. (North-Holland), pp. 1201–1242.
12.7 Concurrency: Further Steps: Fault-Tolerant Interactors
191