{"title":"三维炮击技术的分层存储结构","authors":"L. Shen, M.F.A. Deprettere","doi":"10.1109/CMPEUR.1992.218502","DOIUrl":null,"url":null,"abstract":"The authors earlier proposed a new space partitioning for mapping computations of the radiosity method onto a highly pipelined parallel architecture (L.S. Shen et al., 1990; 1991). This shelling technique can alleviate the communication load between the host and the processors in a shared-memory architecture, but the system performance might deteriorate when increasing the number of processors. A memory structure which is a hierarchy of resident set, cache, and main memory is presented. It can reduce the average access time of a patch and thus provide better balancing between processing throughput and memory bandwidth, to enhance the pipelinability of computations. A method of selecting the resident set is described, and different policies in the cache design are investigated.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A hierarchical memory structure for the 3D shelling technique\",\"authors\":\"L. Shen, M.F.A. Deprettere\",\"doi\":\"10.1109/CMPEUR.1992.218502\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors earlier proposed a new space partitioning for mapping computations of the radiosity method onto a highly pipelined parallel architecture (L.S. Shen et al., 1990; 1991). This shelling technique can alleviate the communication load between the host and the processors in a shared-memory architecture, but the system performance might deteriorate when increasing the number of processors. A memory structure which is a hierarchy of resident set, cache, and main memory is presented. It can reduce the average access time of a patch and thus provide better balancing between processing throughput and memory bandwidth, to enhance the pipelinability of computations. A method of selecting the resident set is described, and different policies in the cache design are investigated.<<ETX>>\",\"PeriodicalId\":390273,\"journal\":{\"name\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPEUR.1992.218502\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hierarchical memory structure for the 3D shelling technique
The authors earlier proposed a new space partitioning for mapping computations of the radiosity method onto a highly pipelined parallel architecture (L.S. Shen et al., 1990; 1991). This shelling technique can alleviate the communication load between the host and the processors in a shared-memory architecture, but the system performance might deteriorate when increasing the number of processors. A memory structure which is a hierarchy of resident set, cache, and main memory is presented. It can reduce the average access time of a patch and thus provide better balancing between processing throughput and memory bandwidth, to enhance the pipelinability of computations. A method of selecting the resident set is described, and different policies in the cache design are investigated.<>