"After all, the engineers only needed to refuse to fix anything, and modern industry would grind to a halt." -Michael Lewis

For Doers

Improving Java IO Performance: Caching Data, When Appropriate


The sample code for this post can be found on GitHub.

The biggest bottleneck with I/O resources on the filesystem is the operating system, which controls access to the filesystem. Reading from, and writing to, the operating system, is much more expensive than storing data in memory, and that is the subject of this post: caching.

Caching is the process of storing the result of some operation for later use. For a web application that makes a database query, then parses a template and returns a result, it may be advantageous to cache the result and just pop out that result on the server. In that case, we would be limiting the need to call a relatively expensive operation (first invoking the web application and all its layers, including a database query and a template parsing), by only calling it when it was time to cache (store) the result.

In the case of the filesystem, since our computational bottleneck is the operating system, we may sometimes have need to go over a file's contents multiple times. If the file is a reasonable size and won't exceed available memory, it would be advantageous to call the OS once, then use the result of that call whenever a resource needs it.

To prove this principle is faster, let's set up a JMH test with Junit:

    public static void runBenchmark(Class clazz) throws Exception {
        Options options = new OptionsBuilder()
                .include(clazz.getName() + ".*")
                // OS bottleneck, so we use should one
                // thread at a time for accurate results

        new Runner(options).run();
    public void launch() throws Exception {

In this first benchmark case, we will iterate ten times over loading a file, and we will make a call to the operating system each time we want the file:

    public void loadWholeFileThenScan() throws Exception {
        for (int i = 0; i < 10; i++) {
            List<String> linesInFile = readLinesOfFileFromDisk(Utils.smallCsvFilePath);

    private void assertLinesCorrect(List<String> lines) {
        for (String line : lines) {

    private List<String> readLinesOfFileFromDisk(String filePath) throws Exception {
        List<String> listofLines = new ArrayList<>();

        try (FileReader fileReader = new FileReader(filePath);
             BufferedReader bufferedReader = new BufferedReader(fileReader)) {

        return listofLines;

And the comparison case will store the result in memory (caching) and give us the cached copy whenever we ask for it:

    public void loadCachedFilesThenScan() throws Exception {
        for (int i = 0; i < 10; i++) {
            List<String> linesInFile = getLinesOfFileCached(Utils.smallCsvFilePath);

    private static List<String> cachedLines;

    private List<String> getLinesOfFileCached(String filePath) throws Exception {
        if (cachedLines == null) {
            cachedLines = readLinesOfFileFromDisk(filePath);
        return cachedLines;

In this case, the performance of the relative approaches on my machine is:

Benchmark                             Mode  Cnt   Score   Error  Units
CachingTests.loadCachedFilesThenScan  avgt    2  ≈ 10⁻⁴          ms/op
CachingTests.loadWholeFileThenScan    avgt    2   0.210          ms/op

Or a pretty massive improvement over making repeated OS calls.

Here's a book I wrote on Java. Read it for free on this site.