2007 International Conference on Parallel Processing Workshops (ICPPW 2007)最新文献_第2页

Efficient Multi-source Location in Unstructured P2P Systems 非结构化P2P系统中的高效多源定位

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.37

Xucheng Luo, Zhiguang Qin, Ji Geng, Qiang Wang

引用次数: 0

Wireless Mesh Sensor Networks in Pervasive Environment: a Reliable Architecture and Routing Protocol 普适环境下的无线网状传感器网络:一种可靠的架构和路由协议

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.83

F. Tang, M. Guo, Minglu Li, Yanqin Yang, Daqiang Zhang, Yi Wang

引用次数: 16

Energy Efficient Cooperative Nodes Selection in Wireless Sensor Networks 无线传感器网络中的高效协同节点选择

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.40

I. Ahmed, M. Peng, Wenbo Wang

引用次数: 21

A Distributed Cut Set Discovery Algorithm in P2P Environment P2P环境下的分布式割集发现算法

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.8

Hao Ren, Nong Xiao, Zhiying Wang

引用次数: 0

Enhancing Reusability of Learning Objects with Object-Oriented Inheritance Relationships 用面向对象的继承关系增强学习对象的可重用性

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.41

Yung-Hui Chen, Chun-Chia Wang, L. Deng, Mei-Chung Chen, T. Shih

引用次数: 8

3D Caricature Generation System on the Mobile Handset Using a Single Photograph 使用单张照片的手机上的3D漫画生成系统

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.5

Yeong-Kyu Lim, A. Fedorov, Shin-Dug Kim

引用次数: 8

Performance Evaluation of Large Scale Disaster Information Network 大型灾害信息网络性能评价

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.68

Y. Shibata, Kazuo Takahata

{"title":"Performance Evaluation of Large Scale Disaster Information Network","authors":"Y. Shibata, Kazuo Takahata","doi":"10.1109/ICPPW.2007.68","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.68","url":null,"abstract":"In the case of large scale disaster, such as earthquake, volcanic explosion, sea wave, more robust and flexible nation-wide disaster information network is required not only for governmental supporters but also residents and volunteers than business oriented network to communicate each other even though some parts of the network and information system are destroyed and disconnected. In this paper, we introduce a larger scale distributed disaster information network system based on mobile ad hoc network (MANET) and overlay network. MANET is used for the access network for residents and volunteers around the disaster area and evacuation places. The evacuated residents and volunteers can flexibly communicate with others though MANET using IP based terminals, wireless IP telephones and mobile PCs. On the other hand, overlay network is applied for national wide government and local government network to provide robust and redundant large scale disaster information network. By combining with both MANET access network and overlay network, more robust and flexible, and large scale disaster information network system can be realized provide even some of network lines and nodes are damaged and destroyed when the disaster happened.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128180289","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}

引用次数: 1

Cooperation of Trustworthy Peers in P2P Overlay Networks P2P覆盖网络中可信节点的合作

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.30

Y. Nakajima, Kenichi Watanabe, A. Nemati, T. Enokido, M. Takizawa, S. Deen

引用次数: 0

RSB-Topo: A Topology Adaptation Algorithm for Unstructured P2P Networks RSB-Topo:一种非结构化P2P网络拓扑自适应算法

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.73

Yilin Wang, Wenzhong Li, Jianzhong Chen, Sanglu Lu, Fang Wang, Daoxu Chen

{"title":"RSB-Topo: A Topology Adaptation Algorithm for Unstructured P2P Networks","authors":"Yilin Wang, Wenzhong Li, Jianzhong Chen, Sanglu Lu, Fang Wang, Daoxu Chen","doi":"10.1109/ICPPW.2007.73","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.73","url":null,"abstract":"Peer-to-Peer (P2P) technology has been widely applied in today's Internet. Unstructured P2P systems, where peers connect with each other to form dynamic, flexible and scalable networks, are commonly used for resource sharing. Resource location in unstructured P2P systems tends to use \"blind search\" strategies (i.e. flooding and random walk) for its simplicity and low maintenance cost. However, due to lack of location information, the performance of \"blind search\" is heavily relied on the network topology. Topology adaptation, by properly adjusting the topology of the P2P overlay network, is a promising approach to improve the search performance. In this paper, we use Relative Search Betweenness (RSB) to estimate nodes' search ability. A RSB-based topology adaptation algorithm (RSB-Topo) is proposed, where peers spontaneously adjust their connections to achieve better performance. Simulation results show that our algorithm could greatly increase search success rate and search coverage, and also decrease response delay to improve the search performance in unstructured P2P networks.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117141465","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}

引用次数: 1

Power Management of Multicore Multiple Voltage Embedded Systems by Task Scheduling 基于任务调度的多核多电压嵌入式系统电源管理

2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.69

G. Qu

{"title":"Power Management of Multicore Multiple Voltage Embedded Systems by Task Scheduling","authors":"G. Qu","doi":"10.1109/ICPPW.2007.69","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.69","url":null,"abstract":"We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-a- chip, in particular DSP systems, can greatly improve performance through parallelism. On the other hand, dynamic voltage scaling (DVS) has been shown to be one of the most effective low power design techniques and multiple supply voltage system is among the most practical and well-studied DVS systems. The integration of multiple cores/processors on a chip naturally makes the system suitable for DVS with new innovations such as voltage island. In this paper, we discuss how to reduce multicore system's power consumption by utilizing multiple supply voltages. We first formulate the power management problem for multicore multi-voltage embedded systems and show that the problem is NP-hard, but the NP- hardness can be removed for several real life applications. More specific, we develop polynomial algorithms to find the optimal solutions for two special cases. The first case is when preemption is allowed, and the second one is when the system uses the first-come - first-serve (FCFS) service strategy. We prove both algorithms' optimality and analyze their run-time complexity. Simulation on real- life and randomly generated tasks show that the optimal preemption scheduler provides significant energy saving. Our goal in this paper is to build a solid foundation for the power management problem on multicore multiple voltage systems and to study real life applications where the problem can be solved optimally.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182719","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}

引用次数: 20