Document Open Access Logo

Non-Linear Paging

Authors Ilan Doron-Arad, Joseph (Seffi) Naor

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.57.pdf
  • Filesize: 0.72 MB
  • 19 pages

Document Identifiers

Author Details

Ilan Doron-Arad
  • Computer Science Department, Technion, Haifa, Israel
Joseph (Seffi) Naor
  • Computer Science Department, Technion, Haifa, Israel

Funding

  • Naor, Joseph (Seffi): Supported in part by Israel Science Foundation grant 2233/19 and United States - Israel Binational Science Foundation (BSF) grant 2033185.

Cite AsGet BibTex

Ilan Doron-Arad and Joseph (Seffi) Naor. Non-Linear Paging. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 57:1-57:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.57

Abstract

We formulate and study non-linear paging - a broad model of online paging where the size of subsets of pages is determined by a monotone non-linear set function of the pages. This model captures the well-studied classic weighted paging and generalized paging problems, and also submodular and supermodular paging, studied here for the first time, that have a range of applications from virtual memory to machine learning. Unlike classic paging, the cache threshold parameter k does not yield good competitive ratios for non-linear paging. Instead, we introduce a novel parameter 𝓁 that generalizes the notion of cache size to the non-linear setting. We obtain a tight deterministic 𝓁-competitive algorithm for general non-linear paging and a o(log²𝓁)-competitive lower bound for randomized algorithms. Our algorithm is based on a new generic LP for the problem that captures both submodular and supermodular paging, in contrast to LPs used for submodular cover settings. We finally focus on the supermodular paging problem, which is a variant of online set cover and online submodular cover, where sets are repeatedly requested to be removed from the cover. We obtain polylogarithmic lower and upper bounds and an offline approximation algorithm.

Subject Classification

ACM Subject Classification
  • Theory of computation
Keywords
  • paging
  • competitive analysis
  • non-linear paging
  • submodular and supermodular functions

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Anna Adamaszek, Artur Czumaj, Matthias Englert, and Harald Räcke. An o (log k)-competitive algorithm for generalized caching. ACM Transactions on Algorithms (TALG), 15(1):1-18, 2018. Google Scholar
  2. Noga Alon, Baruch Awerbuch, and Yossi Azar. The online set cover problem. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 100-105, 2003. Google Scholar
  3. Bo Bai, Li Wang, Zhu Han, Wei Chen, and Tommy Svensson. Caching based socially-aware d2d communications in wireless content delivery networks: A hypergraph framework. IEEE Wireless Communications, 23(4):74-81, 2016. Google Scholar
  4. Nikhil Bansal, Niv Buchbinder, and Joseph Naor. A primal-dual randomized algorithm for weighted paging. Journal of the ACM (JACM), 59(4):1-24, 2012. Google Scholar
  5. Nikhil Bansal, Niv Buchbinder, and Joseph Naor. Randomized competitive algorithms for generalized caching. SIAM Journal on Computing, 41(2):391-414, 2012. Google Scholar
  6. Catriel Beeri, Ronald Fagin, David Maier, and Mihalis Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM (JACM), 30(3):479-513, 1983. Google Scholar
  7. John K Bennett, John B Carter, and Willy Zwaenepoel. Adaptive software cache management for distributed shared memory architectures. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 125-134, 1990. Google Scholar
  8. Pei Cao and Sandy Irani. Cost-AwareWWW proxy caching algorithms. In USENIX Symposium on Internet Technologies and Systems (USITS 97), 1997. Google Scholar
  9. Tao Cheng, Kuochen Wang, Li-Chun Wang, and Chain-Wu Lee. An in-switch rule caching and replacement algorithm in software defined networks. In 2018 IEEE International Conference on Communications (ICC), pages 1-6. IEEE, 2018. Google Scholar
  10. Christian Coester, Roie Levin, Joseph Naor, and Ohad Talmon. Competitive algorithms for block-aware caching. In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, pages 161-172, 2022. Google Scholar
  11. Peter J Denning. Virtual memory. ACM Computing Surveys (CSUR), 2(3):153-189, 1970. Google Scholar
  12. Mianxiong Dong, He Li, Kaoru Ota, and Jiang Xiao. Rule caching in sdn-enabled mobile access networks. IEEE Network, 29(4):40-45, 2015. Google Scholar
  13. Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, and Hadas Shachnai. Approximations and hardness of packing partially ordered items. In proc. WG, 2024. Google Scholar
  14. Ilan Doron-Arad and Joseph Naor. Non-linear paging, 2024. URL: https://arxiv.org/abs/2404.13334.
  15. Amos Fiat, Richard M Karp, Michael Luby, Lyle A McGeoch, Daniel D Sleator, and Neal E Young. Competitive paging algorithms. Journal of Algorithms, 12(4):685-699, 1991. Google Scholar
  16. Samoda Gamage and Ajith Pasqual. High performance parallel packet classification architecture with popular rule caching. In 2012 18th IEEE International Conference on Networks (ICON), pages 52-57. IEEE, 2012. Google Scholar
  17. Peixuan Gao, Yang Xu, and H Jonathan Chao. Ovs-cab: Efficient rule-caching for open vswitch hardware offloading. Computer Networks, 188:107844, 2021. Google Scholar
  18. Yue Gao, Meng Wang, Zheng-Jun Zha, Jialie Shen, Xuelong Li, and Xindong Wu. Visual-textual joint relevance learning for tag-based social image search. IEEE Transactions on Image Processing, 22(1):363-376, 2012. Google Scholar
  19. Gourab Ghoshal, Vinko Zlatić, Guido Caldarelli, and Mark EJ Newman. Random hypergraphs and their applications. Physical Review E, 79(6):066118, 2009. Google Scholar
  20. Anupam Gupta and Roie Levin. The online submodular cover problem. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1525-1537. SIAM, 2020. Google Scholar
  21. Huawei Huang, Song Guo, Peng Li, Weifa Liang, and Albert Y Zomaya. Cost minimization for rule caching in software defined networking. IEEE Transactions on Parallel and Distributed Systems, 27(4):1007-1016, 2015. Google Scholar
  22. Jin Huang, Rui Zhang, and Jeffrey Xu Yu. Scalable hypergraph learning and processing. In 2015 IEEE International Conference on Data Mining, pages 775-780. IEEE, 2015. Google Scholar
  23. Simon Korman. On the use of randomization in the online set cover problem. Weizmann Institute of Science, 2, 2004. Google Scholar
  24. He Li, Song Guo, Chentao Wu, and Jie Li. Fdrc: Flow-driven rule caching optimization in software defined networking. In 2015 IEEE International Conference on Communications (ICC), pages 5777-5782. IEEE, 2015. Google Scholar
  25. Rui Li, Yu Pang, Jin Zhao, and Xin Wang. A tale of two (flow) tables: Demystifying rule caching in openflow switches. In Proceedings of the 48th International Conference on Parallel Processing, pages 1-10, 2019. Google Scholar
  26. Rui Li, Bohan Zhao, Ruixin Chen, and Jin Zhao. Taming the wildcards: Towards dependency-free rule caching with freecache. In 2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS), pages 1-10. IEEE, 2020. Google Scholar
  27. Shijing Li and Tian Lan. Hotdedup: Managing hot data storage at network edge through optimal distributed deduplication. In 39th IEEE Conference on Computer Communications, INFOCOM 2020, Toronto, ON, Canada, July 6-9, 2020, pages 247-256. IEEE, 2020. Google Scholar
  28. David J Lilja. Cache coherence in large-scale shared-memory multiprocessors: Issues and comparisons. ACM Computing Surveys (CSUR), 25(3):303-338, 1993. Google Scholar
  29. Qingshan Liu, Yuchi Huang, and Dimitris N Metaxas. Hypergraph with sampling for image retrieval. Pattern Recognition, 44(10-11):2255-2262, 2011. Google Scholar
  30. Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM (JACM), 41(5):960-981, 1994. Google Scholar
  31. Keisuke Murakami and Takeaki Uno. Efficient algorithms for dualizing large-scale hypergraphs. In 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pages 1-13. SIAM, 2013. Google Scholar
  32. Rob Patro and Carl Kingsford. Predicting protein interactions via parsimonious network history inference. Bioinformatics, 29(13):i237-i246, 2013. Google Scholar
  33. Seyed Hamed Rastegar, Aliazam Abbasfar, and Vahid Shah-Mansouri. Rule caching in sdn-enabled base stations supporting massive iot devices with bursty traffic. IEEE Internet of Things Journal, 7(9):8917-8931, 2020. Google Scholar
  34. Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, and Daniel S Menasché. Cooperative rule caching for sdn switches. In 2020 IEEE 9th International Conference on Cloud Networking (CloudNet), pages 1-7. IEEE, 2020. Google Scholar
  35. Ori Rottenstreich and János Tapolcai. Optimal rule caching and lossy compression for longest prefix matching. IEEE/ACM Transactions on Networking, 25(2):864-878, 2016. Google Scholar
  36. Nicolò Ruggeri, Martina Contisciani, Federico Battiston, and Caterina De Bacco. Community detection in large hypergraphs. Science Advances, 9(28):eadg9159, 2023. Google Scholar
  37. Jang-Ping Sheu and Yen-Cheng Chuo. Wildcard rules caching and cache replacement algorithms in software-defined networking. IEEE Transactions on Network and Service Management, 13(1):19-29, 2016. Google Scholar
  38. Daniel D Sleator and Robert E Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202-208, 1985. Google Scholar
  39. Michael Stonebraker, Anant Jhingran, Jeffrey Goh, and Spyros Potamianos. On rules, procedure, caching and views in data base systems. ACM SIGMOD Record, 19(2):281-290, 1990. Google Scholar
  40. G Edward Suh, Larry Rudolph, and Srinivas Devadas. Dynamic partitioning of shared cache memory. The Journal of Supercomputing, 28(1):7-26, 2004. Google Scholar
  41. Shulong Tan, Jiajun Bu, Chun Chen, Bin Xu, Can Wang, and Xiaofei He. Using rich social media information for music recommendation via hypergraph model. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM), 7(1):1-22, 2011. Google Scholar
  42. Ze Tian, TaeHyun Hwang, and Rui Kuang. A hypergraph-based learning algorithm for classifying gene expression and arraycgh data with prior knowledge. Bioinformatics, 25(21):2831-2838, 2009. Google Scholar
  43. Andrew W Wilson Jr. Hierarchical cache/bus architecture for shared memory multiprocessors. In Proceedings of the 14th annual international symposium on Computer architecture, pages 244-252, 1987. Google Scholar
  44. Laurence A Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica, 2(4):385-393, 1982. Google Scholar
  45. Bo Yan, Yang Xu, and H Jonathan Chao. Adaptive wildcard rule cache management for software-defined networks. IEEE/ACM Transactions on Networking, 26(2):962-975, 2018. Google Scholar
  46. Bo Yan, Yang Xu, Hongya Xing, Kang Xi, and H Jonathan Chao. Cab: A reactive wildcard rule caching system for software-defined networks. In Proceedings of the third workshop on Hot topics in software defined networking, pages 163-168, 2014. Google Scholar
  47. Jialun Yang, Tao Li, Jinli Yan, Junnan Li, Chenglong Li, and Baosheng Wang. Pipecache: High hit rate rule-caching scheme based on multi-stage cache tables. Electronics, 9(6):999, 2020. Google Scholar
  48. Neal E Young. On-line file caching. Algorithmica, 33(3):371-383, 2002. Google Scholar
  49. Dengyong Zhou, Jiayuan Huang, and Bernhard Schölkopf. Learning with hypergraphs: Clustering, classification, and embedding. Advances in neural information processing systems, 19, 2006. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact