An Improved Lazy Release Consistency Model
Chapram Sudhakar & T. Ramesh
Journal of Computer Science, Volume 5, Issue 11, pp. 778–782 · doi.org/10.3844/jcssp.2009.778.782
Abstract
Problem statement: A network of workstations, viewed as a distributed shared memory system can be used to develop and test parallel algorithms. Approach: For implementing parallel algorithms on such DSMs shared memory consistency model plays a vital role. Results: However on a LAN, strict consistency models like Sequential Consistency model (SC) are not useful since the communication is slow. In such environments relaxed models like Entry Consistency (EC), Release Consistency (RC) or their variations such as Lazy Release Consistency (LRC) are generally used. Conclusion/Recommendations: In this study an Improved Lazy Release Consistency (ILRC) model is proposed. This model is studied with standard parallel algorithms. In many cases the ILRC model is proved to work better than the LRC model.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Sudhakar, C. & Ramesh, T. (2009). An Improved Lazy Release Consistency Model. Journal of Computer Science, 5(11), 778–782. https://doi.org/10.3844/jcssp.2009.778.782
- Licence
- © Science Publications
- Issue
- Volume 5, Issue 11
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
