{"title":"一种新的大规模并行计算模型","authors":"S. Berkovich","doi":"10.1109/FMPC.1990.89466","DOIUrl":null,"url":null,"abstract":"A universal parallel computational model using the concept of distributed associative processing (DASP) is presented. The effective realization of this model is due to unique facilities of a multiaccess content-induced transaction overlap communication technique. The operative mechanism of the model uses a plurality of processing nodes with content-addressable transmission buffers. This construction can be incrementally expanded through the hierarchical multiplexing of information pathways. The developed principles simplify hardware/software organization and ensure performance gains for a variety of computational schemes.<<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":"1","resultStr":"{\"title\":\"A new computational model for massive parallelism\",\"authors\":\"S. Berkovich\",\"doi\":\"10.1109/FMPC.1990.89466\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A universal parallel computational model using the concept of distributed associative processing (DASP) is presented. The effective realization of this model is due to unique facilities of a multiaccess content-induced transaction overlap communication technique. The operative mechanism of the model uses a plurality of processing nodes with content-addressable transmission buffers. This construction can be incrementally expanded through the hierarchical multiplexing of information pathways. The developed principles simplify hardware/software organization and ensure performance gains for a variety of computational schemes.<<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\":\"1\",\"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.89466\",\"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.89466","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A universal parallel computational model using the concept of distributed associative processing (DASP) is presented. The effective realization of this model is due to unique facilities of a multiaccess content-induced transaction overlap communication technique. The operative mechanism of the model uses a plurality of processing nodes with content-addressable transmission buffers. This construction can be incrementally expanded through the hierarchical multiplexing of information pathways. The developed principles simplify hardware/software organization and ensure performance gains for a variety of computational schemes.<>