Enhancing the Scalable Asynchronous Cache Consistency Scheme with the Clock Algorithm

Abstract

: In recent years, mobile computing has seen significant advancements, largely driven by the development and expansion of wireless networks. This technological evolution has given rise to various models and strategies designed to enhance user experience by speeding up query responses, reducing network traffic, and optimizing the use of network resources. One notable model that exemplifies these advancements is the Scalable Asynchronous Cache Consistency Scheme (SACCS). SACCS employs a hybrid data consistency strategy to ensure the integrity of cached data, offering an alternative to traditional stateful and stateless approaches. Additionally, SACCS utilizes the Least Recently Used (LRU) replacement algorithm to manage its cached data items efficiently. In this paper, we delve into the workings of SACCS, particularly focusing on its integration with three other replacement strategies: CLOCK, Longest Distance First (LDF), and Least Frequently Used with Dynamic Aging (LFU-DA). Through comprehensive simulations, we assess the performance of these algorithms in comparison to pre-existing methods. Our findings reveal that the CLOCK replacement strategy outperforms the others, demonstrating superior efficiency in managing cached data. The implications of this study suggest that adopting the CLOCK strategy within SACCS can significantly enhance mobile computing performance, making it a valuable consideration for future developments in this field. This research contributes to the ongoing efforts to refine caching techniques and optimize network resource utilization in the ever-evolving landscape of mobile computing.