2017 Fifth International Symposium on Computing and Networking (CANDAR)最新文献_第3页

An Information Platform for Smart Communities Realizing Data Usage Authentication and Secure Data Sharing 实现数据使用认证和安全数据共享的智慧社区信息平台

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.73

Akira Niwa, H. Nishi

引用次数: 5

Improved Differential Evolution with Searching Pioneer for Solving Multi-modal Optimization Problems 基于搜索先锋的改进差分进化求解多模态优化问题

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.92

Chun-Ling Lin, Sheng-Ta Hsieh, Shih-Yuan Chiu

引用次数: 1

High Performance and Low Power Architectures: GPU vs. FPGA for Fast Factorized Backprojection 高性能和低功耗架构:GPU与FPGA的快速分解反向投影

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.101

M. Wielage, F. Cholewa, C. Fahnemann, P. Pirsch, H. Blume

引用次数: 9

Evaluation of Information Dissemination Scheme Using Autonomous Clustering and Epidemic Routing Considering Mobile Core Network Load in Wireless Networks 考虑移动核心网负载的无线网络中基于自主聚类和流行路由的信息传播方案评估

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.36

Toshikazu Terami, T. Ohta, Y. Kakuda

{"title":"Evaluation of Information Dissemination Scheme Using Autonomous Clustering and Epidemic Routing Considering Mobile Core Network Load in Wireless Networks","authors":"Toshikazu Terami, T. Ohta, Y. Kakuda","doi":"10.1109/CANDAR.2017.36","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.36","url":null,"abstract":"Most of mobile nodes and wireless devices are equipped with 4G/LTE cellular connections and WiFi short range connections. Since these nodes/devices use cellular connections to access to the mobile core network at the same time, many of them cannot establish the cellular connections due to the limited wireless resources of the cellular base stations so that data messages cannot be disseminated from a source node to those nodes.The information dissemination schemes which accommodate these nodes for the base stations and utilize the wireless multi-hop communication have been proposed so far. In this paper, we propose an information dissemination scheme which uses autonomous clustering and epidemic routing, and it provides lower mobile core network load in wireless networks. The proposed scheme accommodates the number of mobile nodes which access to the base stations to reduce the mobile core network load and disseminates the data messages to them. The nodes which received the information messages through the mobile core network forward them to nearby nodes in a wireless multi-hop fashion. In addition, they are forwarded by epidemic routing for nodes which cannot receive them even in a wireless multi-hop fashion. Finally, we evaluate the proposed information dissemination scheme through simulation experiments and confirm the higher information dissemination rate with low mobile core network load in comparison with the existing scheme.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133507930","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

Configurable Fast Cycle-Approximate Timing Estimation for Instruction-Level Emulators 指令级仿真器的可配置快速周期近似时序估计

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.32

T. Chang, C. King, Bhaskar Das, Bo-Hao Liao

{"title":"Configurable Fast Cycle-Approximate Timing Estimation for Instruction-Level Emulators","authors":"T. Chang, C. King, Bhaskar Das, Bo-Hao Liao","doi":"10.1109/CANDAR.2017.32","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.32","url":null,"abstract":"Timing estimation, a significant process in microprocessor design, should be performed promptly and accurately by the simulators to exploit the enormous design space of processors. The challenging task is how to integrate the timing data generated by the timing models of various processor components of a functional simulator, such as pipeline, branch predictor, and cache. The timing model of one processor component must interact with the other processor components, the same way processor components interact with each other in real machines for accurate timing estimation and are individually configurable and produce timing data for fast simulation. In this article, we present a configurable, fast, and cycle-approximate timing estimation method, for instruction-level emulators to solve the timing model problem. We extend QEMU, a dynamic binary translation functional emulator, to allow timing models of different processor components to be plugged in, to provide cycle-approximate timing information, while at the same time keep the fast simulation speed by providing a Timing Record Caching technique. In the proposed model, the pipeline timing of each basic block is fixed and independent of others while maintaining the timing accuracy at the same time. We have also provided instrumentation and profiling capability to help the designers to analyze and find design bottlenecks.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133365861","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 Improvement of a Two-Dimensional Flood Simulation Application in Hybrid Computing Environments 二维洪水模拟在混合计算环境下的性能改进

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.106

Ryan J. Marshall, S. Ghafoor, A. Kalyanapu, Mike Rogers, T. Dullo

{"title":"Performance Improvement of a Two-Dimensional Flood Simulation Application in Hybrid Computing Environments","authors":"Ryan J. Marshall, S. Ghafoor, A. Kalyanapu, Mike Rogers, T. Dullo","doi":"10.1109/CANDAR.2017.106","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.106","url":null,"abstract":"This paper presents a practical implementation of a 2D flood simulation model using hybrid distributed-parallel technologies including MPI, OpenMP, CUDA, and evaluations of its performance under various configurations that utilize these technologies. The main objective of this research work was to improve the computational performance of the flood simulation in a hybrid architecture. Modern desktops and small cluster systems owned by domain researchers are able to perform these simulations efficiently due to multicore and GPU computing devices, but lack the expertise needed to fully utilize software libraries designed to take advantage of the latest hardware. By leveraging knowledge of our experimentation environment, we were able to incorporate MPI and multiple GPU devices to improve performance over a single-process OpenMP version up to 18x, depending on the size of the input data. We discuss some observations that have significant effects on overall performance, including process-to-device mapping, communication strategies and data partitioning. The limitations of this work are discussed, and we propose some ideas to relieve or overcome such limitations in future work.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124896895","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

Blind Watermarking Method for Anonymized Data 匿名数据的盲水印方法

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.97

Y. Ohno, Tomomu Iwai, H. Nishi

引用次数: 0

SPH-based Fluid Simulation on GPU Using Verlet List and Subdivided Cell-Linked List 基于Verlet列表和细分细胞链表的GPU sph流体仿真

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.104

K. Ohno, Tomoki Nitta, Hiroto Nakai

{"title":"SPH-based Fluid Simulation on GPU Using Verlet List and Subdivided Cell-Linked List","authors":"K. Ohno, Tomoki Nitta, Hiroto Nakai","doi":"10.1109/CANDAR.2017.104","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.104","url":null,"abstract":"The smoothed-particle hydrodynamics (SPH) method is widely used for fluid simulations. Because large and high precision simulations require enormous execution time, various acceleration techniques, such as reducing the computation cost and parallelizing the computation on the GPU, have been proposed. In the SPH method, the neighbor particles are searched to compute the force on each particle. To reduce the search space, the conventional implementations on the GPU adopt cell-linked list method, which partitions the simulation domain into cells. On the other hand, we have proposed an efficient implementation technique adopting Verlet list, which builds the lists of neighbor particles. The evaluation result shows that it reduces the execution time when the average number of neighbor particles is small. However, the performance was slightly improved or declined with large number of neighbor particles, which often appears in the practical 3D simulations. In this paper, we propose an improved implementation technique of SPH simulations. By subdividing the cells, the spatial locality of the particle data is improved thus the GPU memory is accessed more efficiently. The subdivision also reduces the search space on building the neighbor particle lists. As the result of the evaluation, the proposed method improved the performance of the test cases which shows declined performance using the original implementation.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116919209","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}

引用次数: 4

Access Control of Webcam on PC with Prevention against Peeping by Attackers 防止攻击者偷窥的PC网络摄像头访问控制

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.63

Yuri Yoshino, Masaki Inamura

引用次数: 1

A Study of a Fault-Tolerant System Using Dynamic Partial Reconfiguration 基于动态部分重构的容错系统研究

2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.57

Seiya Ogido, Chikatoshi Yamada, Kei Miyagi, S. Ichikawa

引用次数: 0