EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Formal Analysis of Distributed Shared Memory Algorithms

Muhammad Atif, Mudassar Naseer, Ahmad Salman Khan

UMT Artificial Intelligence Review · 2023

DOI: 10.32350/umtair.22.02 ↗

Kurz gefasst

Fachartikel in der Zeitschrift UMT Artificial Intelligence Review, 2023. Verfasst von Muhammad Atif und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocesses setup. Memory is considered coherent if a read operation provides the same data written in the last write operation. The problem has been addressed in the literature using different algorithms, although the correctness of a distributed algorithm remains questionable. Formal verification is the principal term for a group of techniques that routinely use an analysis established on mathematical transformations to conclude the rightness of the hardware or software behavior in divergence to dynamic verification techniques. The current study employed UPPAAL model checker to model the Dynamic Distributed algorithm for shared virtual memory given by K. Li and P. Hudak. The results showed that the Dynamic Distributed algorithm for shared virtual memory partially fulfils its functional requirements.

Zitieren

APA

Atif, M., Naseer, M., & Khan, A. S. (2023). Formal Analysis of Distributed Shared Memory Algorithms. UMT Artificial Intelligence Review. https://doi.org/10.32350/umtair.22.02

Vancouver

Atif M, Naseer M, Khan AS. Formal Analysis of Distributed Shared Memory Algorithms. UMT Artificial Intelligence Review. 2023. doi:10.32350/umtair.22.02

BibTeX
@article{Atif2023,
  author = {Atif, Muhammad and Naseer, Mudassar and Khan, Ahmad Salman},
  title = {Formal Analysis of Distributed Shared Memory Algorithms},
  journal = {UMT Artificial Intelligence Review},
  year = {2023},
  doi = {10.32350/umtair.22.02}
}
Kostenlos starten →