Academic Journals Database
Disseminating quality controlled scientific knowledge

Automated Verification of Memory Consistencies of DSM System on Unified Framework

ADD TO MY LIST
 
Author(s): Dr. Pankaj Kumar, Durgesh Kumar

Journal: International Journal of Advanced Computer Research
ISSN 2249-7277

Volume: 2;
Issue: 6;
Start page: 139;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Distributed Shared Memory (DSM) system | automated verification of processor Consistency (PC)

ABSTRACT
The consistency model of a DSM system specifiesthe ordering constraints on concurrent memoryaccesses by multiple processors, and hence hasfundamental impact on DSM systems’programming convenience and implementationefficiency. We have proposed the structural modelfor automated verification of memoryconsistencies of DSM System. DSM allowsprocesses to assume a globally shared virtualmemory even though they execute on nodes thatdo not physically share memory. The DSMsoftware provide the abstraction of a globallyshared memory in which each processor canaccess any data item without the programmerhaving to worry about where the data is or how toobtain its value In contrast in the nativeprogramming model on networks of workstationsmessage passing the programmer must decidewhen a processor needs to communicate withwhom to communicate and what data to be send.On a DSM system the programmer can focus onalgorithmic development rather than onmanaging partitioned data sets andcommunicating values. The programminginterfaces to DSM systems may differ in a varietyof respects. The memory model refers to howupdates to distributed shared memory are rejectedto the processes in the system. The most intuitivemodel of distributed shared memory is that a readshould always return the last value writtenunfortunately the notion of the last value writtenis not well defined in a distributed system.
Why do you need a reservation system?      Affiliate Program