2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第2页

A Cost-Based Resource Scheduling Paradigm in Cloud Computing 云计算中基于成本的资源调度范式

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.1

Zhi Yang, Changqing Yin, Yan Liu

引用次数: 40

Modeling and Analysis of Email Worm Propagation Based on Stochastic Game Nets 基于随机博弈网的电子邮件蠕虫传播建模与分析

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.55

Min Yu, Yuanzhuo Wang, Li Liu, Xueqi Cheng

引用次数: 4

SmartAgents: A Scalable Infrastructure for Smart Car 智能代理:智能汽车的可扩展基础设施

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.75

Jie Sun, Yongping Zhang, Jianbo Fan

引用次数: 3

XunleiProbe: A Sensitive and Accurate Probing on a Large-Scale P2SP System XunleiProbe:大规模P2SP系统的灵敏、精确探测

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.83

Yong Zhao, Zhibin Zhang, Li Guo, Binxing Fang

{"title":"XunleiProbe: A Sensitive and Accurate Probing on a Large-Scale P2SP System","authors":"Yong Zhao, Zhibin Zhang, Li Guo, Binxing Fang","doi":"10.1109/PDCAT.2011.83","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.83","url":null,"abstract":"Xunlei [1] is a new P2P content distribution system which is popular in China. It composes traditional HTTP/FTP downloading and P2P content distribution features which attract many people including researchers. Xunlei's network is Bit Torrent-like and the measurement is more difficult than other P2P networks [2]. There are many constrains on Xunlei tracker, so we can not obtain information from tracker easily. Besides this, the measurement will encounter some challenges that skew the results. Most of previous works on Bit Torrent system are based on tracker logs. However, we can not obtain tracker logs of Xunlei. As far as we know, there is no proposal about precise and detailed measurement method that probes the network directly in this area. Face to the challenges, we analyze the constrains that appear in most Bit Torrent-like systems and propose a stratified random selection model to describe the behavior of tracker. Based on the model, we design a measurement tool called XunleiProbe. With the help of our solutions that increase the accuracy of our results, we measure a popular swarm for about 22 hours. The results show that the average peer coverage of our tool can reach about 93%.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124451622","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}

引用次数: 4

Application of Ontologies in Peer-to-Peer Database with Routing Queries Based on Ant Colony Algorithm 本体在基于蚁群算法的路由查询点对点数据库中的应用

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.22

C. R. Valêncio, L. R. Costa, Carlos Henrique El Hetti Laurenti, A. Cansian

{"title":"Application of Ontologies in Peer-to-Peer Database with Routing Queries Based on Ant Colony Algorithm","authors":"C. R. Valêncio, L. R. Costa, Carlos Henrique El Hetti Laurenti, A. Cansian","doi":"10.1109/PDCAT.2011.22","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.22","url":null,"abstract":"A significant set of information stored in different databases around the world, can be shared through peer-to-peer databases. With that, is obtained a large base of knowledge, without the need for large investments because they are used existing databases, as well as the infrastructure in place. However, the structural characteristics of peer-to-peer, makes complex the process of finding such information. On the other side, these databases are often heterogeneous in their schemas, but semantically similar in their content. A good peer-to-peer databases systems should allow the user access information from databases scattered across the network and receive only the information really relate to your topic of interest. This paper proposes to use ontologies in peer-to-peer database queries to represent the semantics inherent to the data. The main contribution of this work is enable integration between heterogeneous databases, improve the performance of such queries and use the algorithm of optimization Ant Colony to solve the problem of locating information on peer-to-peer networks, which presents an improve of 18% in results.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122992329","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

Evaluation of Compound System Calls in the Linux Kernel on Physical and Virtual Machines Linux内核中复合系统调用在物理机和虚拟机上的评估

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.39

Elder Vicente, Rivalino Matias, Autran Macêdo, Lucio Borges de Araujo

引用次数: 0

Performance Evaluation of OpenMP Constructs and Kernel Benchmarks on a Loongson-3A Quad-Core SMP System 龙星3a四核SMP系统上OpenMP结构和内核基准性能评估

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.66

Qiuming Luo, Chang Kong, Ye Cai, Gang Liu

{"title":"Performance Evaluation of OpenMP Constructs and Kernel Benchmarks on a Loongson-3A Quad-Core SMP System","authors":"Qiuming Luo, Chang Kong, Ye Cai, Gang Liu","doi":"10.1109/PDCAT.2011.66","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.66","url":null,"abstract":"As a competitor and alternative to mainstream general-purpose CPU (Intel/AMD/etc.), Loongson is a family of general-purpose MIPS-compatible CPUs developed at the ICT of CAS in China. The quad-core Loongson 3A is evaluated in this paper. The performance of the basic OpenMP constructs on Loongson-3A quad-core SMP is obtained by applying the EPCC Micro benchmarks. And then the performance of NAS kernel codes is obtained by applying NAS Parallel Benchmarks (NPB). These benchmarking are carried out for three different OpenMP compilers (and the runtime system), which includes GCC, OMPipth (OMPi with pthread library) and OMPi-psth (OMPi with psthread library). The results show that OMPI-pth's performance is the best and OMPi-psth's performance is the worst. Those test results might help to program the OpenMP codes as well as to select the appropriate compiler and its runtime system. And an Intel core i5 quad-core platform is used for comparison purpose, by running NPB, which implies that Loongson 3A's performance is nearly one tenth of i5's. The NPB results can help to defining a Loongson system's scale when replacing an Intel i5 system for a given problem size.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121574125","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

Access Pattern Based Re-reference Interval Table for Last Level Cache 基于访问模式的最后一级缓存重引用间隔表

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.13

B. Yu, Yifan Hu, Jianliang Ma, Tianzhou Chen

{"title":"Access Pattern Based Re-reference Interval Table for Last Level Cache","authors":"B. Yu, Yifan Hu, Jianliang Ma, Tianzhou Chen","doi":"10.1109/PDCAT.2011.13","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.13","url":null,"abstract":"The memory access stream to the last level cache (LLC) is a filtered version from the upper level caches. There are a large number of cache blocks with long re-reference interval in the LLC. What's worse, zero reuse blocks are in abundance in the LLC and pollute the LLC for a long time. Access pattern based re-reference interval table (RRIT), here we propose, is an efficient management technology for the LLC. RRIT introduces a table to track consecutive blocks' re-reference interval. And then predicts the re-reference interval for a new incoming block. RRIT always selects the block with the max re-reference interval as the victim block when a cache replacement issue occurs. Furthermore, we propose a dead block filtering (RRIT-Filter) mechanism based on RRIT. RRIT-Filter bypasses the predicted dead block and improves LLC efficiency. Our evaluations using the SPEC2006 workloads on a single-core with a 2MB LLC show that RRIT and RRIT-Filter outperform LRU replacement on the throughput metric by an average of 6.6% and 8.6% respectively. Our evaluations with 10 multi-programmed workloads on a 4-core CMP with an 8MB shared LLC show that our strategy outperforms LRU replacement on the throughput metric by an average of 23% and 39% respectively.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129451441","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

Adaptive Service Migration in Wireless Sensor Networks 无线传感器网络中的自适应业务迁移

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.15

Stefan Werner, C. Reinke, Sven Groppe, V. Linnemann

引用次数: 0

Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-Time Tasks on Multiprocessors 多处理器上(m,k)-firm - Deadline-Constrained实时任务的保证调度

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.44

Yeonhwa Kong, Hyeonjoong Cho

引用次数: 10