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

2007 International Conference on Parallel Processing Workshops (ICPPW 2007)最新文献

筛选
英文 中文
Mathematical Model for Multiobjective Synthesis of NoC Architectures NoC结构多目标综合的数学模型
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.50
B. Abderazek, Mushfiq Akanda, T. Yoshinaga, M. Sowa
{"title":"Mathematical Model for Multiobjective Synthesis of NoC Architectures","authors":"B. Abderazek, Mushfiq Akanda, T. Yoshinaga, M. Sowa","doi":"10.1109/ICPPW.2007.50","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.50","url":null,"abstract":"Network-on-Chip (NoC) interconnections have been proposed to overcome the problems associated with long wires used in chip wide communications. They support asynchronous transfer of communication between cores within multicore systems-on-chips (MCSoCs). The design of such architectures is crucial for achieving high performance and energy efficient systems. However, the effectiveness of NoC based design depends on the adopted design methodology. Automatic design approach is highly desirable to increase system design productivity. This paper presents a new mathematical formulation for synthesizing application specific NoC architectures, such that the performance constraints are satisfied and the communication power consumption is minimized.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"28 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":"114738555","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}
引用次数: 8
Modeling Analysis and Improvement for Free-Riding on BitTorrent-like File Sharing Systems 类bittorrent文件共享系统搭便车的建模分析与改进
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.56
Jiadi Yu, Minglu Li, Jie Wu
{"title":"Modeling Analysis and Improvement for Free-Riding on BitTorrent-like File Sharing Systems","authors":"Jiadi Yu, Minglu Li, Jie Wu","doi":"10.1109/ICPPW.2007.56","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.56","url":null,"abstract":"BitTorrent has emerged as a very popular peer-to- peer file sharing system, which uses an embedded set of incentive mechanisms to encourage contribution and prevent free-riding. However, the capability BitTorrent has of preventing free-riding needs further study. In this paper, we present a fluid model with two different classes of peers to capture the effect of free-riding on BitTorrent-like systems. With the model, we find that BitTorrent's incentive mechanism is successful in preventing free-riding in a system without seeds, but may not succeed in producing a disincentive for free-riding in a system with a high number of seeds. The reason for this is that BitTorrent does not employ an effective mechanisms for seeds to effectively guard against free-riding. Therefore, we propose a seed bandwidth allocation strategy for the BitTorrent system to reduce the effect of seeds on free-riding. Finally, simulation results are given, which validate what we have found in our analysis and demonstrate the effectiveness of the proposed strategy.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"54 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":"121470998","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}
引用次数: 12
An Architecture of Dynamically Reconfigurable Processing Unit(RPU) 一种动态可重构处理单元(RPU)体系结构
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.22
G. Zhou, Xubang Shen
{"title":"An Architecture of Dynamically Reconfigurable Processing Unit(RPU)","authors":"G. Zhou, Xubang Shen","doi":"10.1109/ICPPW.2007.22","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.22","url":null,"abstract":"Reconfigurable system can offer considerably higher performance than general purpose processors and are, in addition, significantly more flexible than application-specific systems. The efficient coarse-grained dynamically reconfigurable processing unit is the key feature of the reconfigurable system. In this paper, a novel dynamically reconfigurable processing unit (RPU) is proposed in order to improve the flexibility and adaptability of the general processing element(PE). By dynamic configuration of the configurable register(Creg), the proposed RPU can process complex number(8-bit real part and imaginary part) and 16-bit fixed number ( unsigned-magnitude or 2 's complement data). The operation of 8-bit complex number multiply-accumulation is performed in a single clock cycle. Therefore, two RPUs working together can execute butterfly computation in a single clock cycle. Based on Charter 0.25um standard cell library, the area of RPU is 0.< 16ns.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"1 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":"129937465","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
A Measurement of a large-scale Peer-to-Peer Live Video Streaming System 大规模点对点实时视频流系统的测量
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.9
Susu Xie, G. Y. Keung, Bo Li
{"title":"A Measurement of a large-scale Peer-to-Peer Live Video Streaming System","authors":"Susu Xie, G. Y. Keung, Bo Li","doi":"10.1109/ICPPW.2007.9","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.9","url":null,"abstract":"Peer-to-peer (P2P) technologies have found much success in applications like file distributions, and its adoption in live video streaming has recently attracted significant attentions. With the emerge of commercial P2P streaming systems that are orders of magnitude larger than the academic systems, understanding its basic principles and limitations are important in the design of future systems. Coolstreaming represented one of the earliest large-scale live streaming trials in the Internet. In this paper, we discuss the fundamental components of the system. By leveraging the recent results obtained from live event broadcast, we develop some basis to demonstrate that a random partnership selection has the potentially to scale. Specifically, first, we examine the overlay topology. Second, using a combination of real traces and analysis, we present the highly skewed distribution of peer contribution; a small fraction of peers contribute most of the upload capacity. Third, we discuss the main limitations and the implications on the scalability.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"76 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":"117122405","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}
引用次数: 47
A Support Method for Improving Learner's Learning Habit Using Behavior Analysis in a Ubiquitous Environment 在无所不在的环境中运用行为分析提高学习者学习习惯的支持方法
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.17
M. Dong, K. Ota, Zixue Cheng, Guojun Wang
{"title":"A Support Method for Improving Learner's Learning Habit Using Behavior Analysis in a Ubiquitous Environment","authors":"M. Dong, K. Ota, Zixue Cheng, Guojun Wang","doi":"10.1109/ICPPW.2007.17","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.17","url":null,"abstract":"With the great progress of technologies, computers are embedded into everywhere to make our daily life convenient, efficient and comfortable. Further more, most of them are small, powerful, intelligent and invisible. In a ubiquitous computing environment, support methods for learning are more effective than some traditional ways, such as WBT (Web-based training) and e-learning. In this paper, we proposed a support method which aims to encourage a learner to acquire his/her learning habit based on behavior analysis. The supports to the learner are provided through a scheduler system, a ubiquitous learning scheduler (ULS). In our design, the learner's situations are collected by sensors and analyzed by comparing them to his/her learning histories. Based on this information, supports are provided to the learner in order to help him/her forming a good learning style. Our research results revealed that ULS not only benefited learners to acquire their learning habits but also improved their self directed learning styles.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"51 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":"121334418","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}
引用次数: 5
Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Wireless Ad Hoc Networks 异构无线自组织网络中广播的最小本地磁盘覆盖集
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.55
Chih-Wei Yi, Fang-Chun Liu, Min-Te Sun
{"title":"Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Wireless Ad Hoc Networks","authors":"Chih-Wei Yi, Fang-Chun Liu, Min-Te Sun","doi":"10.1109/ICPPW.2007.55","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.55","url":null,"abstract":"The concept of the forwarding set has been used extensively by many broadcast protocols in wireless ad hoc networks to alleviate the broadcast storm problem. In these protocols, when a node receives a broadcast, it only instructs a subset of its neighbors, a.k.a. the forwarding set, to relay the message. In this paper, we propose to use the local minimum disk cover set as the forwarding set in heterogeneous wireless ad hoc networks, where nodes may have different transmission radius. We show that the minimum local disk cover set of a node is equivalent to its skyline set, and propose a divide-and-conquer algorithm with the optimal time complexity O (n log n) to compute the skyline set locally and statelessly.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"249 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":"122707161","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
Semantic Web Services Discovery in P2P Environment P2P环境下的语义Web服务发现
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.74
Bin Xu, Dewei Chen
{"title":"Semantic Web Services Discovery in P2P Environment","authors":"Bin Xu, Dewei Chen","doi":"10.1109/ICPPW.2007.74","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.74","url":null,"abstract":"Web services are new paradigm of using the Web. One of emerging challenges is to discover Web services efficiently and precisely. Unfortunately, existing systems like UDDI often have the problems of low availability, low accuracy, and bad performance. In this paper, we propose an approach of semantic Web services discovery in P2P environment. Firstly, Web services are published and deployed in same Web server to guarantee the availability. Secondly, Web servers are organized into groups to form a structured P2P network. Thirdly, for improving the query performance of service discovering, we propose a 2-layers searching algorithm. Finally we developed a prototype system, and tested the system in real P2P test bed of Planet-lab. Experimental results show our approach's precision, recall, query time and scalability. By analysis of the performance, we observed that the system has good efficiency and scalability.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"52 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":"124111270","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}
引用次数: 17
A Calculation Mechanism for Similarity Measure with Clustering an Unbalanced Hierarchical Terminology Structure 不平衡层次术语结构下聚类相似性度量的计算机制
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.6
MinTzu Wang, P. Hsu, K. Lin, J. Hung
{"title":"A Calculation Mechanism for Similarity Measure with Clustering an Unbalanced Hierarchical Terminology Structure","authors":"MinTzu Wang, P. Hsu, K. Lin, J. Hung","doi":"10.1109/ICPPW.2007.6","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.6","url":null,"abstract":"The effective retrieval of reverent information often is quite useful to the user, for example, to query the respectful knowledge or information, especially for on-line e-leaner. The most common method is to make use of synonym and antonym from a dictionary with the most frequent terms. However, sometimes we are focusing on a pair of or a set of associated keywords offered by user, instead of same meaning. Generally, we would probably adopt the association rule to solve the problem. Nonetheless, the keywords or terms sets extracted from huge queries often contain sparse information composed of a wide range of keywords, with each term set only containing a few terms. These data render basket analysis with extremely low item support, lift the term to a higher level of concept hierarchy may get enough support, but missing the detailed information. Although a similarity measure represented by counting the depth of the least common ancestor normalized by the depth of the concept tree lifts the limitation of binary equality, it produces counter intuitive results when the concept hierarchy is unbalanced since two terms in deeper subtrees are very likely to have a higher similarity than two terms in shallower subtrees. The research proposes to calculate the distance between two terms by counting the edge traversal needed yet from user's viewpoint to link them in order to solve the issues. The method is straight forward yet achieves better outcome with information query when concept hierarchy is unbalanced.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"22 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":"122299692","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
Fast and Secure Mobility for IEEE 802.16e Broadband Wireless Networks IEEE 802.16e宽带无线网络的快速和安全移动性
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.44
Chung-Kuo Chang, Chin-Tser Huang
{"title":"Fast and Secure Mobility for IEEE 802.16e Broadband Wireless Networks","authors":"Chung-Kuo Chang, Chin-Tser Huang","doi":"10.1109/ICPPW.2007.44","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.44","url":null,"abstract":"The next generation broadband wireless networks support real-time applications like VOIP and video streaming. They allow users to roam over the network seamlessly and securely. Current design incurs lengthy delay between breaking of previous connection and making of next connection. Cross layer design and cross function optimization are required to improve the handover latency of broadband wireless networks. We discuss the fast handover algorithms that combine the mechanisms in the MAC layer with that of the IP layer. Fast key exchange and fast authentication procedures are introduced to reduce authentication time during network re-entry. The effects of latency reduction by fast authentication are compared with results of other solutions. We also discuss standard activity for media independent handover in heterogeneous networks.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"18 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":"132137186","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}
引用次数: 18
Network Coding Based Multicast in Internet Internet中基于组播的网络编码
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.58
Jing Wang, Y. Li, Xinmei Wang
{"title":"Network Coding Based Multicast in Internet","authors":"Jing Wang, Y. Li, Xinmei Wang","doi":"10.1109/ICPPW.2007.58","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.58","url":null,"abstract":"Multicast transmission is a key technology in Internet, which can send the same information simultaneously to several receivers. A new multicast routing algorithm based on network coding is proposed in this paper, searching the routing groups from source to each receiver by using Dijkstra reduction network. Simulation results show that, compared with traditional multicast routing algorithms, performances of the routing algorithm are improved at a great extent in resource consumption and load balance, and are closer to minimum-cost multicast algorithm based on network coding. Finally, mathematic analysis indicates that the algorithm has lower computational complexity.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"39 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":"115073642","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}
引用次数: 5
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信