Abstract
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 showing how a particular run of a program fails to meet its specifications. The lack of a global time frame and the disjoint address spaces of the constituent processes makes the extrapolation of the sequential tracing technique into the domain of distributed systems difficult. This article develops a means by which a distributed program that uses synchronous communication may be traced.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
