2009 IEEE International Symposium on Parallel and Distributed Processing with Applications最新文献_第8页

An Efficient Task Allocation Protocol for P2P Multi-agent Systems 一种高效的P2P多智能体系统任务分配协议

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.14

Dayong Ye, Q. Bai, Minjie Zhang, K. Win, Zhiqi Shen

{"title":"An Efficient Task Allocation Protocol for P2P Multi-agent Systems","authors":"Dayong Ye, Q. Bai, Minjie Zhang, K. Win, Zhiqi Shen","doi":"10.1109/ISPA.2009.14","DOIUrl":"https://doi.org/10.1109/ISPA.2009.14","url":null,"abstract":"Recently, task allocation in multi-agent systems has been investigated by many researchers. Some researchers suggested to have a central controller which has a global view about the environment to allocate tasks. Although centralized control brings convenience during task allocation processes, it also has some obvious weaknesses. Firstly, a central controller plays an important role in a multi-agent system, but task allocation procedures will break down if the central controller of a system cannot work properly. Secondly, centralized multi-agent architecture is not suitable for distributed working environments. In order to overcome some limitations caused by centralized control, some researchers proposed distributed task allocation protocols. They supposed that each agent has a limited local view about its direct linked neighbors, and can allocate tasks to its neighbors. However, only involving direct linked neighbors could limit resource origins, so that the task allocation efficiency will be greatly reduced. In this paper, we propose an efficient task allocation protocol for P2P multi-agent systems. This protocol allows not only neighboring agents but also indirect linked agents in the system to help with a task if needed. Through this way, agents can achieve more efficient and robust task allocations in loosely coupled distributed environments (e.g. P2P multi-agent systems). A set of experiments are presented in this paper to evaluate the efficiency and adaptability of the protocol. The experiment result shows that the protocol can work efficiently in different situations.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130110141","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}

引用次数: 6

Supporting Reconfigurable Fault Tolerance on Application Servers 支持应用服务器上的可重构容错

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.57

Junguo Li, Gang Huang, Xingrun Chen, Franck Chauvel, Hong Mei

引用次数: 0

Reverse Analysis and Vulnerability Detection for Network System Software 网络系统软件逆向分析与漏洞检测

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.73

Wei Pan, Weihua Li

引用次数: 0

A Method of In-Depth-Defense for Network Security Based on Immunity Principles 一种基于免疫原理的网络安全深度防御方法

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.65

Yaping Jiang, Jianhua Zhou, Yong Gan, Zengyu Cai

引用次数: 3

An Alliance Based Reputation Model for Internet Autonomous System Trust Evaluation 基于联盟的互联网自治系统信任评估信誉模型

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.104

Ning Hu, Peidong Zhu, Peng Zou

引用次数: 3

Solo: A Lightweight Virtual Machine Solo:轻量级虚拟机

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.7

Xiang Zhang, Jie Ma, Yanchao Miao, Qingwei Meng, Dan Meng

引用次数: 2

Program Optimization of Stencil Based Application on the GPU-Accelerated System 基于模板的gpu加速系统应用程序优化

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.70

Guibin Wang, Xuejun Yang, Y. Zhang, T. Tang, Xudong Fang

{"title":"Program Optimization of Stencil Based Application on the GPU-Accelerated System","authors":"Guibin Wang, Xuejun Yang, Y. Zhang, T. Tang, Xudong Fang","doi":"10.1109/ISPA.2009.70","DOIUrl":"https://doi.org/10.1109/ISPA.2009.70","url":null,"abstract":"Graphic Processing Unit (GPU), with many light-weight data-parallel cores, can provide substantial parallel computational power to accelerate general purpose applications. But the powerful computing capacity could not be fully utilized for memory-intensive applications, which are limited by off-chip memory bandwidth and latency. Stencil computation has abundant parallelism and low computational intensity which make it a useful architectural evaluation benchmark. In this paper, we propose some memory optimizations for a stencil based application mgrid from SPEC 2K benchmarks. Through exploiting data locality in 3-level memory hierarchies and tuning the thread granularity, we reduce the pressure on the off-chip memory bandwidth. To hide the long off-chip memory access latency, we further prefetch data during computation through double-buffer. In order to fully exploit the CPU-GPU heterogeneous system, we redistribute the computation between these two computing resource. Through all these optimizations, we gain 24.2x speedup compared to the simple mapping version, and get as high as 34.3x speedup when compared with a CPU implementation.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128073552","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

Security System for Overlapping Non-dedicated Clusters 重叠非专用集群的安全系统

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.19

M. Stáva, P. Tvrdík

{"title":"Security System for Overlapping Non-dedicated Clusters","authors":"M. Stáva, P. Tvrdík","doi":"10.1109/ISPA.2009.19","DOIUrl":"https://doi.org/10.1109/ISPA.2009.19","url":null,"abstract":"Techniques for building local area network clusters differ from those used for large scale harvesting of idle computing power. The overlapping non dedicated clusters (ONDC) architecture is trying to mix advantages of both techniques. Clusters build in ONDC style can be deployed both on small scale local networks, but as well in large scale over the Internet deployments. In this paper we analyze the security requirements of ONDC and describe our solution. The solution was implemented for the Clondike clustering system, but the same approach can be used for any other ONDC system. The proposed system is inspired by the security mechanisms of existing P2P grid systems and various trust management systems, but it is tailored to exactly match the ONDC requirements. An important aspect of the proposed solution is a combination of locally issued identity based access control and certificates based delegated authorizations. While the identity based access control is the most intuitive way how to express trust for the users of the system, delegated authorizations are an answer for more complex cases. The unique feature of the proposed system is configurable mechanism for authorization distributions and storage that enables users to trade-off a local information availability with local storage requirements.","PeriodicalId":346815,"journal":{"name":"2009 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122960334","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

Distributed Execution of Workflow Using Parallel Partitioning 基于并行分区的工作流分布式执行

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.96

M. Hedayat, Wentong Cai, S. Turner, Shayan Shahand

引用次数: 3

Analysing Internet Information Propagation Using Quality of Service Methodology Based on Algebra of System 基于系统代数的服务质量方法分析互联网信息传播

2009 IEEE International Symposium on Parallel and Distributed Processing with Applications Pub Date : 2009-08-18 DOI: 10.1109/ISPA.2009.87

T. Wang, Q. Qu, Benjamin H. Y. Koo

引用次数: 0