Analysis of shared memory in Distributed and non Distributed environment

Shared memory, one of the most popular models for programming parallel platforms, is becoming ubiquitous both in low-end workstations and high-end servers. With the advent of low-latency networking hardware, clusters of workstations strive to offer the same processing power as high-end servers for a fraction of the cost. In such environments, shared memory has been limited to page-based systems that control access to shared memory using the memory' s page protection to implement shared memory coherence protocols. Unfortunately, In distributed and parallel computing system, efficient memory sharing, that is free from false-sharing and fragmentation issue and consistent, of data intensive applications is one of the most essential and difficult issues without degrading the system efficiency. Therefore proposed analysis is to simulating the behavior of the existing distributed shared memory programming model to find out some way to improve the efficiency. In Distributed shared memory environment, a process may require access to remotely available data. So the aim is to propose a distributed shared memory programming model which will maximize the utilization of shared memory, at the same time, a high degree of parallelism and efficiency.