K. Maly, F. Paterra, C. M. Overstreet, R. Mukkamala, S. Khanna
{"title":"使用现有网络的远程可视化和并行性","authors":"K. Maly, F. Paterra, C. M. Overstreet, R. Mukkamala, S. Khanna","doi":"10.1109/PCCC.1992.200510","DOIUrl":null,"url":null,"abstract":"A method for using existing networks and available parallel channels to provide the needed throughput for remote visualization is proposed. This method keeps the functionalities of the traditional protocol stack but introduces parallelism at all points where bottlenecks can develop. The approach allows the use of existing protocol standards and off-the-shelf hardware to permit new applications that require higher bandwidths. The design tradeoffs in this approach are discussed to develop working architectures needed to solve the animation problems of 5, 10, and 33 frames/s, or 10 Mb every 200 ms, 100 ms, and 30 ms, respectively.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Remote visualization and parallelism using existing networks\",\"authors\":\"K. Maly, F. Paterra, C. M. Overstreet, R. Mukkamala, S. Khanna\",\"doi\":\"10.1109/PCCC.1992.200510\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for using existing networks and available parallel channels to provide the needed throughput for remote visualization is proposed. This method keeps the functionalities of the traditional protocol stack but introduces parallelism at all points where bottlenecks can develop. The approach allows the use of existing protocol standards and off-the-shelf hardware to permit new applications that require higher bandwidths. The design tradeoffs in this approach are discussed to develop working architectures needed to solve the animation problems of 5, 10, and 33 frames/s, or 10 Mb every 200 ms, 100 ms, and 30 ms, respectively.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Remote visualization and parallelism using existing networks
A method for using existing networks and available parallel channels to provide the needed throughput for remote visualization is proposed. This method keeps the functionalities of the traditional protocol stack but introduces parallelism at all points where bottlenecks can develop. The approach allows the use of existing protocol standards and off-the-shelf hardware to permit new applications that require higher bandwidths. The design tradeoffs in this approach are discussed to develop working architectures needed to solve the animation problems of 5, 10, and 33 frames/s, or 10 Mb every 200 ms, 100 ms, and 30 ms, respectively.<>