From 3b5c29d2882ac66a21404614ad9fa4a7e88df9f7 Mon Sep 17 00:00:00 2001 From: Martin Mares <mj@ucw.cz> Date: Fri, 21 Feb 2020 18:04:09 +0100 Subject: [PATCH] Cache: English --- 05-cache/cache.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/05-cache/cache.tex b/05-cache/cache.tex index 6999cd2..90ba6c8 100644 --- a/05-cache/cache.tex +++ b/05-cache/cache.tex @@ -95,7 +95,7 @@ read sequentially from the start to the end. This is called an \em{array scan.} In the I/O model, we can make the array start at a~block boundary. So we need to read $\lceil N/B\rceil \le N/B+1$ consecutive blocks to scan all items. All blocks can -be stored at the same place in the internal memory. This is obviously optimal. +be stored at the same place in the internal memory. This strategy is obviously optimal. A~cache-aware algorithm can use the same sequence of reads. Generally, we do not know the sequence of reads used by the optimal caching strategy, but any specific sequence -- GitLab