发布求助
文献互助 智能选刊 最新文献

2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming最新文献

筛选
英文 中文
Sharing Virtual USB Device in Virtualized Desktop 在虚拟化桌面中共享虚拟USB设备
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-01 DOI: 10.1109/PAAP.2011.26
Xiaofei Liao, Xia Xie, Hai Jin
{"title":"Sharing Virtual USB Device in Virtualized Desktop","authors":"Xiaofei Liao, Xia Xie, Hai Jin","doi":"10.1109/PAAP.2011.26","DOIUrl":"https://doi.org/10.1109/PAAP.2011.26","url":null,"abstract":"With the development of computer science, desktop virtualization technology is more and more popular. In virtualized desktop, it is a very significant research to share periphery devices in the client-end computer seamlessly. We implement a device sharing mechanism to extend the universal serial bus in client-end host to the network for server-end host using transparently. This virtual device bus is deployed in the driver layer so that most applications and drivers in virtualized desktop could access remote shared devices through original interface. After deploying the virtual device bus driver, the duplicated virtual device could be accessed just like a real local device. In our implementation, the virtual device bus driver, which is the main module for virtualizing real USB devices and the interface for applications, is OS independent. Experiments show that the mechanism has a very friendly and easy interface to access virtual USB devices, and good performance.","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131462306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs 平面图中顶点不相交最小最小问题的多项式算法
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming Pub Date : 2011-12-01 DOI: 10.1109/PAAP.2011.15
Longkun Guo, Hong Shen
{"title":"A Polynomial Algorithm for the Vertex Disjoint Min-Min Problem in Planar Graphs","authors":"Longkun Guo, Hong Shen","doi":"10.1109/PAAP.2011.15","DOIUrl":"https://doi.org/10.1109/PAAP.2011.15","url":null,"abstract":"The Min-Min problem of finding a disjoint-path pair with the length of the shorter path minimized is known to be NP-hard in general graphs. However, it remains an open problem whether the Min-Min problem is NP-hard in some special graph such as planar graphs. In this paper, for an st-outerplanar graph G = (V;E) which is a special planar graph that can be drawn in the plane with source vertex s and destination vertex t belong to the unbounded face of the drawing, we show that the vertex disjoint Min-Min problem is polynomial solvable therein by presenting an algorithm with a time complexity of O(jEj + jV j log jV j).","PeriodicalId":213010,"journal":{"name":"2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124819037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信