{"title":"实时并行计算机网络路由器的研究","authors":"A. Saha, R. Neogi","doi":"10.1109/WPDRTS.1995.470485","DOIUrl":null,"url":null,"abstract":"A candidate network function is accurately defined for real-time parallel computers. A concise, time-driven, flit-based, priority-driven, wormhole-routed, network simulator has been designed. Experimentation is performed by monitoring the latency and the throughput with variations in different network parameters. Initially the destination address, message length and message priority are generated randomly with a uniform distribution. Then, various non-uniformities are introduced to mimic realistic applications. Results are plotted and analyzed.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A study of network routers for real-time parallel computers\",\"authors\":\"A. Saha, R. Neogi\",\"doi\":\"10.1109/WPDRTS.1995.470485\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A candidate network function is accurately defined for real-time parallel computers. A concise, time-driven, flit-based, priority-driven, wormhole-routed, network simulator has been designed. Experimentation is performed by monitoring the latency and the throughput with variations in different network parameters. Initially the destination address, message length and message priority are generated randomly with a uniform distribution. Then, various non-uniformities are introduced to mimic realistic applications. Results are plotted and analyzed.<<ETX>>\",\"PeriodicalId\":438550,\"journal\":{\"name\":\"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPDRTS.1995.470485\",\"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 Third Workshop on Parallel and Distributed Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPDRTS.1995.470485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A study of network routers for real-time parallel computers
A candidate network function is accurately defined for real-time parallel computers. A concise, time-driven, flit-based, priority-driven, wormhole-routed, network simulator has been designed. Experimentation is performed by monitoring the latency and the throughput with variations in different network parameters. Initially the destination address, message length and message priority are generated randomly with a uniform distribution. Then, various non-uniformities are introduced to mimic realistic applications. Results are plotted and analyzed.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
