故障超立方体上的渐近最优PRAM仿真

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI:10.1109/SFCS.1991.185404

Y. Aumann, M. Ben-Or

{"title":"故障超立方体上的渐近最优PRAM仿真","authors":"Y. Aumann, M. Ben-Or","doi":"10.1109/SFCS.1991.185404","DOIUrl":null,"url":null,"abstract":"A scheme for emulating the parallel random access machine (PRAM) on a faulty hypercube is presented. All components of the hypercube, including the memory modules, are assumed to be subject to failure. The faults may occur at any time during the emulation and the system readjusts dynamically. The scheme, which rests on L.G. Valiant's BSP model (1990), is the first to achieve optimal and work-preserving PRAM emulation on a dynamically faulty network.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"246 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Asymptotically optimal PRAM emulation on faulty hypercubes\",\"authors\":\"Y. Aumann, M. Ben-Or\",\"doi\":\"10.1109/SFCS.1991.185404\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A scheme for emulating the parallel random access machine (PRAM) on a faulty hypercube is presented. All components of the hypercube, including the memory modules, are assumed to be subject to failure. The faults may occur at any time during the emulation and the system readjusts dynamically. The scheme, which rests on L.G. Valiant's BSP model (1990), is the first to achieve optimal and work-preserving PRAM emulation on a dynamically faulty network.<<ETX>>\",\"PeriodicalId\":320781,\"journal\":{\"name\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"volume\":\"246 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1991.185404\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1991.185404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

提出了一种在故障超立方体上模拟并行随机存取机(PRAM)的方案。假设超立方体的所有组件(包括内存模块)都会发生故障。仿真过程中随时可能出现故障，系统会动态调整。该方案基于L.G. Valiant的BSP模型(1990)，是第一个在动态故障网络上实现最优且保持工作的PRAM仿真的方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Asymptotically optimal PRAM emulation on faulty hypercubes

A scheme for emulating the parallel random access machine (PRAM) on a faulty hypercube is presented. All components of the hypercube, including the memory modules, are assumed to be subject to failure. The faults may occur at any time during the emulation and the system readjusts dynamically. The scheme, which rests on L.G. Valiant's BSP model (1990), is the first to achieve optimal and work-preserving PRAM emulation on a dynamically faulty network.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

自引率

0.00%

发文量

期刊最新文献

Asymptotically optimal PRAM emulation on faulty hypercubes Dynamic maintenance of geometric structures made easy On-line scheduling in the presence of overload A quadratic time algorithm for the minmax length triangulation Lower bounds for the complexity of reliable Boolean circuits with noisy gates