Fractal approach for probabilistic flow cache maintenance
作者： Thomas Graf , Daniel Borkmann , Francesco Fusco
DOI:
关键词: Flow (psychology) 、 Cache 、 Value (computer science) 、 Data structure 、 Computer science 、 Layer (object-oriented design) 、 Probabilistic logic 、 Point (geometry) 、 Fractal 、 Parallel computing
摘要: An apparatus sets a layer counter to point first of data structure. The determines the reference an overflowing cell. increments second incremented non-overflowing value cell, wherein is stored in cache and cache, differs from with respect one or more speed size.
google.de 参考文章(19)
Alicia da Conceicao, Martin Feldhofer, Franz Amtmann, Soenke Ostertun, Electronic counter in non-volatile limited endurance memory ,(2013)
Kattamuri Ekanadham, Il Park, Event tracking hardware ,(2009)
Clifford Paul Strom, Brian Patrick Evans, Michael Yiu-Kwan Siu, Multi-level nested open hashed data stores ,(2004)
Ioannis Koltsidas, Evangelos S. Eleftheriou, Michael T. Benhase, Lokesh M. Gupta, Karl A. Nielsen, Xiao-Yu Hu, Robert Haas, Stephen L. Blinick, Matthew J. Kalos, Roman A. Pletka, Promotion of partial data segments in flash cache ,(2011)
Koby Reshef, David Shyken, Yochai Parchak, Amir Cohen, ATM linked list buffer system ,(2002)
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese, An Improved Construction for Counting Bloom Filters Lecture Notes in Computer Science. pp. 684- 695 ,(2006) , 10.1007/11841036_61
Michael J. Massey, Paul S. Odom, Tiered hashing for data access ,(2000)
Amit Sinha, Distribution of flows in a flow-based multi-processor system ,(2004)
Andrei Broder, Michael Mitzenmacher, Network Applications of Bloom Filters: A Survey Internet Mathematics. ,vol. 1, pp. 485- 509 ,(2004) , 10.1080/15427951.2004.10129096