{"title":"具有恒定内存爆炸和无时间戳的确定性PRAM仿真","authors":"Y. Aumann, A. Schuster","doi":"10.1109/FMPC.1990.89431","DOIUrl":null,"url":null,"abstract":"A scheme for deterministic simulation of a parallel random-access machine (PRAM) on a module parallel computer or on bounded-degree networks is described. The scheme requires only a constant memory blowup, thus achieving better memory utilization than previously known approaches. The method does not need time stamps, which were a basic element of all previous schemes. The improvements are achieved by adopting error-correcting-code techniques. Several coding methods are considered, tradeoffs between memory utilization, run time, and the size of the PRAM shared memory are derived.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Deterministic PRAM simulation with constant memory blow-up and no time-stamps\",\"authors\":\"Y. Aumann, A. Schuster\",\"doi\":\"10.1109/FMPC.1990.89431\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A scheme for deterministic simulation of a parallel random-access machine (PRAM) on a module parallel computer or on bounded-degree networks is described. The scheme requires only a constant memory blowup, thus achieving better memory utilization than previously known approaches. The method does not need time stamps, which were a basic element of all previous schemes. The improvements are achieved by adopting error-correcting-code techniques. Several coding methods are considered, tradeoffs between memory utilization, run time, and the size of the PRAM shared memory are derived.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1990.89431\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1990.89431","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Deterministic PRAM simulation with constant memory blow-up and no time-stamps
A scheme for deterministic simulation of a parallel random-access machine (PRAM) on a module parallel computer or on bounded-degree networks is described. The scheme requires only a constant memory blowup, thus achieving better memory utilization than previously known approaches. The method does not need time stamps, which were a basic element of all previous schemes. The improvements are achieved by adopting error-correcting-code techniques. Several coding methods are considered, tradeoffs between memory utilization, run time, and the size of the PRAM shared memory are derived.<>