Formal Analysis of Distributed Shared Memory Algorithms

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:UMT Artificial Intelligence Review Jg. 2; H. No 2
Hauptverfasser: Atif, Muhammad, Mudassar Naseer, Ahmad Salman Khan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: 22.03.2023
ISSN:2791-1268, 2791-1276
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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.
AbstractList 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.
Author Atif, Muhammad
Mudassar Naseer
Ahmad Salman Khan
Author_xml – sequence: 1
  givenname: Muhammad
  surname: Atif
  fullname: Atif, Muhammad
– sequence: 2
  surname: Mudassar Naseer
  fullname: Mudassar Naseer
– sequence: 3
  surname: Ahmad Salman Khan
  fullname: Ahmad Salman Khan
BookMark eNo9j71OwzAURi1UJErpyJ4XSLCvE7seo0IpUhED3a3rn1BLSYzsdMjbU1HEdD59w5HOPVmMcfSEPDJaceANfToPE4ZUAVQUbsgSpGIlAykW_1ts7sg652BoQyVXQtElkbuYBuyLdsR-ziEXsSueQ55SMOfJu-LzhOmCdz_ENBdt_xVTmE5DfiC3HfbZr_-4Isfdy3G7Lw8fr2_b9lBaKaFU1qJBZoQXDaNGClp7sE4o4b2tmauZApSXHzvrrOGNo4iq9tJah1Zu-IqUV61NMefkO_2dwoBp1ozq32597dYAmgL_AQF_T44
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.32350/umtair.22.02
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2791-1276
ExternalDocumentID 10_32350_umtair_22_02
GroupedDBID AAYXX
CITATION
M~E
ID FETCH-LOGICAL-c772-9ccaba1b6e6510b7604e2cd696eec41d4192a7b76afcdcb35d0aa94e7ccdac783
ISSN 2791-1268
IngestDate Sat Nov 29 02:26:32 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue No 2
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c772-9ccaba1b6e6510b7604e2cd696eec41d4192a7b76afcdcb35d0aa94e7ccdac783
OpenAccessLink https://doi.org/10.32350/umtair.22.02
ParticipantIDs crossref_primary_10_32350_umtair_22_02
PublicationCentury 2000
PublicationDate 2023-03-22
PublicationDateYYYYMMDD 2023-03-22
PublicationDate_xml – month: 03
  year: 2023
  text: 2023-03-22
  day: 22
PublicationDecade 2020
PublicationTitle UMT Artificial Intelligence Review
PublicationYear 2023
SSID ssib050739690
Score 1.8262565
Snippet The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocesses setup. Memory is considered coherent if a read...
SourceID crossref
SourceType Index Database
Title Formal Analysis of Distributed Shared Memory Algorithms
Volume 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2791-1276
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib050739690
  issn: 2791-1268
  databaseCode: M~E
  dateStart: 20210101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Ba9swFBal7aGXsbKVdl2HD2OX4NSWbSk-hq2lZUsoNIXczLMk14HECU5S0kt_-54kO3ZLD9lhF2OELCx_ek9P7z1_j5DvSoAhAXGFSAM3FAHKHEuVmzFf-hnu-B4Yyvw_fDjsjcfxXVUVdWnKCfCi6G028eK_Qo1tCLb-dfYf4N4Oig14j6DjFWHH607AX2srdPqKbeSXZsfVha20dZmblPOBzrB97vSnj_NyssorzvLKSn0YjLTXflKxS9y2aTtfBxP62Mn4VNc5zGYgG_wkWuVQovZeqiYBuJ9jn849THXk4HderczK6UADnXVFW35IymPf9amtiNNV7TZbzqVWrrS1hobzDn1Pawc0iHSe43q2gknZpbTr0WZ7qkPyb3atbS4hnmLMAIl9PKE00eSiB5RHsc7xG7xc1Qom0mFJZvxu2wlY3lUzwmX7BVp2SsvgGH0kH6qTgtO3CB-TPVV8Ityi69ToOvPMaaHrWHQdi67ToPuZjK6vRj9v3Kr2hSvwvOPGKFgp-ClTDJVmypkXKioki5lSIvSljt0Dx3bIhEQpi6QHEIeKCyFB8F5wQvaLeaFOiYNCCoyDL0LohZnHgAdhJiHikoGvpDgjP-qJJgvLcJK8-02_7NrxnBw1a-Yr2V-Va3VBDsXTarIsvxlE_gLqHk1Z
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Formal+Analysis+of+Distributed+Shared+Memory+Algorithms&rft.jtitle=UMT+Artificial+Intelligence+Review&rft.au=Atif%2C+Muhammad&rft.au=Mudassar+Naseer&rft.au=Ahmad+Salman+Khan&rft.date=2023-03-22&rft.issn=2791-1268&rft.eissn=2791-1276&rft.volume=2&rft.issue=No+2&rft_id=info:doi/10.32350%2Fumtair.22.02&rft.externalDBID=n%2Fa&rft.externalDocID=10_32350_umtair_22_02
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2791-1268&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2791-1268&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2791-1268&client=summon