{"title":"关于消息和分层通道的相对速度","authors":"Mohan L. Ahuja, R. Prakash","doi":"10.1109/SPDP.1992.242737","DOIUrl":null,"url":null,"abstract":"The authors study the concept of relative speed of messages and a hierarchy of such speeds which results in a hierarchical channel. They present examples of applications where hierarchical channels are useful and an implementation of such a channel using selective flooding. They describe a mechanism that permits a programmer to specify a partial order among channels, and compare the hierarchical channels with F-channels.<<ETX>>","PeriodicalId":265469,"journal":{"name":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On the relative speed of messages and hierarchical channels\",\"authors\":\"Mohan L. Ahuja, R. Prakash\",\"doi\":\"10.1109/SPDP.1992.242737\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors study the concept of relative speed of messages and a hierarchy of such speeds which results in a hierarchical channel. They present examples of applications where hierarchical channels are useful and an implementation of such a channel using selective flooding. They describe a mechanism that permits a programmer to specify a partial order among channels, and compare the hierarchical channels with F-channels.<<ETX>>\",\"PeriodicalId\":265469,\"journal\":{\"name\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPDP.1992.242737\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPDP.1992.242737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the relative speed of messages and hierarchical channels
The authors study the concept of relative speed of messages and a hierarchy of such speeds which results in a hierarchical channel. They present examples of applications where hierarchical channels are useful and an implementation of such a channel using selective flooding. They describe a mechanism that permits a programmer to specify a partial order among channels, and compare the hierarchical channels with F-channels.<>