Jeff Berryman

Name: Paging
Author: Jeff Berryman

Paging (1974)

Summary

“Paging”, published in 1974, is a work by Jeff Berryman. It explores elements such as the Thing King, bytes and array.

Quotes from Paging (Jeff Berryman)

Jeff Berryman, Paging (1974)

“ Traditionally, the Thing King sits at a large, segmented table and is attended to by pages (the so-called table pages) whose job it is to help the King remember where all the things are. One consequence of Rule 13 is that everybody's thing-numbers will be similar from game to game, regardless of the number of players. The Thing King has a few things of his own, some of which move back and forth from the warehouses to the workshop just like anybody else's, but some are just too heavy to move out of the workshop. ”

[↩︎]

Source: Wikisource

Jeff Berryman, Paging (1974)

“ The way a job gets bytes is to request them from the system. Memory is allocated in groups of eight bytes (doublewords) to make the system's recordkeeping process easier. The way a job references something is to give its address. Addresses are generally given by making them operands of machine language instructions, contents of hardware registers, etc. At any rate, if a job gives the address of a byte that is in real memory, the reference is completed immediately. If the byte is on a paging device, the system finds the least current page in real memory and writes it onto a paging device. ”

[↩︎]

Source: Wikisource

Jeff Berryman, Paging (1974)

“ Notice that without paging, the total number of bytes (things) that a computer can store is equal to the capacity of its real memory (workshop) alone. With paging, the total number of stored bytes (things) is equal to the real memory (workshop) capacity plus the paging devices (warehouses) capacity plus the disk (dump) capacity. In our case, the approximate figures are:
Paged memory is called virtual memory to distinguish it from ordinary (real) memory.
Virtual memory is MUCH cheaper than equal amounts of real memory. Real memory is at least ten times as expensive as drum and disk memory. ”

[↩︎]

Source: Wikisource

Jeff Berryman, Paging (1974)

“ Sometimes even the warehouses get full. The Thing King then has to start piling things on the dump out back. This makes the game slower because it takes a long time to get things from the dump when they are needed in the workshop. The Thing King follows a rule that minimizes this delay: When the warehouse begins to get too full, the Thing King uses his spare time to move the grubbiest things in the warehouses out to the dump. This means that the most infrequently zarked things will end up in the dump so that the Thing King won't have to get things from the dump very often. ”

[↩︎]

Source: Wikisource

Jeff Berryman, Paging (1974)

“ None Program B is better than Program A because it tends to require a smaller number of page-reads. This is true because Program B localizes its references; it does all its work on one page before moving on to the next, whereas Program A bounces its references back and forth from page to page. ”

[↩︎]

Source: Wikisource

Jeff Berryman, Paging (1974)

“ Both of these programs do the same thing; Program B does it more efficiently. Why? Let's look at the array X in the context of paging. X is 2000 words long; each word takes 4 bytes, so X requires 8000 bytes of storage. Since each page is 4096 bytes of virtual memory, X takes a bit less than 2 pages. Since the elements of arrays like X are arranged in subscript order, X (1) and X (2) will fall in one page, while X (1999) and X (2000) will fall in another. ”

[↩︎]

Source: Wikisource

Jeff Berryman, Paging (1974)

“ That is, the array elements for column 1 (for all rows) are stored at the beginning addresses of the array; next, in ascending addresses, are all of the elements of column 2, and so forth. The elements of column 250 occupy the highest addresses in the region of storage allocated to the array X. Note that the total size of this array is 1,000,000 bytes— four bytes for each of 250,000 array elements. This amounts to just about one-half of the total real memory if the entire array were paged-in. It is also worthwhile noting that each column requires 4000 bytes, or nearly a whole page. ”

[↩︎]

Source: Wikisource

Jeff Berryman, Paging (1974)

“ Each player's stock of things is numbered in the same range, 1 to 8,000,000. The thing King always knows who owns what thing and whose turn it is, so you can't ever accidentally zark someone else's thing, even if one of your things has the same thing number. ”

Jeff Berryman

Summary

Quotes from Paging (Jeff Berryman)

Common terms

Similar works

Get perspective with Kwize: daily news enlightened by great literature