Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Age-Memory Trade-off in Read-Copy-Update (2402.06860v1)

Published 10 Feb 2024 in cs.IT, cs.OS, and math.IT

Abstract: In the realm of shared memory systems, the challenge of reader-writer synchronization is closely coupled with the potential for readers to access outdated updates. Read-Copy-Update (RCU) is a synchronization primitive that allows for concurrent and non-blocking read access to fresh data. This is achieved through the creation of updated data copies, with each prior version retained until all associated read-locks are released. Given the principle that frequent updating keeps information fresh, the concern is whether we accumulate an infinite number of update copies, leading to excessively large memory usage. This paper analyzes trade-offs between memory usage and update age within real-time status updating systems, focusing specifically on RCU. The analysis demonstrates that with finite read time and read request rate, the average number of updates within the system remains bounded.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. P. Goldsborough, “ipc-bench,” [Online]. Available from: https://github.com/goldsborough/ipc-bench, 2022.
  2. P. E. McKenney and J. D. Slingwine, “Read-copy update: Using execution history to solve concurrency problems,” in Parallel and Distributed Computing and Systems, vol. 509518.   Citeseer, 1998, pp. 509–518.
  3. V. Ramani, J. Chen, and R. D. Yates, “Lock-based or lock-less: Which is fresh?” 2023.
  4. ——, “Timely mobile routing: An experimental study,” 2023.
  5. R. Mur-Artal and J. D. Tardos, “Orb-slam2: An open-source slam system for monocular, stereo, and rgb-d cameras,” IEEE Transactions on Robotics, vol. 33, no. 5, p. 1255–1262, Oct. 2017. [Online]. Available: http://dx.doi.org/10.1109/TRO.2017.2705103
  6. S. Semenova, S. Y. Ko, Y. D. Liu, L. Ziarek, and K. Dantu, “A quantitative analysis of system bottlenecks in visual slam,” in Proceedings of the 23rd Annual International Workshop on Mobile Computing Systems and Applications, ser. HotMobile ’22.   New York, NY, USA: Association for Computing Machinery, 2022, p. 74–80. [Online]. Available: https://doi.org/10.1145/3508396.3512882
  7. A. J. Ben Ali, M. Kouroshli, S. Semenova, Z. S. Hashemifar, S. Y. Ko, and K. Dantu, “Edge-slam: Edge-assisted visual simultaneous localization and mapping,” ACM Trans. Embed. Comput. Syst., vol. 22, no. 1, oct 2022. [Online]. Available: https://doi.org/10.1145/3561972
  8. P. E. Mckenney, J. Appavoo, A. Kleen, O. Krieger, O. Krieger, R. Russell, D. Sarma, and M. Soni, “Read-copy update,” in In Ottawa Linux Symposium, 2001, pp. 338–367.
  9. P. E. McKenney, “What is rcu? – “read, copy, update”,” [Online]. Available from: https://www.kernel.org/doc/html/latest/RCU/whatisRCU.html.
  10. D. Guniguntala, P. E. McKenney, J. Triplett, and J. Walpole, “The read-copy-update mechanism for supporting real-time applications on shared-memory multiprocessor systems with linux,” IBM Systems Journal, vol. 47, no. 2, pp. 221–236, 2008.
  11. M. Desnoyers, P. E. McKenney, A. S. Stern, M. R. Dagenais, and J. Walpole, “User-level implementations of read-copy update,” IEEE Trans. Parallel Distributed Syst., vol. 23, no. 2, pp. 375–382, 2012. [Online]. Available: https://doi.org/10.1109/TPDS.2011.159
  12. R. D. Yates and S. K. Kaul, “The age of information: Real-time status updating by multiple sources,” IEEE Transactions on Information Theory, vol. 65, no. 3, pp. 1807–1827, 2018.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com