Optimal prepaging and font caching

DOI10.1145/2363.2367MaRDI QIDQ5184410zbMATH OpenOpenAlexFDO

Authors David R. Fuchs, Donald E. Knuth

Publication date 1985

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toplas/1985-7/

zbMATH Keywords

cache memorycommunicating letter-shape informationdata reductiondemand pagingfont cachinglookaheadoptimal prepagingoptimum allocationtext processingtypesetting

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Optimal prefetching via data compression
• Page replacement with multi-size pages and applications to web caching
• An analysis of optimum caching
• scientific article; zbMATH DE number 1305389
• On-line file caching

Cited in

(6)

• A new approach to optimal cache scheduling
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Integrated prefetching and caching in single and parallel disk systems
• Flexible font-size specification in Web documents
• On the pagination of complex documents
• An efficient raster font compression for embedded systems

This page was built for publication: Optimal prepaging and font caching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5184410)