Optimal prepaging and font caching
An efficient algorithm for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has a limited memory is presented. The encoding is optimum, in the sense that the total time for typesetting is minimized, using a model that generalizes well...
Gespeichert in:
| Veröffentlicht in: | ACM transactions on programming languages and systems 1985-01, Vol.7 (1), p.62-79 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 79 |
|---|---|
| container_issue | 1 |
| container_start_page | 62 |
| container_title | ACM transactions on programming languages and systems |
| container_volume | 7 |
| creator | Fuchs, David R. Knuth, Donald E. |
| description | An efficient algorithm for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has a limited memory is presented. 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 show 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. |
| doi_str_mv | 10.1145/2363.2367 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29014518</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29014518</sourcerecordid><originalsourceid>FETCH-LOGICAL-a369t-4bdc2c7bf36a52c7b52d6f11c1543bd668cc6195c12feadcb36e4890267aca233</originalsourceid><addsrcrecordid>eNqFkM1Lw0AQxRdRsFYPnrwGEcFD6s5-ZXOU4hcUetFzmEw2NZImcTc9-N-bNKVXL2-Gmd88eMPYNfAFgNKPQhq5GCQ5YTPQ2sZKp_KUzTgYFfNU6HN2EcI35xystjN2u-76aot11HnX4aZqNhE2RVS2TR8R0tcwuGRnJdbBXR3qnH2-PH8s3-LV-vV9-bSKUZq0j1VekKAkL6VBPTZaFKYEINBK5oUxlshAqglE6bCgXBqnbMqFSZBQSDln95Nv59ufnQt9tq0CubrGxrW7kImUDwnB_g-qRCmwyQA-TCD5NgTvyqzzQ1j_mwHPxndl47tGGdm7gykGwrr02FAVjgdWcSH3ljcThrQ9LvcGfy_BbvY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>24744187</pqid></control><display><type>article</type><title>Optimal prepaging and font caching</title><source>ACM Digital Library Complete</source><creator>Fuchs, David R. ; Knuth, Donald E.</creator><creatorcontrib>Fuchs, David R. ; Knuth, Donald E.</creatorcontrib><description>An efficient algorithm for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has a limited memory is presented. 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 show 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.</description><identifier>ISSN: 0164-0925</identifier><identifier>EISSN: 1558-4593</identifier><identifier>DOI: 10.1145/2363.2367</identifier><identifier>CODEN: ATPSDT</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Allocation / deallocation strategies ; Applied computing ; Applied sciences ; Computers in other domains ; Contextual software domains ; Electronics ; Exact sciences and technology ; General programming languages ; Information storage systems ; Information systems ; Language features ; Linked lists ; Memory management ; Operating systems ; Publishing ; Record storage alternatives ; Record storage systems ; Secondary storage ; Software and its engineering ; Software creation and management ; Software development techniques ; Software notations and tools ; Software organization and properties ; Storage and reproduction of information ; Virtual memory</subject><ispartof>ACM transactions on programming languages and systems, 1985-01, Vol.7 (1), p.62-79</ispartof><rights>ACM</rights><rights>1986 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a369t-4bdc2c7bf36a52c7b52d6f11c1543bd668cc6195c12feadcb36e4890267aca233</citedby><cites>FETCH-LOGICAL-a369t-4bdc2c7bf36a52c7b52d6f11c1543bd668cc6195c12feadcb36e4890267aca233</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/2363.2367$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,778,782,2278,27907,27908,40179,75979</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=8402387$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Fuchs, David R.</creatorcontrib><creatorcontrib>Knuth, Donald E.</creatorcontrib><title>Optimal prepaging and font caching</title><title>ACM transactions on programming languages and systems</title><addtitle>ACM TOPLAS</addtitle><description>An efficient algorithm for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has a limited memory is presented. 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 show 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.</description><subject>Allocation / deallocation strategies</subject><subject>Applied computing</subject><subject>Applied sciences</subject><subject>Computers in other domains</subject><subject>Contextual software domains</subject><subject>Electronics</subject><subject>Exact sciences and technology</subject><subject>General programming languages</subject><subject>Information storage systems</subject><subject>Information systems</subject><subject>Language features</subject><subject>Linked lists</subject><subject>Memory management</subject><subject>Operating systems</subject><subject>Publishing</subject><subject>Record storage alternatives</subject><subject>Record storage systems</subject><subject>Secondary storage</subject><subject>Software and its engineering</subject><subject>Software creation and management</subject><subject>Software development techniques</subject><subject>Software notations and tools</subject><subject>Software organization and properties</subject><subject>Storage and reproduction of information</subject><subject>Virtual memory</subject><issn>0164-0925</issn><issn>1558-4593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1985</creationdate><recordtype>article</recordtype><recordid>eNqFkM1Lw0AQxRdRsFYPnrwGEcFD6s5-ZXOU4hcUetFzmEw2NZImcTc9-N-bNKVXL2-Gmd88eMPYNfAFgNKPQhq5GCQ5YTPQ2sZKp_KUzTgYFfNU6HN2EcI35xystjN2u-76aot11HnX4aZqNhE2RVS2TR8R0tcwuGRnJdbBXR3qnH2-PH8s3-LV-vV9-bSKUZq0j1VekKAkL6VBPTZaFKYEINBK5oUxlshAqglE6bCgXBqnbMqFSZBQSDln95Nv59ufnQt9tq0CubrGxrW7kImUDwnB_g-qRCmwyQA-TCD5NgTvyqzzQ1j_mwHPxndl47tGGdm7gykGwrr02FAVjgdWcSH3ljcThrQ9LvcGfy_BbvY</recordid><startdate>19850102</startdate><enddate>19850102</enddate><creator>Fuchs, David R.</creator><creator>Knuth, Donald E.</creator><general>ACM</general><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19850102</creationdate><title>Optimal prepaging and font caching</title><author>Fuchs, David R. ; Knuth, Donald E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a369t-4bdc2c7bf36a52c7b52d6f11c1543bd668cc6195c12feadcb36e4890267aca233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1985</creationdate><topic>Allocation / deallocation strategies</topic><topic>Applied computing</topic><topic>Applied sciences</topic><topic>Computers in other domains</topic><topic>Contextual software domains</topic><topic>Electronics</topic><topic>Exact sciences and technology</topic><topic>General programming languages</topic><topic>Information storage systems</topic><topic>Information systems</topic><topic>Language features</topic><topic>Linked lists</topic><topic>Memory management</topic><topic>Operating systems</topic><topic>Publishing</topic><topic>Record storage alternatives</topic><topic>Record storage systems</topic><topic>Secondary storage</topic><topic>Software and its engineering</topic><topic>Software creation and management</topic><topic>Software development techniques</topic><topic>Software notations and tools</topic><topic>Software organization and properties</topic><topic>Storage and reproduction of information</topic><topic>Virtual memory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fuchs, David R.</creatorcontrib><creatorcontrib>Knuth, Donald E.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on programming languages and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fuchs, David R.</au><au>Knuth, Donald E.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal prepaging and font caching</atitle><jtitle>ACM transactions on programming languages and systems</jtitle><stitle>ACM TOPLAS</stitle><date>1985-01-02</date><risdate>1985</risdate><volume>7</volume><issue>1</issue><spage>62</spage><epage>79</epage><pages>62-79</pages><issn>0164-0925</issn><eissn>1558-4593</eissn><coden>ATPSDT</coden><abstract>An efficient algorithm for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has a limited memory is presented. 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 show 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.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/2363.2367</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0164-0925 |
| ispartof | ACM transactions on programming languages and systems, 1985-01, Vol.7 (1), p.62-79 |
| issn | 0164-0925 1558-4593 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29014518 |
| source | ACM Digital Library Complete |
| subjects | Allocation / deallocation strategies Applied computing Applied sciences Computers in other domains Contextual software domains Electronics Exact sciences and technology General programming languages Information storage systems Information systems Language features Linked lists Memory management Operating systems Publishing Record storage alternatives Record storage systems Secondary storage Software and its engineering Software creation and management Software development techniques Software notations and tools Software organization and properties Storage and reproduction of information Virtual memory |
| title | Optimal prepaging and font caching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T12%3A20%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20prepaging%20and%20font%20caching&rft.jtitle=ACM%20transactions%20on%20programming%20languages%20and%20systems&rft.au=Fuchs,%20David%20R.&rft.date=1985-01-02&rft.volume=7&rft.issue=1&rft.spage=62&rft.epage=79&rft.pages=62-79&rft.issn=0164-0925&rft.eissn=1558-4593&rft.coden=ATPSDT&rft_id=info:doi/10.1145/2363.2367&rft_dat=%3Cproquest_cross%3E29014518%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=24744187&rft_id=info:pmid/&rfr_iscdi=true |