2016 Fourth International Symposium on Computing and Networking (CANDAR)最新文献

Performance Evaluation of Participatory Sensing Scheme Using Delay Tolerant Networking 基于时延容忍网络的参与式感知方案性能评价

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0059

Hiro Onishi, T. Asaka

引用次数: 2

Accelerating BLAST Computation on an FPGA-enhanced PC Cluster 在fpga增强型PC集群上加速BLAST计算

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0025

Masato Yoshimi, Celimuge Wu, T. Yoshinaga

{"title":"Accelerating BLAST Computation on an FPGA-enhanced PC Cluster","authors":"Masato Yoshimi, Celimuge Wu, T. Yoshinaga","doi":"10.1109/CANDAR.2016.0025","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0025","url":null,"abstract":"This paper introduces an FPGA-based scheme to accelerate mpiBLAST, which is a parallel sequence alignment algorithm for computational biology. Recent rapidly growing biological databases for sequence alignment require high-throughput storage and network rather than computing speed. Our scheme utilizes a specialized hardware configured on an FPGA-board which connects flash storage and other FPGA-boards directly. The specialized hardware configured on the FPGAs, we call a Data Stream Processing Engine (DSPE), take a role for preprocessing to adjust data for high-performance multi- and many- core processors simultaneously with offloading system-calls for storage access and networking. DSPE along the datapath achieves in-datapath computing which applies operations for data streams passing through the FPGA. Two functions in mpiBLAST are implemented using DSPE to offload operations along the datapath. The first function is database partitioning, which distributes the biological database to multiple computing nodes before commencing the BLAST processes. Using DSPE, we observe a 20-fold improvement in computation time for the database partitioning operation. The second function is an early part of the BLAST process that determines the positions of sequences for more detailed computations. We implement IDP-BLAST (In-datapath BLAST), which annotates positions in data streams from solid-state drives. We show that IDP-BLAST accelerates the computation time of the preprocess of BLAST by a factor of three hundred by offloading heavy operations to the introduced special hardware.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115626898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

On the Tightness of Deterministic Identity-Based Signatures 基于身份的确定性签名的紧密性

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0039

Naoto Yanai

引用次数: 3

FPGA-based Real-Time Object Tracking Using a Particle Filter with Stream Architecture 基于fpga的流结构粒子滤波实时目标跟踪

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0079

Akane Tahara, Yoshiki Hayashida, Theint Theint Thu, Yuichiro Shibata, K. Oguri

引用次数: 3

A Case Study of the Running Time Fluctuation of Application 应用程序运行时间波动的实例研究

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0099

Kiyoshi Kumahata, K. Minami

引用次数: 0

Deterministic Construction of Artificial Scale-Free Networks with Designated Maximum Degree 具有指定最大度的人工无标度网络的确定性构造

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0064

Naoki Takeuchi, S. Fujita

引用次数: 0

Design and Implementation of an Application State Migration Mechanism between Android Devices Android设备间应用状态迁移机制的设计与实现

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0125

Kohei Sato, Koichi Mouri, S. Saito

引用次数: 4

Implementation of a Revocable Group Signature Scheme with Compact Revocation List Using Accumulator 利用累加器实现具有紧凑吊销列表的可撤销群签名方案

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0110

Nasima Begum, T. Nakanishi, Shahidatul Sadiah, Md. Ezharul Islam

{"title":"Implementation of a Revocable Group Signature Scheme with Compact Revocation List Using Accumulator","authors":"Nasima Begum, T. Nakanishi, Shahidatul Sadiah, Md. Ezharul Islam","doi":"10.1109/CANDAR.2016.0110","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0110","url":null,"abstract":"A group signature scheme allows a user to anonymously sign a message on behalf of a group. One of important issues in group signature schemes is the user revocation. Previously, Libert et al. proposed an elegant revocable group signature scheme with O(1) signing/verification costs, O(1) signature size, O(1) membership certificate size, and O(log N) public key size, where N is the number of group members. However, the revocation list (RL) size is O(R), where R is the number of revoked members. Due to O(R) signatures in the RL, the RL size amounts to 8 MB in case of R=10,000. Then, a revocable group signature scheme with O(R/T) RL size was previously proposed for an integer parameter T, by accumulating T entries in the RL. Thus, we can expect that the delay time for a signer to fetch the RL is reduced in mobile environment. As the trade-off, the signing cost is increased by O(T). However, this scheme with the compact RL has not been implemented yet, and the practicality on the computation times for concrete T is unknown. In this paper, we implemented the scheme with the compact RL, and explore the practicality, where the signing time is greatly reduced by the technique to reduce the witness computation for the accumulator shown in the previous paper. From the experimental results, the signing and verification times are less than 500 ms and 900 ms even for T=100, and thus we can confirm that the implemented scheme is practical, and the accumulating technique in the implemented scheme is sufficiently effective.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117082165","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

Experimental Evaluation of a GPU-based Frequent Subgraph Miner Using Synthetic Databases 基于gpu的合成数据库频繁子图挖掘的实验评估

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0093

Tatsuya Toki, Tomonobu Ozaki

引用次数: 1

File Placing Control for Improving the I/O Performance of Hadoop in Virtualized Environment 提高Hadoop在虚拟化环境下I/O性能的文件放置控制

2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0076

Kenji Nakashima, Eita Fujishima, Saneyasu Yamaguchi

引用次数: 6