{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:01:19Z","timestamp":1751774479812,"version":"3.41.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319943398"},{"type":"electronic","value":"9783319943404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94340-4_2","type":"book-chapter","created":{"date-parts":[[2018,6,15]],"date-time":"2018-06-15T17:12:26Z","timestamp":1529082746000},"page":"18-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Modular Framework for Data Prefetching and Replacement at the Edge"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7477-1973","authenticated-orcid":false,"given":"Dusan","family":"Ramljak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak Abraham","family":"Tom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doug","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishna","family":"Kant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,16]]},"reference":[{"issue":"7","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1016\/j.future.2013.01.010","volume":"29","author":"J Gubbi","year":"2013","unstructured":"Gubbi, J., et al.: Internet of things (IoT): a vision, architectural elements, and future directions. Future Gener. Comput. Syst. 29(7), 1645\u20131660 (2013)","journal-title":"Future Gener. Comput. Syst."},{"key":"2_CR2","unstructured":"Rose, K., et al.: The Internet of Things: An Overview. The Internet Society"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.29268\/stcc.2015.0009","volume":"3","author":"S Kolb","year":"2015","unstructured":"Kolb, S., Lenhard, J., Wirtz, G.: Application migration effort in the cloud. Serv. Trans. Cloud Comput. 3(4), 1\u201315 (2015)","journal-title":"Serv. Trans. Cloud Comput."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Zhang, F., et al.: Edgebuffer: caching and prefetching content at the edge in the mobility first future internet architecture. In: 2015 IEEE 16th International Symposium on World of Wireless, Mobile and Multimedia Networks (WoWMoM), pp. 1\u20139. IEEE (2015)","DOI":"10.1109\/WoWMoM.2015.7158137"},{"key":"2_CR5","unstructured":"Gill, B.S., Bathen, L.A.D.: AMP: adaptive multi-stream prefetching in a shared cache. In: FAST, vol. 7, pp. 185\u2013198 (2007)"},{"key":"2_CR6","unstructured":"Ar\u0131, \u0130., et al.: ACME: adaptive caching using multiple experts. In: Proceedings in Informatics, vol. 14 (2002)"},{"key":"2_CR7","unstructured":"Megiddo, N., Modha, D.S.: ARC: a self-tuning, low overhead replacement cache. In: FAST, vol. 3, pp. 115\u2013130 (2003)"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1145\/356887.356892","volume":"14","author":"AJ Smith","year":"1982","unstructured":"Smith, A.J.: Cache memories. ACM Comput. Surv. (CSUR) 14(3), 473\u2013530 (1982)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"2_CR9","unstructured":"Tcheun, M.K., et al.: An adaptive sequential prefetching scheme in shared-memory multiprocessors. In: Proceedings of the 1997 International Conference on Parallel Processing, pp. 306\u2013313. IEEE (1997)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Pendse, R., Bhagavathula, R.: Pre-fetching with the segmented LRU algorithm. In: 42nd Midwest Symposium on Circuits and Systems, vol. 2 (1999)","DOI":"10.1109\/MWSCAS.1999.867771"},{"key":"2_CR11","unstructured":"Gill, B.S., Modha, D.S.: SARC: sequential prefetching in adaptive replacement cache. In: USENIX Annual Technical Conference, General Track, pp. 293\u2013308 (2005)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/223586.223608","volume":"23","author":"P Cao","year":"1995","unstructured":"Cao, P., et al.: A study of integrated prefetching and caching strategies. ACM SIGMETRICS Perform. Eval. Rev. 23(1), 188\u2013197 (1995)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/170036.170077","volume":"22","author":"KM Curewitz","year":"1993","unstructured":"Curewitz, K.M., et al.: Practical prefetching via data compression. ACM SIGMOD Rec. 22, 257\u2013266 (1993)","journal-title":"ACM SIGMOD Rec."},{"key":"2_CR14","unstructured":"Griffioen, J., Appleton, R.: Performance measurements of automatic prefetching. In: Parallel and Distributed Computing Systems, pp. 165\u2013170 (1995)"},{"key":"2_CR15","unstructured":"Madhyastha, T.M.: Automatic Classification of Input\/Output Access Patterns. Ph.D. thesis, University of Illinois at Urbana-Champaign (1997)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Madhyastha, T.M., Reed, D.A.: Input\/output access pattern classification using hidden Markov models. In: Proceedings of the Fifth Workshop on I\/O in Parallel and Distributed Systems, pp. 57\u201367. ACM (1997)","DOI":"10.1145\/266220.266226"},{"key":"2_CR17","unstructured":"Yang, S., et al.: Tombolo: performance enhancements for cloud storage gateways. In: Proceedings of the 32nd International Conference on Massive Storage Systems and Technology (MSST 2016) (2016)"},{"key":"2_CR18","unstructured":"Li, Z., et al.: C-miner: Mining block correlations in storage systems. In: FAST, vol. 4, pp. 173\u2013186 (2004)"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/269005.266706","volume":"31","author":"Geoffrey H. Kuenning","year":"1997","unstructured":"Kuenning, G.H., Popek, G.J.: Automated hoarding for mobile computers, vol. 31. ACM (1997)","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/69.204094","volume":"5","author":"KS Grimsrud","year":"1993","unstructured":"Grimsrud, K.S., et al.: Multiple prefetch adaptive disk caching. IEEE Trans. Knowl. Data Eng. 5(1), 88\u2013103 (1993)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Joseph, D., Grunwald, D.: Prefetching using Markov predictors. In: Proceedings of the 24th Annual International Symposium on Computer Architecture, ISCA 1997, pp. 252\u2013263 (1997)","DOI":"10.1145\/264107.264207"},{"key":"2_CR22","unstructured":"Palmer, M., Zdonik, S.B.: Fido: a cache that learns to fetch. Brown University, Department of Computer Science (1991)"},{"key":"2_CR23","unstructured":"Kroeger, T.M., Long, D.D.: Design and implementation of a predictive file prefetching algorithm. In: USENIX Annual Technical Conference, General Track"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"He, J., et al.: Knowac: I\/O prefetch via accumulated knowledge. In: 2012 IEEE International Conference on Cluster Computing (CLUSTER), pp. 429\u2013437. IEEE (2012)","DOI":"10.1109\/CLUSTER.2012.83"},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1145\/234752.234753","volume":"43","author":"JS Vitter","year":"1996","unstructured":"Vitter, J.S., Krishnan, P.: Optimal prefetching via data compression. J. ACM 43(5), 771\u2013793 (1996)","journal-title":"J. ACM"},{"key":"2_CR26","unstructured":"Lei, H., Duchamp, D.: An analytical approach to file prefetching. In: USENIX Annual Technical Conference, pp. 275\u2013288 (1997)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Lin, L., et al.: AMP: an affinity-based metadata prefetching scheme in large-scale distributed storage systems. In: 8th IEEE International Symposium on Cluster Computing and the Grid, CCGRID 2008, pp. 459\u2013466. IEEE (2008)","DOI":"10.1109\/CCGRID.2008.117"},{"key":"2_CR28","unstructured":"Gu, P., et al.: Nexus: a novel weighted-graph-based prefetching algorithm for metadata servers in petabyte-scale storage systems. In: 6th IEEE International Symposium on Cluster Computing and the Grid, CCGRID 2006, vol. 1, pp. 409\u2013416. IEEE (2006)"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Cortes, T., Labarta, J.: Linear aggressive prefetching: a way to increase the performance of cooperative caches. In: Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IPPS\/SPDP, pp. 46\u201354. IEEE (1999)","DOI":"10.1109\/IPPS.1999.760433"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Dahlgren, F., et al.: Fixed and adaptive sequential prefetching in shared memory multiprocessors. In: International Conference on Parallel Processing, ICPP 1993, vol. 1, pp. 56\u201363. IEEE (1993)","DOI":"10.1109\/ICPP.1993.92"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"He, J., et al.: I\/O acceleration with pattern detection. In: Proceedings of the 22nd International Symposium on High-Performance Parallel and Distributed Computing, pp. 25\u201336. ACM (2013)","DOI":"10.1145\/2462902.2462909"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Miller, J.A., Ramaswamy, L., Kochut, K.J., Fard, A.: Directions for big data graph analytics research. Int. J. Big Data 2(1) (2015)","DOI":"10.29268\/stbd.2015.2.1.2"},{"key":"2_CR33","unstructured":"Griffioen, J., Appleton, R.: Reducing file system latency using a predictive approach. In: USENIX Summer, pp. 197\u2013207 (1994)"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Oly, J., Reed, D.A.: Markov model prediction of I\/O requests for scientific applications. In: Proceedings of the 16th International Conference on Supercomputing, pp. 147\u2013155. ACM (2002)","DOI":"10.1145\/514191.514214"}],"container-title":["Lecture Notes in Computer Science","Edge Computing \u2013 EDGE 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94340-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:28:34Z","timestamp":1751689714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94340-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319943398","9783319943404"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94340-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EDGE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Edge Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"edge2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theedgecomputing.org\/2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"www.confhub.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}