2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing最新文献

筛选
英文 中文
Analysis of the BitTorrent Protocol Modified with Fountain Code 用喷泉码修改BitTorrent协议的分析
E. Costa-Montenegro, P. Rodríguez-Hernández, C. López-Bravo, Ana Belén Barragáns-Martínez
{"title":"Analysis of the BitTorrent Protocol Modified with Fountain Code","authors":"E. Costa-Montenegro, P. Rodríguez-Hernández, C. López-Bravo, Ana Belén Barragáns-Martínez","doi":"10.1109/3PGCIC.2012.10","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.10","url":null,"abstract":"Peer to Peer (P2P) computer networks rely on direct connections between participants instead of conventional centralized resources. These networks are useful for many purposes, but the killer application nowadays is file sharing. BitTorrent is a very popular protocol for this matter. In this paper, we use a multi-agent model of a BitTorrent network. In it, each BitTorrent client is an agent that interacts with other agents and reacts autonomously, following the same decision algorithms as real clients. Their goals are downloading contents in the shortest possible time and sharing them with other agents. The use of this multi-agent model allows us to introduce modifications to the protocol. We have modified this model to use fountain codes, also known as rate less erasure codes, a class of codes in which the original source symbols can be recovered from any subset of the encoding symbols. We evaluated how BitTorrent performs using these codes and compared with its normal behavior.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128094481","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
Cloud Protection by Obfuscation: Techniques and Metrics 云保护的混淆:技术和度量
Muhammad Hataba, A. El-Mahdy
{"title":"Cloud Protection by Obfuscation: Techniques and Metrics","authors":"Muhammad Hataba, A. El-Mahdy","doi":"10.1109/3PGCIC.2012.18","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.18","url":null,"abstract":"This paper presents a survey of software protection based on the concept of security by obscurity, code obfuscation is now a hot topic in the field of digital right management, protecting against reverse engineering and tampering. Obfuscation comes in handy in situations where depending on cryptographic techniques is not enough, this is typical in remote execution situations where the software is executed on an unforeseen exposed hostile environment, such as the new computing platforms: cloud-computing paradigm and smartphones. Obfuscation is popular among malware and virus developers but also game developers and industrials who need to protect their intellectual property. They use it to conceal the operation of their code while executing in an uncontrolled environment. In this paper, we discuss the same concepts but for the different purpose of cloud security. We explore the state-of-the art in techniques and algorithms for software obfuscation. We also address how to assess the strength of these techniques via a concrete set of metrics.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130855961","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}
引用次数: 26
Addressing QoS in Grids through a Fairshare Meta-scheduling In-Advance Architecture 通过Fairshare元调度超前架构在网格中寻址QoS
Luis Tomás, Per-Olov Östberg, María Blanca Caminero, C. Carrión, E. Elmroth
{"title":"Addressing QoS in Grids through a Fairshare Meta-scheduling In-Advance Architecture","authors":"Luis Tomás, Per-Olov Östberg, María Blanca Caminero, C. Carrión, E. Elmroth","doi":"10.1109/3PGCIC.2012.7","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.7","url":null,"abstract":"Federated Grid resources typically span multiple administrative domains and utilize heterogeneous schedulers. This complexity complicates not only provisioning of quality of service but also management and enforcement of end-user resource utilization allocations. to overcome these problems, we propose to combine high-level meta-scheduling techniques with lower-level fairs hare prioritization mechanisms to create a framework that improves end-user quality of service in heterogeneous distributed computing environments. to illustrate the approach we present a prototype architecture based on two existing systems, the meta-scheduling framework SA-Layer and the distributed fairs hare prioritization system Aequus. the proposed architecture constitutes a predictive meta-scheduling architecture that performs fair user-level scheduling prioritization and enacts resource utilization quotas, whilst also providing synergetic effects that improve the performance of the individual system components. to characterize the contribution, the proposed system is evaluated on a test bed consisting of geographically dispersed, heterogeneous computing resources spanning multiple administration domains.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132863230","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}
引用次数: 3
Pool vs. Island Based Evolutionary Algorithms: An Initial Exploration 基于池与岛的进化算法:初步探索
J. J. M. Guervós, A. García, C. Fernandes, Anna I. Esparcia-Alcázar, J. L. Laredo
{"title":"Pool vs. Island Based Evolutionary Algorithms: An Initial Exploration","authors":"J. J. M. Guervós, A. García, C. Fernandes, Anna I. Esparcia-Alcázar, J. L. Laredo","doi":"10.1109/3PGCIC.2012.56","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.56","url":null,"abstract":"This paper explores the scalability and performance of pool and island based evolutionary algorithms, both of them using as a mean of interaction an object store, we call this family of algorithms SofEA. This object store allows the different clients to interact asynchronously, the point of the creation of this framework is to build a system for spontaneous and voluntary distributed evolutionary computation. The fact that each client is autonomous leads to a complex behavior that will be examined in the work, so that the design can be validated, rules of thumb can be extracted, and the limits of scalability can be found. In this paper we advance the design of an asynchronous, fault-tolerant and scalable distributed evolutionary algorithm based on the object store CouchDB. We test experimentally the different options and show the trade-offs that pool and island-based solutions offer.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132373776","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}
引用次数: 9
A General Purpose Parallel Block Structured Open Source Flow Solver 通用并行块结构开源流求解器
M. Mendina, M. Draper, Gabriel Narancio, G. Usera, A. P. Soares
{"title":"A General Purpose Parallel Block Structured Open Source Flow Solver","authors":"M. Mendina, M. Draper, Gabriel Narancio, G. Usera, A. P. Soares","doi":"10.1109/3PGCIC.2012.2","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.2","url":null,"abstract":"A general purpose fluid flow solver, caffa3d.MBRi, is presented which features a block structured framework to accommodate both a flexible approach to geometry representation and a straightforward implementation of parallel capabilities through the MPI library. Representation of complex geometries can be handled semi automatically through a combination of body fitted blocks of grids and the immersed boundary condition strategy over both Cartesian and body fitted grid blocks. The parallelization strategy is based on the same block structured framework, by means of encapsulated MPI calls performing a set of conceptually defined high level communication tasks. A set of real world applications ranging from bioengineering to microclimate scenarios is presented to demonstrate the capabilities of the solver, which is open source and freely available through the web page.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122216100","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 New Metric for Comparison of P2P Search Algorithms 一种比较P2P搜索算法的新度量
F. Sharifkhani, Mohammadreza Pakravan
{"title":"A New Metric for Comparison of P2P Search Algorithms","authors":"F. Sharifkhani, Mohammadreza Pakravan","doi":"10.1109/3PGCIC.2012.3","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.3","url":null,"abstract":"Success rate, query hit rate and speed of search are some common metrics for evaluating p2p search algorithms. Yet, these metrics do not consider properties of discovered sources and their impact on download performance. A requesting peer is interested in stable serving peers with high upload bandwidth to minimize its download time and therefore, this is the superiority of a search algorithm to find sources with higher upload bandwidth in the p2p heterogeneous environment. In this paper, a new bio-inspired metric for comparing p2p search algorithms is introduced which takes the upload bandwidth of supplying nodes into account as a factor influencing quality of a search algorithm and user satisfaction. This metric is inspired from efficiency metric in foraging theory which assumes that animals search for nutrients in a way that maximizes their intake energy per spent foraging time.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121554613","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
An Optimized MPI-based Approach for Solving the N-Queens Problem 一种基于mpi优化的N-Queens问题求解方法
A. Khademzadeh, Morteza Aghamohammadian Sharbaf, Amin Bayati
{"title":"An Optimized MPI-based Approach for Solving the N-Queens Problem","authors":"A. Khademzadeh, Morteza Aghamohammadian Sharbaf, Amin Bayati","doi":"10.1109/3PGCIC.2012.8","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.8","url":null,"abstract":"The brute-force solution of n-queens problem is computationally expensive due to the large number of possible positioning of n number of queens on an n×n chessboard. In order to meet this challenge, the number of possibilities can be reduced by applying some rules, and the time needed to examine the remaining ones can become shorter by processing them with parallelism. We have introduced an optimized recursive parallel implementation of the n-queens problem using MPI which shows significant improvement in speed compared to the previous MPI version.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"5 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123631524","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
Secret Key Generation within Peer-to-Peer Network Overlays 点对点网络覆盖中的秘密密钥生成
M. G. Madiseh, M. McGuire, S. Neville
{"title":"Secret Key Generation within Peer-to-Peer Network Overlays","authors":"M. G. Madiseh, M. McGuire, S. Neville","doi":"10.1109/3PGCIC.2012.62","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.62","url":null,"abstract":"Key generation, a well known alternative to key distribution, allows two (or more) parties to concurrently generate the same secret key through their independent measurements of a mutually observable random information source. Within wireless networks the reciprocity of channel characterization measurements can be used to provide this required random source of information. This work enables key generation within peer-to-peer wired network by algorithmically extending the notion of wireless reciprocity into the wired domain. It is shown that for larger-scale Erdos-Renyi style peer-to-peer networks, the developed key generation approach remains secure when up to 75% of the peer-to-peer network's edge are assumed to be adversary controlled. in comparison to prior works, the proposed approach requires zero knowledge of either the network topology or the link capacities allowing it to be particularly well suited to today's global-scale peer-to-peer networks.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"871 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122648448","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
Solving Very Large Optimization Problems (Up to One Billion Variables) with a Parallel Evolutionary Algorithm in CPU and GPU 在CPU和GPU上用并行进化算法求解超大型优化问题(多达10亿个变量)
S. Iturriaga, Sergio Nesmachnow
{"title":"Solving Very Large Optimization Problems (Up to One Billion Variables) with a Parallel Evolutionary Algorithm in CPU and GPU","authors":"S. Iturriaga, Sergio Nesmachnow","doi":"10.1109/3PGCIC.2012.63","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.63","url":null,"abstract":"This article presents the application of a parallel evolutionary algorithm implemented in both CPU and Graphic Processing Units (GPU), to solve large instances of the noisy OneMax problem with up to one billion variables. Actually, new GPU platforms provide the computing power needed to apply massively parallel strategies to solve large problems. We report here the experimental evaluation of both CPU and GPU implementations for a compact evolutionary algorithm. the proposed method demonstrates a high problem solving efficacy and shows a good scalability behavior when facing high dimension instances of the noisy OneMax problem, improving the computational efficiency and the results reported in previous similar approaches developed on CPU.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123986855","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}
引用次数: 13
Boosting Open-Source Database Engines with Graphics Processors 用图形处理器提升开源数据库引擎
Nicolas Dechamps, M. Bagein, M. Benjelloun, S. Mahmoudi
{"title":"Boosting Open-Source Database Engines with Graphics Processors","authors":"Nicolas Dechamps, M. Bagein, M. Benjelloun, S. Mahmoudi","doi":"10.1109/3PGCIC.2012.14","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.14","url":null,"abstract":"In recent years, graphics chips known as GPUs have become increasingly important in the field of supercomputing. These chips are effective on heavy and highly parallelizable calculations. They naturally found applications in the scientific world for example in weather forecasting, molecular modeling and audio or video processing. Previous work has shown the ability to implement on a GPU some of the operations that can typically be found in database engines. in this context, we studied how to adapt an open source relational database engine to allow it to run on a GPU. for this, we developed a prototype based on the SQLite open source project allowing us to perform a variety of insertion and selection queries that manipulate data stored in the GPU memory. Our database engine support record filtering, relational joins, aggregation functions and most of the operators and functions working on both numbers and strings. for all of those, we implemented efficient algorithms taking into account the specific architecture of the GPU. the execution speedups of most queries were improved by a factor from ten to two hundred in comparison of the CPU counterpart. Therefore, our GPU-running database engine is able to improve system responsiveness and/or reduce the number of machines needed for an equivalent amount of data to process, thereby improving the energy efficiency.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115866533","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
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学术官方微信
小红书