{"title":"最小化Lisp应用程序中的分页","authors":"David L. Andre","doi":"10.1145/1862396.1862398","DOIUrl":null,"url":null,"abstract":"Paging is an important aspect of performance in any program and can be the overriding consideration in a large system. When developing large applications, the programmer should be as aware of paging overhead as he is of runtime overhead. The programmer should seek to avoid large working sets that cause page faults, just as he avoids order n2 and exponential algorithms.","PeriodicalId":262740,"journal":{"name":"ACM SIGPLAN Lisp Pointers","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimizing paging in Lisp applications\",\"authors\":\"David L. Andre\",\"doi\":\"10.1145/1862396.1862398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Paging is an important aspect of performance in any program and can be the overriding consideration in a large system. When developing large applications, the programmer should be as aware of paging overhead as he is of runtime overhead. The programmer should seek to avoid large working sets that cause page faults, just as he avoids order n2 and exponential algorithms.\",\"PeriodicalId\":262740,\"journal\":{\"name\":\"ACM SIGPLAN Lisp Pointers\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGPLAN Lisp Pointers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1862396.1862398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGPLAN Lisp Pointers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1862396.1862398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Paging is an important aspect of performance in any program and can be the overriding consideration in a large system. When developing large applications, the programmer should be as aware of paging overhead as he is of runtime overhead. The programmer should seek to avoid large working sets that cause page faults, just as he avoids order n2 and exponential algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
