Pub Date : 2015-01-01DOI: 10.1007/978-3-319-10810-0_14
Jan Mitschker, T. Klüner
{"title":"Adsorption and Electronic Excitation of Water on TiO2 (110): Calculation of High-Dimensional Potential Energy Surfaces","authors":"Jan Mitschker, T. Klüner","doi":"10.1007/978-3-319-10810-0_14","DOIUrl":"https://doi.org/10.1007/978-3-319-10810-0_14","url":null,"abstract":"","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"5 1","pages":"191-203"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91398087","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}
Pub Date : 2014-12-01DOI: 10.1109/ICHPCA.2014.7045349
B. GaneshChoudhary, B. ChethanRam
In this paper we propose a way to accomplish Human Computer Interface absolutely in electronic way (without mechanical sensors). The idea is to extirpate old techniques of controlling Robotic arm using joysticks, buttons and supersede with more intuitive technique ie., to control robotic arm by hand motion or gesture. Here we propound an approach to achieve the aforementioned idea employing Image processing technique using web camera. We detect the vital features of hand: fingers by computational geometry calculation enabling real time interaction between hand gestures and Robot. Our system can meticulously locate fingers even when fore-arm is involved. And the system can sustain a certain rotation of palm and fore-arm, which augments the freedom of use in palm center estimation.
{"title":"Real time robotic arm control using hand gestures","authors":"B. GaneshChoudhary, B. ChethanRam","doi":"10.1109/ICHPCA.2014.7045349","DOIUrl":"https://doi.org/10.1109/ICHPCA.2014.7045349","url":null,"abstract":"In this paper we propose a way to accomplish Human Computer Interface absolutely in electronic way (without mechanical sensors). The idea is to extirpate old techniques of controlling Robotic arm using joysticks, buttons and supersede with more intuitive technique ie., to control robotic arm by hand motion or gesture. Here we propound an approach to achieve the aforementioned idea employing Image processing technique using web camera. We detect the vital features of hand: fingers by computational geometry calculation enabling real time interaction between hand gestures and Robot. Our system can meticulously locate fingers even when fore-arm is involved. And the system can sustain a certain rotation of palm and fore-arm, which augments the freedom of use in palm center estimation.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"3 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91374560","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}
Pub Date : 2014-09-22DOI: 10.1109/HPCSim.2014.6903801
Junyi Han
Computational Steering (CS) of numerical simulations has been developed over the last three decades. While it has succeeded in some of its chief aims, the uptake and impact of CS has not been as great as anticipated. This paper aims to investigate the reasons for this, and from this analysis to provide an enhanced CS framework, taking into account both modern developments in end-user devices and changes in the architecture of very large High Performance Computing (HPC) systems (supercomputers). We also consider the impact on CS of the recent interest in Dynamic Data Driven Application Systems (DDDAS) and Cyber-Physical System (CPS). As the beginning phase of our research, we present a general-purpose framework that provides CS and HPC as Web services to widen their uptake and use. Key advantages of this approach, include the re-usability, modularity, real-time 3D web visualization, and capacitating users to access CS and HPC service on portable devices.
{"title":"Steering simulations on high performance computing resources","authors":"Junyi Han","doi":"10.1109/HPCSim.2014.6903801","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903801","url":null,"abstract":"Computational Steering (CS) of numerical simulations has been developed over the last three decades. While it has succeeded in some of its chief aims, the uptake and impact of CS has not been as great as anticipated. This paper aims to investigate the reasons for this, and from this analysis to provide an enhanced CS framework, taking into account both modern developments in end-user devices and changes in the architecture of very large High Performance Computing (HPC) systems (supercomputers). We also consider the impact on CS of the recent interest in Dynamic Data Driven Application Systems (DDDAS) and Cyber-Physical System (CPS). As the beginning phase of our research, we present a general-purpose framework that provides CS and HPC as Web services to widen their uptake and use. Key advantages of this approach, include the re-usability, modularity, real-time 3D web visualization, and capacitating users to access CS and HPC service on portable devices.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"203 1","pages":"1008-1010"},"PeriodicalIF":0.0,"publicationDate":"2014-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77018991","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}
Pub Date : 2014-09-22DOI: 10.1109/HPCSim.2014.6903674
Gemma Sanjuan, C. Brun, T. Margalef, A. Cortés
Wind speed and direction are parameters that affect forest fire propagation dramatically. So, an accurate estimation of such parameters is crucial to predict the fire propagation precisely. WindNInja is a wind field simulator that can easily be coupled to a forest fire propagation simulator such as FARSITE. However, wind field simulators present to main drawbacks: They take too much time to compute the wind field and they require a lot of memory. So, a map partitioning strategy has been developed to compute partial wind field maps that can be aggregated afterwards. Each map part can be computed in parallel and the amount of memory required is available in a single node. In this work a methodology to determine the most adequate map partitioning is presented. The map part shape, map part size, amount of overlapping and number of parts have been studied considering execution time and effects on wind field estimation. The results are based on a wide experimentation and are validated with real case scenarios.
{"title":"Determining map partitioning to accelerate wind field calculation","authors":"Gemma Sanjuan, C. Brun, T. Margalef, A. Cortés","doi":"10.1109/HPCSim.2014.6903674","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903674","url":null,"abstract":"Wind speed and direction are parameters that affect forest fire propagation dramatically. So, an accurate estimation of such parameters is crucial to predict the fire propagation precisely. WindNInja is a wind field simulator that can easily be coupled to a forest fire propagation simulator such as FARSITE. However, wind field simulators present to main drawbacks: They take too much time to compute the wind field and they require a lot of memory. So, a map partitioning strategy has been developed to compute partial wind field maps that can be aggregated afterwards. Each map part can be computed in parallel and the amount of memory required is available in a single node. In this work a methodology to determine the most adequate map partitioning is presented. The map part shape, map part size, amount of overlapping and number of parts have been studied considering execution time and effects on wind field estimation. The results are based on a wide experimentation and are validated with real case scenarios.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"15 1","pages":"96-103"},"PeriodicalIF":0.0,"publicationDate":"2014-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88674507","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}
Single-node computation speed is essential in large-scale parallel solutions of particle transport problems. The Intel Many Integrated Core (MIC) architecture supports more than 200 hardware threads as well as 512-bit double precision float-point vector operations. In this paper, we use the native model of MIC in the parallelization of the simulation of one energy group time-independent deterministic discrete ordinates particle transport in 3D Cartesian geometry (Sweep3D). The implementation adopts both hardware threads and vector units in MIC to efficiently exploit multi-level parallelism in the discrete ordinates method when keeping good data locality. Our optimized implementation is verified on target MIC and can provide up to 1.99 times speedup based on the original MPI code on Intel Xeon E5-2660 CPU when flux fixup is off. Compared with the prior on NVIDIA Tesla M2050 GPU, the speedup of up to 1.23 times is obtained. In addition, the difference between the implementations on MIC and GPU is discussed as well.
在粒子输运问题的大规模并行解中，单节点计算速度至关重要。Intel多集成核心(MIC)架构支持200多个硬件线程以及512位双精度浮点向量操作。在本文中，我们使用MIC的原生模型来并行化模拟三维笛卡尔几何中一能量群时间无关的确定性离散坐标粒子输运(Sweep3D)。该实现在保证数据局部性的前提下，同时采用了硬件线程和MIC中的矢量单元，有效地利用了离散坐标法中的多级并行性。我们的优化实现在目标MIC上进行了验证，当通量修复关闭时，基于Intel Xeon E5-2660 CPU上的原始MPI代码，可以提供高达1.99倍的加速。与之前的NVIDIA Tesla M2050 GPU相比，获得了高达1.23倍的加速。此外，还讨论了在MIC和GPU上实现的不同之处。
{"title":"Parallel 3D deterministic particle transport on Intel MIC architecture","authors":"Qinglin Wang, Zuocheng Xing, Jie Liu, X. Qiang, Chunye Gong, Jiang Jiang","doi":"10.1109/HPCSim.2014.6903685","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903685","url":null,"abstract":"Single-node computation speed is essential in large-scale parallel solutions of particle transport problems. The Intel Many Integrated Core (MIC) architecture supports more than 200 hardware threads as well as 512-bit double precision float-point vector operations. In this paper, we use the native model of MIC in the parallelization of the simulation of one energy group time-independent deterministic discrete ordinates particle transport in 3D Cartesian geometry (Sweep3D). The implementation adopts both hardware threads and vector units in MIC to efficiently exploit multi-level parallelism in the discrete ordinates method when keeping good data locality. Our optimized implementation is verified on target MIC and can provide up to 1.99 times speedup based on the original MPI code on Intel Xeon E5-2660 CPU when flux fixup is off. Compared with the prior on NVIDIA Tesla M2050 GPU, the speedup of up to 1.23 times is obtained. In addition, the difference between the implementations on MIC and GPU is discussed as well.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"46 1","pages":"186-192"},"PeriodicalIF":0.0,"publicationDate":"2014-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82698866","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}
Pub Date : 2014-07-21DOI: 10.1109/HPCSim.2014.6903684
J. Pickard, J. A. Carretero, V. Bhavsar
This work presents an initial framework for an efficient new technique for obtaining task-optimized parallel manipulators with the aid of parallel computing through OpenMP directives. A cable-driven parallel manipulator is an architecture whose actuated limbs are cables. All of the cables must remain in constant positive tension to constrain the motion of the moving end-effector. A Differential Evolution algorithm is applied in order to optimize the topology and actuator specifications of a cable-driven parallel manipulator. The algorithm's intrinsic parallelism is exploited using OpenMP directives to evaluate the manipulator's associated reachable and wrench workspaces. The results show that this algorithm is effective at obtaining a task-optimized architecture for the cable-driven parallel manipulator. Parallel implementation is shown to improve the algorithm's performance with a speedup of 7.4 times using ten cores on the Atlantic Computational Excellence Network (ACEnet) Fundy compute resource which utilizes Parallel Sun x4600 and x2200 AMD Opteron (dual-core) clusters.
{"title":"Task-optimized cable-actuated planar parallel manipulator architecture and its concurrent implementation","authors":"J. Pickard, J. A. Carretero, V. Bhavsar","doi":"10.1109/HPCSim.2014.6903684","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903684","url":null,"abstract":"This work presents an initial framework for an efficient new technique for obtaining task-optimized parallel manipulators with the aid of parallel computing through OpenMP directives. A cable-driven parallel manipulator is an architecture whose actuated limbs are cables. All of the cables must remain in constant positive tension to constrain the motion of the moving end-effector. A Differential Evolution algorithm is applied in order to optimize the topology and actuator specifications of a cable-driven parallel manipulator. The algorithm's intrinsic parallelism is exploited using OpenMP directives to evaluate the manipulator's associated reachable and wrench workspaces. The results show that this algorithm is effective at obtaining a task-optimized architecture for the cable-driven parallel manipulator. Parallel implementation is shown to improve the algorithm's performance with a speedup of 7.4 times using ten cores on the Atlantic Computational Excellence Network (ACEnet) Fundy compute resource which utilizes Parallel Sun x4600 and x2200 AMD Opteron (dual-core) clusters.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"157 1","pages":"178-185"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73479048","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}
Pub Date : 2014-07-21DOI: 10.1109/HPCSim.2014.6903708
L. Foschini, Alessandro Pernafini, Antonio Corradi, M. Rosati, Alessandro Federico, G. Fiameni
Despite its great promises, current Cloud offering has not been fully exploited for the management of Next-Generation Sequencing technologies. In fact, while dynamic resource allocation is typically required to ensure efficient and effective usage of the Cloud resources, Cloud providers have to deal with complex services, usually treated as black-boxes; hence, the estimation of the maximum number of resources that could improve service execution is a big challenge. This paper proposes and explores the benefits of Cloud deployment when operating a processor-hungry RNA alignment tool. The goal is to show the advantages of the virtualized and Cloud-aware approach compared to a typical bare-metal deployment. Extensive results demonstrate that our approach is as a viable first step toward easing the deployment and improving run-time service scaling.
{"title":"A performance evaluation of TopHat RNA sequences alignment tool on openstack-based cloud environments","authors":"L. Foschini, Alessandro Pernafini, Antonio Corradi, M. Rosati, Alessandro Federico, G. Fiameni","doi":"10.1109/HPCSim.2014.6903708","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903708","url":null,"abstract":"Despite its great promises, current Cloud offering has not been fully exploited for the management of Next-Generation Sequencing technologies. In fact, while dynamic resource allocation is typically required to ensure efficient and effective usage of the Cloud resources, Cloud providers have to deal with complex services, usually treated as black-boxes; hence, the estimation of the maximum number of resources that could improve service execution is a big challenge. This paper proposes and explores the benefits of Cloud deployment when operating a processor-hungry RNA alignment tool. The goal is to show the advantages of the virtualized and Cloud-aware approach compared to a typical bare-metal deployment. Extensive results demonstrate that our approach is as a viable first step toward easing the deployment and improving run-time service scaling.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"11 1","pages":"358-365"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75218084","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}
Pub Date : 2014-07-21DOI: 10.1109/HPCSim.2014.6903770
R. Broglia, S. Zaghi, R. Muscari, F. Salvadore
In this paper we present the parallel solver χnavis, a general purpose solver for Computational Fluid Dynamics (CFD). The solver is based on the finite volume discretization of the unsteady incompressible Navier-Stokes equations; main features include a level set approach to handle free surface flows and a dynamical overlapping grids approach, which allows to deal with bodies in relative motion. The baseline code features a hybrid MPI/OpenMP parallelization, proven to scale when running on order of hundreds of cores (i.e. Tier-1 platforms). This paper deals with latest developments aimed to extend the capabilities of the χnavis software to exploit modern parallel architectures. Scalability properties will be demonstrated for different cases. As example of application, the computation of the flow fields around a submarine in prescribed oscillatory motion and a surface flow around a catamaran in steady drift advancement are presented.
{"title":"Enabling hydrodynamics solver for efficient parallel simulations","authors":"R. Broglia, S. Zaghi, R. Muscari, F. Salvadore","doi":"10.1109/HPCSim.2014.6903770","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903770","url":null,"abstract":"In this paper we present the parallel solver χnavis, a general purpose solver for Computational Fluid Dynamics (CFD). The solver is based on the finite volume discretization of the unsteady incompressible Navier-Stokes equations; main features include a level set approach to handle free surface flows and a dynamical overlapping grids approach, which allows to deal with bodies in relative motion. The baseline code features a hybrid MPI/OpenMP parallelization, proven to scale when running on order of hundreds of cores (i.e. Tier-1 platforms). This paper deals with latest developments aimed to extend the capabilities of the χnavis software to exploit modern parallel architectures. Scalability properties will be demonstrated for different cases. As example of application, the computation of the flow fields around a submarine in prescribed oscillatory motion and a surface flow around a catamaran in steady drift advancement are presented.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"64 1","pages":"803-810"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75814030","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}
Pub Date : 2014-07-21DOI: 10.1109/HPCSim.2014.6903689
G. Utrera, Marisa Gil, X. Martorell
Exascale applications for civil engineering, simulations and other fields related with current research make intensive use of large sparse matrices. A characteristic of these matrices is the difficulty of balancing communication and computation, so that even when these two phases are overlapped the application does not achieve a good overall scalability, but instead suffers from a loss of performance. Some proposals have been presented in order to diminish this drawback, based on the hybrid use of programming models, using MPI as the communication basis and threads for computation -mainly OpenMP, but also Cilk, CUDA or OpenCL, to adapt to new heterogeneous platforms. In this work, we evaluate the impact of providing task-based parallelism instead of fork-join parallelism. As regards communication, the appearance of faster networks with specific optimizations and internal protocol characteristics makes it appealing to analyze and evaluate the influence of these networks on performance execution. We evaluate our results on two different communication networks: 10Gigabit Ethernet and Infiniband. For our evaluations we run the miniFE miniapplication of the Mantevo suite benchmark, in a homogeneous supercomputer platform based on Intel SandyBridge processors. Experimental results show how the network behavior can affect performance and how it can be managed via task-based models: from a hybrid MPI/OpenMP version that overlaps communication and computation, our task-based proposal MPI/OmpSs obtains up to 60% improvement.
{"title":"Analyzing the impact of programming models for efficient communication overlap in high-speed networks","authors":"G. Utrera, Marisa Gil, X. Martorell","doi":"10.1109/HPCSim.2014.6903689","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903689","url":null,"abstract":"Exascale applications for civil engineering, simulations and other fields related with current research make intensive use of large sparse matrices. A characteristic of these matrices is the difficulty of balancing communication and computation, so that even when these two phases are overlapped the application does not achieve a good overall scalability, but instead suffers from a loss of performance. Some proposals have been presented in order to diminish this drawback, based on the hybrid use of programming models, using MPI as the communication basis and threads for computation -mainly OpenMP, but also Cilk, CUDA or OpenCL, to adapt to new heterogeneous platforms. In this work, we evaluate the impact of providing task-based parallelism instead of fork-join parallelism. As regards communication, the appearance of faster networks with specific optimizations and internal protocol characteristics makes it appealing to analyze and evaluate the influence of these networks on performance execution. We evaluate our results on two different communication networks: 10Gigabit Ethernet and Infiniband. For our evaluations we run the miniFE miniapplication of the Mantevo suite benchmark, in a homogeneous supercomputer platform based on Intel SandyBridge processors. Experimental results show how the network behavior can affect performance and how it can be managed via task-based models: from a hybrid MPI/OpenMP version that overlaps communication and computation, our task-based proposal MPI/OmpSs obtains up to 60% improvement.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"6 1","pages":"218-225"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78764673","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}
Pub Date : 2014-07-21DOI: 10.1109/HPCSim.2014.6903794
Farag Azzedin, Mohammed Onimisi Yahaya
BitTorrent has gained popularity as a file sharing environment. The concept of sharing assumes that every peer in the environment contributes. However, the action of not sharing negates the fundamental concepts of BitTorrent. In this paper, we investigate the free riding phenomenon in BitTorrent. Through simulation experiments, we study in detail BitTorrent's vulnerability to free riders.
{"title":"BitTorrent vulnerability to free riders: Root causes analysis","authors":"Farag Azzedin, Mohammed Onimisi Yahaya","doi":"10.1109/HPCSim.2014.6903794","DOIUrl":"https://doi.org/10.1109/HPCSim.2014.6903794","url":null,"abstract":"BitTorrent has gained popularity as a file sharing environment. The concept of sharing assumes that every peer in the environment contributes. However, the action of not sharing negates the fundamental concepts of BitTorrent. In this paper, we investigate the free riding phenomenon in BitTorrent. Through simulation experiments, we study in detail BitTorrent's vulnerability to free riders.","PeriodicalId":6469,"journal":{"name":"2014 International Conference on High Performance Computing & Simulation (HPCS)","volume":"15 1","pages":"978-984"},"PeriodicalIF":0.0,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81426447","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：