Optimal Font Caching,
Abstract
An efficient algorithm is presented for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has limited memory. The encoding is optimum, in the sense that the total time for typesetting is minimized, using a model that generalizes well-known 'demand paging' strategies to the case where changes to the cache are allowed before the associated information is actually needed. Extensive empirical data shows that good results are obtained even when difficult technical material is being typeset on a machine that can store information concerning only 100 characters. The methods of this paper are also applicable to other hardware and software caching applications with restricted lookahead. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1982
- Accession Number
- ADA119439
Entities
People
- David R. Fuchs
- Donald Knuth
Organizations
- Stanford University