Abstract
Memory coherence is the most fundamental re-quirement in a shared virtual memory system where there are concurrent as well as loosely coupled processes. These processes can demand a page for reading or writing. The memory is called coherent if the last update in a page remains constant for each process until the owner of that page does not change it. The ownership is transferred to a process interested to update that page. In [Kai LI, and Paul Hudak. Memory Coherence in Shared Virtual Memory Systems, 1986. Proc. of Fifth Annual ACM Symposium on Principles of Distributed Computing.], algorithms ensuring memory coherence are given. We formally specify these protocols and report the improvements through formal analysis. The protocols are specified in UPPAAL, i.e., a tool for modeling, validation and verification of real-time systems.
Highlights
In a loosely coupled multiprocessors system, virtual memory is useful due to its parallel infrastructure instead of using memory hierarchy
The shared virtual discussed in [1] provides address space which is shared among all processors in the loosely coupled distributed memory multiprocessors systems
[3] Kai Li et al are focusing on memory coherence problem for shared virtual memory and they provide a number of algorithms as a to solve memory coherence problem
Summary
In a loosely coupled multiprocessors system, virtual memory is useful due to its parallel infrastructure instead of using memory hierarchy. The problem that Kai Li faced in building the shared virtual memory was memory coherence problem and in [3] Kai Li et al are focusing on memory coherence problem for shared virtual memory and they provide a number of algorithms as a to solve memory coherence problem. These algorithms include the Central Manager algorithm in which the manager is just like a monitor. We formally specify the algorithms using UPPAAL This is comprehensive analysis of the algorithms provided in [1] along with the verification of detailed functional requirements. We give the formal specification of algorithms in functionalism: the timed automata language of UPPAAL [4]
Sign-in/Register to view highlights & summary 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 callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: 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.
