{"title":"个人计算机上的并行计算","authors":"O. Vornberger","doi":"10.1145/317559.322756","DOIUrl":null,"url":null,"abstract":"A set of Personal Computers is connected to form a ring-structured parallel system. Each computer has access to its local memory and can communicate with its two neighbours in the ring. This network of asynchronous processors is used to solve in parallel combinatorial optimization problems that are too time- and space-consuming to be handled on a single personal computer. Heuristics are developed to simulate in distributed memory the typical data structures needed in branch-and-bound-algorithms: A single priority queue is maintained and updated in several heaps with very little synchronization overhead. To show the performance of the ring a parallel version of the Travelling-Salesman-Problem is implemented. Execution times and speedups for 50 random graphs solved with up to 16 ring members are discussed.","PeriodicalId":154705,"journal":{"name":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Parallel computing on personal computers\",\"authors\":\"O. Vornberger\",\"doi\":\"10.1145/317559.322756\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A set of Personal Computers is connected to form a ring-structured parallel system. Each computer has access to its local memory and can communicate with its two neighbours in the ring. This network of asynchronous processors is used to solve in parallel combinatorial optimization problems that are too time- and space-consuming to be handled on a single personal computer. Heuristics are developed to simulate in distributed memory the typical data structures needed in branch-and-bound-algorithms: A single priority queue is maintained and updated in several heaps with very little synchronization overhead. To show the performance of the ring a parallel version of the Travelling-Salesman-Problem is implemented. Execution times and speedups for 50 random graphs solved with up to 16 ring members are discussed.\",\"PeriodicalId\":154705,\"journal\":{\"name\":\"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/317559.322756\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/317559.322756","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A set of Personal Computers is connected to form a ring-structured parallel system. Each computer has access to its local memory and can communicate with its two neighbours in the ring. This network of asynchronous processors is used to solve in parallel combinatorial optimization problems that are too time- and space-consuming to be handled on a single personal computer. Heuristics are developed to simulate in distributed memory the typical data structures needed in branch-and-bound-algorithms: A single priority queue is maintained and updated in several heaps with very little synchronization overhead. To show the performance of the ring a parallel version of the Travelling-Salesman-Problem is implemented. Execution times and speedups for 50 random graphs solved with up to 16 ring members are discussed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
