BPLRU: a buffer management scheme for improving random writes in flash storage
- Authors
- Hyojun KimS.T. Ahn
- Journal
- File and Storage Technologies
In The Last Decade
doi.org/w10063673 →Countries where authors are citing BPLRU: a buffer management scheme for improving random writes in flash storage
This map shows the geographic impact of BPLRU: a buffer management scheme for improving random writes in flash storage. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by BPLRU: a buffer management scheme for improving random writes in flash storage with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites BPLRU: a buffer management scheme for improving random writes in flash storage more than expected).
Fields of papers citing BPLRU: a buffer management scheme for improving random writes in flash storage
This network shows the impact of BPLRU: a buffer management scheme for improving random writes in flash storage. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the BPLRU: a buffer management scheme for improving random writes in flash storage.
About BPLRU: a buffer management scheme for improving random writes in flash storage
This paper, published in 2008, received 334 indexed citations . Written by Hyojun Kim and S.T. Ahn covering the research area of Computer Networks and Communications. It is primarily cited by scholars working on Computer Networks and Communications (332 citations), Hardware and Architecture (187 citations) and Computational Theory and Mathematics (42 citations). Published in File and Storage Technologies.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/w10063673.