{"title":"C-with-Ease的分布式内存多处理器实现","authors":"T. MacKenzie, T. Dix","doi":"10.1109/ICPADS.1994.590304","DOIUrl":null,"url":null,"abstract":"C-with-Ease is a superset of C, with primitives borrowed from Ease for process creation and communication. All communication is via distributed data structures called contexts. We present an efficient implementation of C-with-Ease for the Fujitsu AP1000, a distributed memory, message passing multiprocessor. We use two of the three AP1000 communication networks: the torus net for point to point communication and the broadcast net to maintain a global view of processor allocation.","PeriodicalId":154429,"journal":{"name":"Proceedings of 1994 International Conference on Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A distributed memory multiprocessor implementation of C-with-Ease\",\"authors\":\"T. MacKenzie, T. Dix\",\"doi\":\"10.1109/ICPADS.1994.590304\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"C-with-Ease is a superset of C, with primitives borrowed from Ease for process creation and communication. All communication is via distributed data structures called contexts. We present an efficient implementation of C-with-Ease for the Fujitsu AP1000, a distributed memory, message passing multiprocessor. We use two of the three AP1000 communication networks: the torus net for point to point communication and the broadcast net to maintain a global view of processor allocation.\",\"PeriodicalId\":154429,\"journal\":{\"name\":\"Proceedings of 1994 International Conference on Parallel and Distributed Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 International Conference on Parallel and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.1994.590304\",\"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 1994 International Conference on Parallel and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1994.590304","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A distributed memory multiprocessor implementation of C-with-Ease
C-with-Ease is a superset of C, with primitives borrowed from Ease for process creation and communication. All communication is via distributed data structures called contexts. We present an efficient implementation of C-with-Ease for the Fujitsu AP1000, a distributed memory, message passing multiprocessor. We use two of the three AP1000 communication networks: the torus net for point to point communication and the broadcast net to maintain a global view of processor allocation.