2016 Fourth International Symposium on Computing and Networking (CANDAR)最新文献_第7页

Vertical Packet Switching Elevator Network Using Inductive Coupling ThruChip Interface 基于电感耦合thrchip接口的垂直分组交换电梯网络

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

A. Nomura, Hiroki Matsutani, T. Kuroda, J. Kadomoto, Yusuke Matsushita, H. Amano

引用次数: 4

Stop the World: A Lightweight Runtime Power-Capping Mechanism for FPGAs 停止世界:fpga的轻量级运行时功率上限机制

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

Keisuke Fujimoto, Shinya Takamaeda-Yamazaki, Y. Nakashima

{"title":"Stop the World: A Lightweight Runtime Power-Capping Mechanism for FPGAs","authors":"Keisuke Fujimoto, Shinya Takamaeda-Yamazaki, Y. Nakashima","doi":"10.1109/CANDAR.2016.0070","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0070","url":null,"abstract":"Power-constrained computing is now becoming essential paradigm in both high performance computing and embedded systems. Power budget is dynamically assigned to each computing resource for improving energy efficiency and system throughput. Modern computer systems have accelerator devices, such as GPUs and FPGAs, for higher energy efficiency and performance. Therefore, power management mechanisms of such accelerator devices are required. In this paper, we present a lightweight mechanism of runtime power capping on FPGA systems. According to the amount of a given power budget, instead of the frequency scaling, the proposed mechanism controls the execution speed by throttling off-chip memory accesses from the computing logic, so that the power consumption is accordingly controlled. We evaluated the power controllability of the proposed mechanism by using an FPGA board with an embedded power meter. The result shows that the proposed approach has a high linea rity of power control. The result also indicates that the accuracy of the power control depends on throttling interval granularities, and the control accuracy is improved by utilizing a longer throttling interval. Additionally, we compared the power control accuracy with a design-time fixed frequency scaling approach. The result shows that the proposed approach achieves the same accuracy as the static approach, even though the proposed approach allows the runtime power control.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"9 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":"127056486","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

A Light-Weight Content Distribution Scheme for Cooperative Caching in Telco-CDNs 一种轻量级的电信cdn协同缓存内容分发方案

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

Takuma Nakajima, Masato Yoshimi, Celimuge Wu, T. Yoshinaga

{"title":"A Light-Weight Content Distribution Scheme for Cooperative Caching in Telco-CDNs","authors":"Takuma Nakajima, Masato Yoshimi, Celimuge Wu, T. Yoshinaga","doi":"10.1109/CANDAR.2016.0033","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0033","url":null,"abstract":"A key technique to reduce the rapid growing of video-on-demand's traffic is a cooperative caching strategy aggregating multiple cache storages. Many internet service providers have considered the use of cache servers on their networks as a solution to reduce the traffic. Existing schemes often periodically calculate a sub-optimal allocation of the content caches in the network. However, such approaches require a large computational overhead that cannot be amortized in a presence of frequent changes of the contents' popularities. This paper proposes a light-weight scheme for a cooperative caching that obtains a sub-optimal distribution of the contents by focusing on their popularities. This was made possible by adding color tags to both cache servers and contents. In addition, we propose a hybrid caching strategy based on Least Frequently Used (LFU) and Least Recently Used (LRU) schemes, which efficiently manages the contents even with a frequent change in the popularity. Evaluation results showed that our light-weight scheme could considerably reduce the traffic, reaching a sub-optimal result. In addition, the performance gain is obtained with a computation overhead of just a few seconds. The evaluation results also showed that the hybrid caching strategy could follow the rapid variation of the popularity. While a single LFU strategy drops the hit ratio by 13.9%, affected by rapid popularity changes, our proposed hybrid strategy could limit the degradation to only 2.3%.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"430 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":"123275963","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}

引用次数: 10

LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies LOREN:布局意识随机拓扑的可扩展路由方法

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

Ryuta Kawano, Hiroshige Nakahara, I. Fujiwara, Hiroki Matsutani, M. Koibuchi, H. Amano

{"title":"LOREN: A Scalable Routing Method for Layout-Conscious Random Topologies","authors":"Ryuta Kawano, Hiroshige Nakahara, I. Fujiwara, Hiroki Matsutani, M. Koibuchi, H. Amano","doi":"10.1109/CANDAR.2016.0019","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0019","url":null,"abstract":"End-to-end network latency has become an important issue for parallel application on large-scale high performance computing (HPC) systems. It has been reported that randomly-connected inter-switch networks can lower the end-to-end network latency. The trade-off is a large amount of routing information. For irregular networks, minimal routing is achieved by using routing tables for all destinations in the network. In this work, a novel distributed routing method called LOREN (Layout-Oriented Routing with Entries for Neighbors) to achieve low-latency with a small routing table is proposed for irregular networks whose link length is limited. The routing tables contain both physically and topologically nearby neighbor nodes to ensure livelock-freedom and a small number of hops between nodes. Experimental results show that LOREN reduces the average latencies by 2.8% and improves the network throughput by up to 39% compared with a conventional compact routing method. Moreover, the required routing table size is reduced by up to 67%, which improves scalability and flexibility for implementation.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"22 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":"114834280","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

An Effective Page Padding Method for RAM Buffer Algorithms to Enhance the SSD Endurance 一种有效的RAM缓冲算法页填充方法以提高SSD的耐用性

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

Eri Ogawa, Kenji Kise

引用次数: 2

Particle Complexity of Universal Finite Number-Conserving Cellular Automata 通用有限守恒元胞自动机的粒子复杂度

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

A. Alhazov, Katsunobu Imai

引用次数: 3

Workflow Support Based on Mobile Data Stream Management System 基于移动数据流管理系统的工作流支持

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

Jiwang Xu, Y. Nakamoto, Shingo Akiyama

引用次数: 1

Cold Boot Attack Methods for the Discrete Logarithm Problem 离散对数问题的冷启动攻击方法

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

Hwei-Ming Ying, N. Kunihiro

引用次数: 0

On the Ergodicity of One-Dimensional Linear Cellular Automata with Additive Error 具有加性误差的一维线性元胞自动机的遍历性

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

Ryouta Kouduma, Masato Takei

引用次数: 0

Towards Ideal Hop Counts in Interconnection Networks with Arbitrary Size 任意大小互连网络中理想跳数的研究

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

M. Koibuchi, I. Fujiwara, Fabien Chaix, H. Casanova

引用次数: 2