2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)最新文献_第9页

Optimized Belief Propagation Algorithm onto Embedded Multi and Many-Core Systems for Stereo Matching 嵌入式多核多核系统立体匹配的优化信念传播算法

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.52

J. Nezan, Alexandre Mercat, P. Delmas, G. Gimel'farb

引用次数: 5

Gate Merging: An NBTI Mitigation Method to Eliminate Critical Internal Nodes in Digital Circuits 门合并:一种消除数字电路中关键内部节点的NBTI缓解方法

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.90

Maryam Ghane, H. Zarandi

{"title":"Gate Merging: An NBTI Mitigation Method to Eliminate Critical Internal Nodes in Digital Circuits","authors":"Maryam Ghane, H. Zarandi","doi":"10.1109/PDP.2016.90","DOIUrl":"https://doi.org/10.1109/PDP.2016.90","url":null,"abstract":"This paper presents a method to mitigate Negative Bias Temperature Instability (NBTI) in digital circuits. Since effect of NBTI strongly depends on digital logic value of internal nodes, this method uses internal nodes control (INC) method to reduce NBTI-critical transistors. There are some internal nodes in digital circuits that are under severe NBTI. This method at first, identifies NBTI-critical internal nodes in critical and non-critical paths by calculating probability of being under NBTI stress. Second, it eliminates these internal nodes by combining NBTI-sensitive gates and their driver gates, generating a new complex gate. These complex gates have the same logic and remove any NBTI-critical transistors. The proposed method reduces NBTI in combinational and sequential CMOS circuits and increases their lifetime. Experimental results on ISCAS'89 benchmark circuits show that NBTI-critical transistors, NBTI-induced delay degradation and the number of circuit's transistors are decreased about 86.1%, 15.12% and 4.3%, respectively. However, this method imposes area overhead of 0.2% for the investigated circuits.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124532980","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}

引用次数: 7

Neighbor Detection Based on Multiple Virtual Mobile Nodes 基于多个虚拟移动节点的邻居检测

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.43

Behnaz Bostanipour, B. Garbinato

{"title":"Neighbor Detection Based on Multiple Virtual Mobile Nodes","authors":"Behnaz Bostanipour, B. Garbinato","doi":"10.1109/PDP.2016.43","DOIUrl":"https://doi.org/10.1109/PDP.2016.43","url":null,"abstract":"We introduce an algorithm that implements a time-limited neighbor detector service in mobile ad hoc networks. The time-limited neighbor detector enables a mobile device to detect nearby devices in the past, present and up to some bounded time interval in the future. In particular, it can be used by a new trend of mobile applications known as proximity-based mobile applications. To implement the neighbor detector, our algorithm uses n = 2k virtual mobile nodes where k is a non-negative integer. A virtual mobile node is an abstraction that is akin to a mobile node that travels in the network in a predefined trajectory. In practice, it can be implemented by a set of mobile nodes based on a replicated state machine approach. Our algorithm implements the neighbor detector for nodes located in a circular region. We assume that each node can accurately predict its own locations up to some bounded time interval Δpredict in the future. The key idea of the algorithm is that the virtual mobile nodes regularly collect location predictions of nodes from different subregions, meet to share what they have collected with each other and then distribute the collected location predictions to nodes. Thus, each node can use the distributed location predictions for neighbor detection. We show that our algorithm is correct under certain conditions. Compared to a solution that works with a single virtual mobile node, our algorithm has a main advantage: as n grows, it remains correct with smaller values of Δpredict. This feature makes the real world implementation of the neighbor detector more feasible. In fact, although there exist different approaches to predict the future locations of a node, usually predictions tend to become less accurate as Δpredict increases.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128705810","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

Exact Vs. Approximated Diameter Calculation in Large Graphs 大图形中精确与近似的直径计算

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.71

Francisco Sanches Banhos Filho, Eduardo Javier Huerta Yero

引用次数: 1

Globally Asynchronous Locally Synchronous Simulation of NoCs on Many-Core Architectures 多核体系结构noc的全局异步局部同步仿真

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.118

Marcus Eggenberger, Manuel Strobel, M. Radetzki

引用次数: 4

Formal Analysis and Model Checking of a Group Authentication Protocol by Scyther 基于Scyther的组认证协议的形式化分析与模型检验

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.27

Huihui Yang, A. Prinz, V. Oleshchuk

引用次数: 8

A Cost Model for Virtual Machine Storage in Cloud IaaS Context 云IaaS环境下虚拟机存储的成本模型

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.119

Hamza Ouarnoughi, Jalil Boukhobza, Frank Singhoff, S. Rubini

引用次数: 14

An Efficient Soft Error Detection in Multicore Processors Running Server Applications 多核处理器运行服务器应用程序的有效软错误检测

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.100

A. Tajary, H. Zarandi

引用次数: 0

HPSVM: Heterogeneous Parallel SVM with Factorization Based IPM Algorithm on CPU-GPU Cluster HPSVM: CPU-GPU集群上基于因子分解的异构并行支持向量机

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.29

Tao Li, Xuechen Liu, Qiankun Dong, Wenjing Ma, Kai Wang

{"title":"HPSVM: Heterogeneous Parallel SVM with Factorization Based IPM Algorithm on CPU-GPU Cluster","authors":"Tao Li, Xuechen Liu, Qiankun Dong, Wenjing Ma, Kai Wang","doi":"10.1109/PDP.2016.29","DOIUrl":"https://doi.org/10.1109/PDP.2016.29","url":null,"abstract":"Support vector machine (SVM) is a supervised method widely used in the statistical classification and regression analysis. SVM training can be solved via the interior point method (IPM) with the advantages of low storage, fast convergence and easy parallelization. However, it is still confronted with the challenges of training speed and memory use. In this paper, we propose a parallel primal-dual IPM algorithm based on the incomplete Cholesky factorization (ICF) for efficiently training large-scale SVMs, named HPSVM, on CPU-GPU cluster. Our approach is distinguished from earlier work in that it is specifically designed to take maximal advantage of the CPU-GPU collaborative computation with the dual buffers 3-stage pipeline mechanism, and efficiently handles large-scale training datasets. In HPSVM, the heterogeneous hierarchical memory is fully explored to alleviate the bottleneck for optimizing data transfer, and the programming paradigm is presented to build an efficient collaboration mechanism between CPU and GPU. Comprehensive experiments show that HPSVM is up to 11 times faster than the CPU version on real datasets.","PeriodicalId":192273,"journal":{"name":"2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126711432","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

Clustering Effects on the Design of Opto-Electrical Network-on-Chip 光电片上网络设计中的聚类效应

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP) Pub Date : 2016-02-01 DOI: 10.1109/PDP.2016.126

Meisam Abdollahi, Alireza Namazi, S. Mohammadi

引用次数: 7