首页 > 最新文献

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

英文 中文
cHPP controller: A High Performance Hyper-node Hardware Accelerator cHPP控制器:高性能超节点硬件加速器
Yong Su, Feilong Liu, Zheng Cao, Zhan Wang, Xiaoli Liu, Xuejun An, Ninghui Sun
The high-density blade server provides an attractive solution for the rapid increasing demand on computing. The degree of parallelism inside a blade enclosure nowadays has reach up to hundreds of cores. In such parallelism, it is necessary to accelerate communications inside a blade enclosure. However, commercial products seldom set foot in the optimization based on hardware. A hyper-node controller is proposed to provide a low overhead and high performance interconnection based on PCIe, which supports global address space, user-level communication, and efficient communication primitives. Furthermore, the efficient sharing of I/O resource is another goal of this design. The prototype of the hyper-node controller is implemented in FPGA. The testing results show the lowest latency is only 1.242us and the highest bandwidth is 3.19GB/s, which is almost 99.7% of the theoretic peak bandwidth.
高密度刀片服务器为快速增长的计算需求提供了一个有吸引力的解决方案。如今,刀片机箱内部的并行度已经达到了数百个内核。在这种并行性中,有必要加速刀片机箱内的通信。然而,商用产品很少涉足基于硬件的优化。为了提供基于PCIe的低开销、高性能互连,提出了一种支持全局地址空间、用户级通信和高效通信原语的超节点控制器。此外,有效地共享I/O资源是本设计的另一个目标。在FPGA上实现了超节点控制器的原型。测试结果表明,最低延迟仅为1.242us,最高带宽为3.19GB/s,几乎达到理论峰值带宽的99.7%。
{"title":"cHPP controller: A High Performance Hyper-node Hardware Accelerator","authors":"Yong Su, Feilong Liu, Zheng Cao, Zhan Wang, Xiaoli Liu, Xuejun An, Ninghui Sun","doi":"10.1109/PDCAT.2013.25","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.25","url":null,"abstract":"The high-density blade server provides an attractive solution for the rapid increasing demand on computing. The degree of parallelism inside a blade enclosure nowadays has reach up to hundreds of cores. In such parallelism, it is necessary to accelerate communications inside a blade enclosure. However, commercial products seldom set foot in the optimization based on hardware. A hyper-node controller is proposed to provide a low overhead and high performance interconnection based on PCIe, which supports global address space, user-level communication, and efficient communication primitives. Furthermore, the efficient sharing of I/O resource is another goal of this design. The prototype of the hyper-node controller is implemented in FPGA. The testing results show the lowest latency is only 1.242us and the highest bandwidth is 3.19GB/s, which is almost 99.7% of the theoretic peak bandwidth.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115373713","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
Performance Analysis on the Assessment of Fingerprint Image Based on Blur Measurement 基于模糊测量的指纹图像评价性能分析
M. Khalil, F. Kurniawan
Processing the fingerprint image captured from the mobile phone camera is problematic. The addressed problem is such as degree of freedom, blurry, noisy and weak ridges-valleys images. In this paper, problem of blur assessment on fingerprint image is the main consent. In this regards, dataset of fingerprint image is collected from several subjects and different environment to obtain a clear and blur fingerprint image. The ground truth for this dataset is assigned by human vision. According to literature, the suitable blur evaluation is based on no-reference strategy. Hence, this paper modified existing no-reference blur assessment so it is suitable for fingerprint image. The proposed method achieved promising result and able to detect blur and clear fingerprint image.
处理从手机摄像头捕获的指纹图像是有问题的。解决了图像自由度大、模糊、杂波和弱脊谷图像等问题。本文主要研究指纹图像的模糊评价问题。为此,从不同的对象和不同的环境中采集指纹图像数据集,获得清晰模糊的指纹图像。该数据集的基础真值是由人类视觉分配的。根据文献,合适的模糊评价是基于无参考策略。因此,本文对现有的无参考模糊评估方法进行了改进,使其更适用于指纹图像。该方法取得了较好的效果,能够检测出模糊和清晰的指纹图像。
{"title":"Performance Analysis on the Assessment of Fingerprint Image Based on Blur Measurement","authors":"M. Khalil, F. Kurniawan","doi":"10.1109/PDCAT.2013.58","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.58","url":null,"abstract":"Processing the fingerprint image captured from the mobile phone camera is problematic. The addressed problem is such as degree of freedom, blurry, noisy and weak ridges-valleys images. In this paper, problem of blur assessment on fingerprint image is the main consent. In this regards, dataset of fingerprint image is collected from several subjects and different environment to obtain a clear and blur fingerprint image. The ground truth for this dataset is assigned by human vision. According to literature, the suitable blur evaluation is based on no-reference strategy. Hence, this paper modified existing no-reference blur assessment so it is suitable for fingerprint image. The proposed method achieved promising result and able to detect blur and clear fingerprint image.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127587265","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
Privacy-Preserving Ranked Fuzzy Keyword Search over Encrypted Cloud Data 基于加密云数据的保隐私排序模糊关键字搜索
Qunqun Xu, Hong Shen, Yingpeng Sang, Hui Tian
As Cloud Computing becomes popular, more and more data owners prefer to store their data into the cloud for great flexibility and economic savings. In order to protect the data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a challenging task. Although traditional searchable symmetric encryption schemes allow users to securely search over encrypted data through keywords and selectively retrieve files of interest without capturing any relevance of data files or search keywords, and fuzzy keyword search on encrypted data allows minor typos and format inconsistencies, secure ranked keyword search captures the relevance of data files and returns the results that are wanted most by users. These techniques function unilaterally, which greatly reduces the system usability and efficiency. In this paper, for the first time, we define and solve the problem of privacy-preserving ranked fuzzy keyword search over encrypted cloud data. Ranked fuzzy keyword search greatly enhances system usability and efficiency when exact match fails. It returns the matching files in a ranked order with respect to certain relevance criteria (e.g., keyword frequency) based on keyword similarity semantics. In our solution, we exploit the edit distance to quantify keyword similarity and dictionary-based fuzzy set construction to construct fuzzy keyword sets, which greatly reduces the index size, storage and communication costs. We choose the efficient similarity measure of "coordinate matching", i.e., as many matches as possible, to obtain the relevance of data files to the search keywords.
随着云计算的流行,越来越多的数据所有者倾向于将数据存储到云中,以获得极大的灵活性和经济效益。为了保护数据隐私,敏感数据通常需要在外包之前进行加密,这使得有效利用数据成为一项具有挑战性的任务。虽然传统的可搜索对称加密方案允许用户通过关键字安全地搜索加密数据,并有选择地检索感兴趣的文件,而不会捕获数据文件或搜索关键字的任何相关性,并且对加密数据的模糊关键字搜索允许轻微的拼写错误和格式不一致,但安全排名关键字搜索捕获数据文件的相关性并返回用户最需要的结果。这些技术的功能是单方面的,大大降低了系统的可用性和效率。本文首次定义并解决了加密云数据上的隐私保护排序模糊关键字搜索问题。排序模糊关键字搜索在精确匹配失败的情况下,大大提高了系统的可用性和效率。它根据关键字相似语义,按照特定的相关标准(例如,关键字频率)按顺序返回匹配的文件。在我们的解决方案中,我们利用编辑距离来量化关键字相似度,并基于字典构建模糊关键字集来构建模糊关键字集,从而大大减少了索引大小、存储和通信成本。我们选择“坐标匹配”的高效相似性度量,即尽可能多的匹配,以获得数据文件与搜索关键词的相关性。
{"title":"Privacy-Preserving Ranked Fuzzy Keyword Search over Encrypted Cloud Data","authors":"Qunqun Xu, Hong Shen, Yingpeng Sang, Hui Tian","doi":"10.1109/PDCAT.2013.44","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.44","url":null,"abstract":"As Cloud Computing becomes popular, more and more data owners prefer to store their data into the cloud for great flexibility and economic savings. In order to protect the data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a challenging task. Although traditional searchable symmetric encryption schemes allow users to securely search over encrypted data through keywords and selectively retrieve files of interest without capturing any relevance of data files or search keywords, and fuzzy keyword search on encrypted data allows minor typos and format inconsistencies, secure ranked keyword search captures the relevance of data files and returns the results that are wanted most by users. These techniques function unilaterally, which greatly reduces the system usability and efficiency. In this paper, for the first time, we define and solve the problem of privacy-preserving ranked fuzzy keyword search over encrypted cloud data. Ranked fuzzy keyword search greatly enhances system usability and efficiency when exact match fails. It returns the matching files in a ranked order with respect to certain relevance criteria (e.g., keyword frequency) based on keyword similarity semantics. In our solution, we exploit the edit distance to quantify keyword similarity and dictionary-based fuzzy set construction to construct fuzzy keyword sets, which greatly reduces the index size, storage and communication costs. We choose the efficient similarity measure of \"coordinate matching\", i.e., as many matches as possible, to obtain the relevance of data files to the search keywords.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133247242","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}
引用次数: 16
PHR: A Pipelined Heterogeneous Recovery for RAID6-Coded Storage Systems PHR:用于raid6编码存储系统的流水线异构恢复
Fang Niu, Yinlong Xu, Yunfeng Zhu, Yan Zhang
With the rapid growth of data and the growing demand from users on the system performance, data availability has become the most important issue in large-scale storage systems. Due to the ability to provide space-optimal data redundancy to protect against node failures, erasure codes have seen widely deployment. To ensure data availability, it is crucial to recover node failures quickly. In this paper, we propose PHR, a pipelined heterogeneous recovery optimization for failure recovery in RAID-6 coded storage systems. Our PHR takes into account both I/O parallelism and node heterogeneity in practical storage systems, and returns an efficient recovery solution timely. We parallelize our PHR algorithm in a pipelined manner, so as to further improve failure recovery performance. With the quantitative simulation studies and extensive test bed experiments, we show our PHR significantly reduces recovery time and also user response time.
随着数据量的快速增长和用户对系统性能的要求越来越高,数据的可用性已经成为大规模存储系统中最重要的问题。由于能够提供空间最优的数据冗余以防止节点故障,因此擦除码得到了广泛的部署。为了保证数据的可用性,快速恢复节点故障至关重要。在本文中,我们提出了PHR,一种用于RAID-6编码存储系统故障恢复的流水线异构恢复优化。我们的PHR同时考虑了实际存储系统中的I/O并行性和节点异构性,并及时返回高效的恢复解决方案。我们以流水线的方式并行化我们的PHR算法,从而进一步提高故障恢复性能。通过定量模拟研究和广泛的试验台实验,我们表明我们的PHR显著减少了恢复时间和用户响应时间。
{"title":"PHR: A Pipelined Heterogeneous Recovery for RAID6-Coded Storage Systems","authors":"Fang Niu, Yinlong Xu, Yunfeng Zhu, Yan Zhang","doi":"10.1109/PDCAT.2013.8","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.8","url":null,"abstract":"With the rapid growth of data and the growing demand from users on the system performance, data availability has become the most important issue in large-scale storage systems. Due to the ability to provide space-optimal data redundancy to protect against node failures, erasure codes have seen widely deployment. To ensure data availability, it is crucial to recover node failures quickly. In this paper, we propose PHR, a pipelined heterogeneous recovery optimization for failure recovery in RAID-6 coded storage systems. Our PHR takes into account both I/O parallelism and node heterogeneity in practical storage systems, and returns an efficient recovery solution timely. We parallelize our PHR algorithm in a pipelined manner, so as to further improve failure recovery performance. With the quantitative simulation studies and extensive test bed experiments, we show our PHR significantly reduces recovery time and also user response time.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241588","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
Group Leader Dominated Teaching-Learning Based Optimization 小组领导主导——基于教学的优化
Chang-Huang Chen
Teaching-learning based optimization (TLBO), inspired from the teaching-learning process in a classroom, is a newly developed population based algorithm. Except population size and maximum number of iteration, it does not require any specific parameters. TLBO consists of two modes of searching phase, teacher and learner phase. In this paper, every learner is assigned to at least one groups and, instead of a learner studied by interacting directly with other learners, group leader is responsible for raising up the member's knowledge, i.e., to explore for optimal solution. The idea is analog to group discussion in which group leader always dominate group discussion direction and performance. For simplicity, the proposed algorithm will be denoted as LTLBO. The effectiveness of the method is tested on many benchmark problems with different characteristics and the results are compared with original TLBO and particle swarm optimization (PSO).
基于教学的优化算法(TLBO)是一种新发展起来的基于群体的优化算法,它的灵感来自于课堂教学过程。除了种群大小和最大迭代次数外,它不需要任何特定参数。TLBO包括搜索阶段、教师阶段和学习者阶段两种模式。在本文中,每个学习者被分配到至少一个小组中,而不是通过与其他学习者直接互动来研究学习者,组长负责提高成员的知识,即探索最优解。这个想法类似于小组讨论,在小组讨论中,组长总是主导小组讨论的方向和表现。为简单起见,本文将算法记为LTLBO。在多个具有不同特征的基准问题上测试了该方法的有效性,并将结果与原始TLBO和粒子群优化(PSO)进行了比较。
{"title":"Group Leader Dominated Teaching-Learning Based Optimization","authors":"Chang-Huang Chen","doi":"10.1109/PDCAT.2013.54","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.54","url":null,"abstract":"Teaching-learning based optimization (TLBO), inspired from the teaching-learning process in a classroom, is a newly developed population based algorithm. Except population size and maximum number of iteration, it does not require any specific parameters. TLBO consists of two modes of searching phase, teacher and learner phase. In this paper, every learner is assigned to at least one groups and, instead of a learner studied by interacting directly with other learners, group leader is responsible for raising up the member's knowledge, i.e., to explore for optimal solution. The idea is analog to group discussion in which group leader always dominate group discussion direction and performance. For simplicity, the proposed algorithm will be denoted as LTLBO. The effectiveness of the method is tested on many benchmark problems with different characteristics and the results are compared with original TLBO and particle swarm optimization (PSO).","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128651513","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
Implementation of a Cloud IaaS with Dynamic Resource Allocation Method Using OpenStack 基于OpenStack的动态资源分配云IaaS实现
Chao-Tung Yang, Yu-Tso Liu, Jung-Chun Liu, Chih-Liang Chuang, Fuu-Cheng Jiang
In this work, we particularly focus on the use of free open-source software, so that end users do not need to spend a huge amount of software license fees. For cloud computing, virtualization technology delivers numerous benefits in addition to being one of the basic roles to build a cloud environment. By virtualization, enterprises can maximize working efficiency without the need to install more facilities in the computer room. In this study, we implemented a virtualization environment and performed experiments on it. The main subject of it is how to use the Open Stack open-source software to build a cloud infrastructure with high availability and a dynamic resource allocation mechanism. It provides a private cloud solution for business and organizations. It belongs to Infrastructure as a Service (IaaS), one of the three service models in the cloud. For the part of the user interface, a web interface was used to reduce the complexity of access to cloud resources for users. We measured the performance of live migration of virtual machines with different specifications and analyzed the data. Also according to live migration modes, we wrote an algorithm to solve the traditional migration problem that needs manually determining whether the machine load is too heavy or not, as a result, the virtual machine load level is automatically detected, and the purpose of automatic dynamic migration to balance resources of servers is achieved.
在这项工作中,我们特别注重使用免费的开源软件,使最终用户不需要花费巨额的软件许可费用。对于云计算,虚拟化技术除了是构建云环境的基本角色之一之外,还提供了许多好处。通过虚拟化,企业可以最大限度地提高工作效率,而无需在机房安装更多的设备。在本研究中,我们实现了一个虚拟化环境并在其上进行了实验。本文的主要课题是如何利用Open Stack开源软件构建高可用性和动态资源分配机制的云基础设施。它为企业和组织提供私有云解决方案。它属于基础设施即服务(IaaS),是云中的三种服务模型之一。在用户界面部分,采用web界面,降低用户访问云资源的复杂性。我们测量了不同规格虚拟机的实时迁移性能,并对数据进行了分析。同时根据实时迁移模式,我们编写了一种算法,解决了传统迁移需要人工判断机器负载是否过重的问题,从而自动检测虚拟机负载水平,达到自动动态迁移,平衡服务器资源的目的。
{"title":"Implementation of a Cloud IaaS with Dynamic Resource Allocation Method Using OpenStack","authors":"Chao-Tung Yang, Yu-Tso Liu, Jung-Chun Liu, Chih-Liang Chuang, Fuu-Cheng Jiang","doi":"10.1109/PDCAT.2013.18","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.18","url":null,"abstract":"In this work, we particularly focus on the use of free open-source software, so that end users do not need to spend a huge amount of software license fees. For cloud computing, virtualization technology delivers numerous benefits in addition to being one of the basic roles to build a cloud environment. By virtualization, enterprises can maximize working efficiency without the need to install more facilities in the computer room. In this study, we implemented a virtualization environment and performed experiments on it. The main subject of it is how to use the Open Stack open-source software to build a cloud infrastructure with high availability and a dynamic resource allocation mechanism. It provides a private cloud solution for business and organizations. It belongs to Infrastructure as a Service (IaaS), one of the three service models in the cloud. For the part of the user interface, a web interface was used to reduce the complexity of access to cloud resources for users. We measured the performance of live migration of virtual machines with different specifications and analyzed the data. Also according to live migration modes, we wrote an algorithm to solve the traditional migration problem that needs manually determining whether the machine load is too heavy or not, as a result, the virtual machine load level is automatically detected, and the purpose of automatic dynamic migration to balance resources of servers is achieved.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130548273","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}
引用次数: 19
A Secure and Flexible Data Infrastructure for the VPH-Share Community 安全灵活的vpn共享社区数据基础设施
S. Benkner, Yuriy Kaniovskyi, Chris Borckholder, M. Bubak, P. Nowakowski, Darío Ruiz López, Steven Wood
The European VPH-Share project develops a comprehensive service framework with the objective of sharing clinical data, information, models and workflows focusing on the analysis of the human physiopathology within the Virtual Physiological Human (VPH) community. The project envisions an extensive and dynamic data infrastructure built on top of a secure hybrid Cloud environment. This paper presents the data service provisioning framework that builds up the data infrastructure, focusing on the deployment of data integration services in the hybrid Cloud, the associated mechanism for securing access to patient-specific datasets, and performance results for different deployment scenarios relevant within the scope of the project.
欧洲VPH- share项目开发了一个全面的服务框架,其目标是共享临床数据、信息、模型和工作流程,重点是虚拟生理人(VPH)社区内的人类生理病理分析。该项目设想在一个安全的混合云环境之上构建一个广泛的动态数据基础设施。本文介绍了构建数据基础设施的数据服务供应框架,重点介绍了混合云中数据集成服务的部署、确保访问特定于患者的数据集的相关机制,以及项目范围内相关的不同部署场景的性能结果。
{"title":"A Secure and Flexible Data Infrastructure for the VPH-Share Community","authors":"S. Benkner, Yuriy Kaniovskyi, Chris Borckholder, M. Bubak, P. Nowakowski, Darío Ruiz López, Steven Wood","doi":"10.1109/PDCAT.2013.42","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.42","url":null,"abstract":"The European VPH-Share project develops a comprehensive service framework with the objective of sharing clinical data, information, models and workflows focusing on the analysis of the human physiopathology within the Virtual Physiological Human (VPH) community. The project envisions an extensive and dynamic data infrastructure built on top of a secure hybrid Cloud environment. This paper presents the data service provisioning framework that builds up the data infrastructure, focusing on the deployment of data integration services in the hybrid Cloud, the associated mechanism for securing access to patient-specific datasets, and performance results for different deployment scenarios relevant within the scope of the project.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122010266","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
SimpleLock: Fast and Accurate Hybrid Data Race Detector SimpleLock:快速和准确的混合数据竞赛检测器
Misun Yu, Sang-Kyung Yoo, Doo-Hwan Bae
Data races are one of the major causes of concurrency bugs in multithreaded programs, but they are hard to find due to nondeterministic thread scheduling. Data race detectors are essential tools that help long-suffering programmers to locate data races in multithreaded programs. One type of detectors precisely detects data races but is sensitive to thread scheduling, whereas another type is less sensitive to thread scheduling but reports a considerable number of false positives. In this paper, we propose a new dynamic data race detector called SimpleLock that accurately detects data races in a scheduling insensitive manner with low execution overhead. We reduce execution overhead by using two assumptions. The first is that most data races are caused by the accessing of shared variables without locks. The second is that two accesses that cause a data race have not a long distance between them in an execution trace. The results of experiments conducted on the Road Runner framework confirm that these assumptions are valid and that our SimpleLock detector can efficiently and accurately detect real and potential data races in one execution trace. The results also indicate that the execution overhead of SimpleLock is not much higher than that of FastTrack, the fastest happens-before race detector.
数据竞争是导致多线程程序并发性错误的主要原因之一,但由于线程调度的不确定性,数据竞争很难被发现。数据竞争检测器是帮助长期受苦的程序员在多线程程序中定位数据竞争的基本工具。一种类型的检测器精确地检测数据竞争,但对线程调度很敏感,而另一种类型对线程调度不太敏感,但报告了相当多的误报。在本文中,我们提出了一种新的动态数据竞争检测器,称为SimpleLock,它以调度不敏感的方式准确地检测数据竞争,并且执行开销低。我们通过使用两个假设来减少执行开销。首先,大多数数据争用是由于访问没有锁的共享变量造成的。第二个原因是导致数据竞争的两个访问在执行跟踪中距离不长。在Road Runner框架上进行的实验结果证实了这些假设是有效的,并且我们的SimpleLock检测器可以在一个执行跟踪中有效准确地检测到真实和潜在的数据竞争。结果还表明,SimpleLock的执行开销并不比FastTrack高多少,FastTrack是最快的happens-before检测器。
{"title":"SimpleLock: Fast and Accurate Hybrid Data Race Detector","authors":"Misun Yu, Sang-Kyung Yoo, Doo-Hwan Bae","doi":"10.1109/PDCAT.2013.15","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.15","url":null,"abstract":"Data races are one of the major causes of concurrency bugs in multithreaded programs, but they are hard to find due to nondeterministic thread scheduling. Data race detectors are essential tools that help long-suffering programmers to locate data races in multithreaded programs. One type of detectors precisely detects data races but is sensitive to thread scheduling, whereas another type is less sensitive to thread scheduling but reports a considerable number of false positives. In this paper, we propose a new dynamic data race detector called SimpleLock that accurately detects data races in a scheduling insensitive manner with low execution overhead. We reduce execution overhead by using two assumptions. The first is that most data races are caused by the accessing of shared variables without locks. The second is that two accesses that cause a data race have not a long distance between them in an execution trace. The results of experiments conducted on the Road Runner framework confirm that these assumptions are valid and that our SimpleLock detector can efficiently and accurately detect real and potential data races in one execution trace. The results also indicate that the execution overhead of SimpleLock is not much higher than that of FastTrack, the fastest happens-before race detector.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129236575","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
PLAR: Parallel Large-Scale Attribute Reduction on Cloud Systems 云系统的并行大规模属性约简
Junbo Zhang, Tianrui Li, Yi Pan
Attribute reduction for big data is viewed as an important preprocessing step in the areas of pattern recognition, machine learning and data mining. In this paper, a novel parallel method based on MapReduce for large-scale attribute reduction is proposed. By using this method, several representative heuristic attribute reduction algorithms in rough set theory have been parallelized. Further, each of the improved parallel algorithms can select the same attribute reduct as its sequential version, therefore, owns the same classification accuracy. An extensive experimental evaluation shows that these parallel algorithms are effective for big data.
大数据属性约简是模式识别、机器学习和数据挖掘等领域的重要预处理步骤。提出了一种基于MapReduce的大规模属性约简并行方法。利用该方法对粗糙集理论中几种具有代表性的启发式属性约简算法进行了并行化。此外,每种改进的并行算法都可以选择与其序列版本相同的属性约简,因此具有相同的分类精度。大量的实验评估表明,这些并行算法对大数据是有效的。
{"title":"PLAR: Parallel Large-Scale Attribute Reduction on Cloud Systems","authors":"Junbo Zhang, Tianrui Li, Yi Pan","doi":"10.1109/PDCAT.2013.36","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.36","url":null,"abstract":"Attribute reduction for big data is viewed as an important preprocessing step in the areas of pattern recognition, machine learning and data mining. In this paper, a novel parallel method based on MapReduce for large-scale attribute reduction is proposed. By using this method, several representative heuristic attribute reduction algorithms in rough set theory have been parallelized. Further, each of the improved parallel algorithms can select the same attribute reduct as its sequential version, therefore, owns the same classification accuracy. An extensive experimental evaluation shows that these parallel algorithms are effective for big data.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116014857","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}
引用次数: 15
Service Availability for Various Forwarded Descriptions with Dynamic Buffering on Peer-to-Peer Streaming Networks 点对点流网络中动态缓冲的各种转发描述的服务可用性
Chow-Sing Lin, Jhe-Wei Lin
In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.
在P2P系统中,由于每个对等点的缓冲空间有限,大多数P2P系统采用缓存-中继方案,要求每个对等点缓存最近收到的视频流。只要视频流的初始部分仍然在其缓冲区中,对等端就可以以流水线方式将缓存的流中继到晚到达的对等端,然后减少服务器的加载。在我们之前的研究工作中,我们提出了一种新的点对点点播流缓存方案,称为动态缓冲,该方案依靠多描述编码的特性,在缓冲区满后逐渐减少对等端缓存的描述数量。本文讨论了具有动态缓冲的不同数量的转发描述的对等体的服务可用性,并详细分析了转发描述的数量如何影响对等体的平均服务可用性。此外,还推导了不同数量的转发描述的平均服务可用性降低的数学公式。实验结果表明,平均服务可用性的降低只与转发描述的种类数量有关。
{"title":"Service Availability for Various Forwarded Descriptions with Dynamic Buffering on Peer-to-Peer Streaming Networks","authors":"Chow-Sing Lin, Jhe-Wei Lin","doi":"10.1109/PDCAT.2013.32","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.32","url":null,"abstract":"In P2P systems, because the buffer space of each peer is limited, most of P2P systems employ the cache-and-relay schemes that require each peer to cache the most recent video stream it receives. As long as the initial part of the video stream remains in its buffer, the peer can then relay the cached stream to late-arriving peers in a pipelining fashion and then the loading of a server is reduced. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering, which relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions in a peer once the buffer is full. In this paper we discuss service availability of a peer with dynamic buffering for various numbers of kinds of forwarded descriptions, and provide detailed analyses on how the number of kinds of forwarded descriptions affects average service availability of a peer. In addition, the mathematical formulas of the reduction of average service availability for various numbers of kinds of forwarded descriptions is derived. Our experiment results showed that the reduction of average service availability is only related to the number of kinds of forwarded descriptions.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115728840","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
期刊
2013 International Conference on Parallel and Distributed Computing, Applications and Technologies
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1