The solution is to allocate each program its own block of memory.

解决方案是为每个程序分配自己的内存块。

Operating Systems attempt to sandbox applications by giving each their own block of memory that others programs can't touch.

操作系统试图通过为每个应用程序提供其他程序无法触及的内存块来对应用程序进行沙盒处理。

Let's take our example Program B, which has been allocated a block of memory from address 1000 to 1999.

让我们以我们的示例程序 B 为例，它已经分配了一块从地址 1000 到 1999 的内存。

Most often this synchronization happens when the cache is full, but a new block of memory is being requested by the processor.

大多数情况下，这种同步发生在缓存已满但处理器正在请求新的内存块时。

It means that Program A could end up being allocated non-sequential blocks of memory, in say addresses 0 through 999, and 2000 through 2999.

这意味着程序 A 最终可能会被分配到非连续的内存块，比如地址 0 到 999， 以及 2000 到 2999。

This virtualization of memory addresses is even more useful for Program A, which in our example, has been allocated two blocks of memory that are separated from one another.

这种内存地址的虚拟化对于程序 A 更有用，在我们的示例中， 程序 A 已分配了两个彼此分开的内存块。

For this purpose, the cache has a special flag for each block of memory it stores, called the dirty bit -- which might just be the best term computer scientists have ever invented.

为此，缓存为它存储的每个内存块都有一个特殊的标志，称为脏位——这可能是计算机科学家发明的最好的术语。

Maybe there's a long list of sales data in memory that a program has to total up at the end of the day, but this list is stored across a bunch of different blocks of memory.

也许内存中有一长串销售数据，程序必须在一天结束时汇总这些数据，但这个列表存储在一堆不同的内存块中。