发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
An Interconnection Network Exploiting Trade-Off between Routing Table Size and Path Length 利用路由表大小和路径长度折衷的互连网络
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0119
Thanh-Chung Kieu, Khanh-Van Nguyen, Nguyen T. Truong, I. Fujiwara, M. Koibuchi
{"title":"An Interconnection Network Exploiting Trade-Off between Routing Table Size and Path Length","authors":"Thanh-Chung Kieu, Khanh-Van Nguyen, Nguyen T. Truong, I. Fujiwara, M. Koibuchi","doi":"10.1109/CANDAR.2016.0119","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0119","url":null,"abstract":"Various parallel applications require a low-latency interconnection network to achieve high performance and high scalability. Recently proposed random network topologies achieve low latency, but they require each switch to have a large number of routing table entries, e.g., larger than N for an N-node network, for implementing a minimal routing. In this study, we propose the use of a random network topology with our new routing scheme so that the required routing table size becomes small, e.g., 528 for 8192 nodes, at each switch. Our main finding is that our routing algorithm cannot always follow the minimal paths, but its average path length is still short when compared to that of existing network topologies.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"56 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":"124352268","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
Collaborative Development Environment in Peer-to-Peer Networks 点对点网络中的协同开发环境
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0106
M. Thodi, S. Fujita
{"title":"Collaborative Development Environment in Peer-to-Peer Networks","authors":"M. Thodi, S. Fujita","doi":"10.1109/CANDAR.2016.0106","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0106","url":null,"abstract":"Collaboration is a huge part of modern software development. Yet most tools used in software development are aimed for single user instances. To support collaborative software practices, researchers and practitioners have presented several tools. The existing tools support collaboration either through distributed version control systems or through client/server-based concurrent text editors. Distributed version control systems do not support real-time collaboration; while the server-based concurrent editors do not support offline work. In this paper, we propose the design of a replica-based collaborative development environment (CDE) within a peer to peer network of users. The CDE supports both real-time collaborative editing and offline work. In addition, the CDE is scalable, resilient to the dynamic joining/leaving of collaborating users, and can be augmented into existing development environments as a plugin. We evaluate the usability of the CDE with respect to operation propagation time, and the correctness with respect to the causality, convergence and intention preservation (CCI) criteria.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"41 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":"132608906","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
Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-Chains 基于q-加减k链的并行侧信道攻击抵抗标量乘法
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0035
Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn
{"title":"Parallelized Side-Channel Attack Resisted Scalar Multiplication Using q-Based Addition-Subtraction k-Chains","authors":"Kittiphop Phalakarn, Kittiphon Phalakarn, Vorapong Suppakitpaisarn","doi":"10.1109/CANDAR.2016.0035","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0035","url":null,"abstract":"This paper presents parallel scalar multiplication techniques for elliptic curve cryptography using q-based addition-subtraction k-chain which can also effectively resist side-channel attack. Many techniques have been discussed to improve scalar multiplication, for example, double-and-add, NAF, w-NAF, addition chain and addition-subtraction chain. However, these techniques cannot resist side-channel attack. Montgomery ladder, random w-NAF and uniform operation techniques are also widely used to prevent side-channel attack, but their operations are not efficient enough comparing to those with no side-channel attack prevention. We have found a new way to use k-chain for this purpose. In this paper, we extend the definition of k-chain to q-based addition-subtraction k-chain and modify an algorithm proposed by Jarvinen et al. to generate the q-based addition-subtraction k-chain. We show the upper and lower bounds of its length which lead to the computation time using the new chain techniques. The chain techniques are used to reduce the cost of scalar multiplication in parallel ways. Comparing to w-NAF, which is faster than double-and-add and Montgomery ladder technique, the maximum computation time of our q-based addition-subtraction k-chain techniques can have up to 25.92% less addition costs using only 3 parallel computing cores. We also discuss on the optimization for multiple operand point addition using hybrid-double multiplier which is proposed by Azarderakhsh and Reyhani-Masoleh. The proposed parallel chain techniques can also tolerate side-channel attack efficiently.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"1 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":"130529335","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
Synchronizing the Squad with (Almost) Arbitrary Cut Ratio 同步小队与(几乎)任意切割比例
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0048
Luidnel Maignan, Jean-Baptiste Yunès
{"title":"Synchronizing the Squad with (Almost) Arbitrary Cut Ratio","authors":"Luidnel Maignan, Jean-Baptiste Yunès","doi":"10.1109/CANDAR.2016.0048","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0048","url":null,"abstract":"In this paper, we design a solution to the generalized firing squad problem where the splittings can be chosen to happen at any ratio greater than two thirds. This is in the same spirit as the (non-generalized) solutions of Mazoyer except that we do not use signal speeds but the concept of fields to achieve this goal. Signals and speeds do appear visually as an effect of the spatio-temporal structure of the cellular automaton. However, not being setup by design allows the solution to automatically extends to more generalized settings. Moreover, the conceptual design of the solution is separated from the state space optimization that is only handle afterward. The finiteness of state space is also sketched.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"15 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":"134471374","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
Set-to-Set Disjoint Paths in Tori Tori中集合到集合的不相交路径
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0028
K. Kaneko, A. Bossard
{"title":"Set-to-Set Disjoint Paths in Tori","authors":"K. Kaneko, A. Bossard","doi":"10.1109/CANDAR.2016.0028","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0028","url":null,"abstract":"Numerous TOP500 supercomputers are based on a torus interconnection network. The torus topology is effectively one of the most popular interconnection networks for massively parallel systems due to its interesting topological properties such as symmetry and simplicity. For instance, the world-famous supercomputers Fujitsu K, IBM Blue Gene/L, IBM Blue Gene/P and Cray XT3 are all torus-based. In this paper, we propose an algorithm that constructs 2n mutually node-disjoint paths from a set S of 2n source nodes to a set D of 2n destination nodes in an n-dimensional k-ary torus Tn,k (n ¡Ã 1, k ¡Ã 3). This algorithm is then formally evaluated. We have proved that the paths selected by the proposed algorithm have lengths at most 2(k + 1)n and can be obtained with a time complexity of O(kn3 + n3 log n).","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"21 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133076368","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
Auto and Cross Correlation of Well Balanced Sequence over Odd Characteristic Field 奇特征域上平衡序列的自相关和互相关
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0109
Ali Md. Arshad, Y. Nogami, Hiroto Ino, S. Uehara
{"title":"Auto and Cross Correlation of Well Balanced Sequence over Odd Characteristic Field","authors":"Ali Md. Arshad, Y. Nogami, Hiroto Ino, S. Uehara","doi":"10.1109/CANDAR.2016.0109","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0109","url":null,"abstract":"In this paper, the authors have proposed a new approach for generating multi-value sequence by utilizing primitive element, trace function, and k-th power residue symbol over odd characteristic field. Let p be an odd prime and Fp be an odd characteristic prime field, m be the degree of the primitive polynomial f(x), and k be a prime factor of p-1. In details, the procedure for generating multi-value sequence is as follows: primitive polynomial f(x) generates maximum length vector sequence, then trace function Tr(.) maps an element of extension field Fpm to an element of prime field Fp, next non-zero scalar A 2 Fp is added to the trace value, and finally k-th power residue symbol is utilized to map the scalars into (k + 1) values multi-value sequence. In this method, a certain mapping function Mk(.) is utilized during the autocorrelation calculation. Hence, our proposed multi-value sequence has some parameters such as p, m, k, and A. This paper discusses the period, autocorrelation, and cross-correlation properties of proposed multi-value sequence based on some experimental results.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"10 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":"115883688","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}
引用次数: 2
Cheating Detectable Secret Sharing Scheme Suitable for Implementation 适合实现的可检测作弊秘密共享方案
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0112
Hidetaka Hoshino, Satoshi Obana
{"title":"Cheating Detectable Secret Sharing Scheme Suitable for Implementation","authors":"Hidetaka Hoshino, Satoshi Obana","doi":"10.1109/CANDAR.2016.0112","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0112","url":null,"abstract":"A cheating detectable secret sharing scheme is a secret sharing scheme that can detect forged shares in reconstructing a secret. For example, if we store shares in cloud storage, there is a possibility of it being forged. If the administrators of cloud storage are malicious, it is easy for them to forge a share. Therefore, cheating detectable secret sharing schemes have attracted attention, and many efficient schemes have been proposed. However, most existing schemes are not suitable for implementation. The reasons are as follows. First, the computational cost of the schemes is very high. Second, the required finite field for implementation depends on the secret. Finally, the schemes do not support secrets that are bit strings. In this paper, we propose a cheating detectable secret sharing scheme suitable for implementation. However, we assume that cheaters do not know the secret. The basic idea is a bitdecomposing technique. The bit length of the proposed scheme is an optimum. Moreover, the proposed scheme is applicable to any linear secret sharing schemes.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"9 11 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":"116933586","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
Implementing Breadth-First Search on a Compact Supercomputer Suiren 在小型超级计算机Suiren上实现广度优先搜索
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0075
Takuji Mitsuishi, Takahiro Kaneda, S. Torii, H. Amano
{"title":"Implementing Breadth-First Search on a Compact Supercomputer Suiren","authors":"Takuji Mitsuishi, Takahiro Kaneda, S. Torii, H. Amano","doi":"10.1109/CANDAR.2016.0075","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0075","url":null,"abstract":"Cost and energy efficient supercomputers have received attention not only for scientific computation but for big data processing. In the fields of social networks and biology, the relationship between data is often represented by large target graphs that require huge computation costs to analyze. A new parallel BFS method called degree-chain traversal (DC) is proposed and implemented on the energy efficient compact supercomputer Suiren. In DC, by treating vertices that have the same parents as a form of ’chain’, both the communication amount and the number of memory accesses are reduced. Evaluation results show that the total amount of computation was reduced by 30%, and the execution time was shortened by 14%, when tasks are executed with four processes. We also tried to accelerate the execution with PEZY-SC, an MIMD accelerator attached to Suiren. However, the average execution time was not improved because of the large variation in the execution time depending on the root node. Through the analysis, an unbalanced task assignment and a bottleneck of the memory were pointed out. However, this bottleneck is eased by using new PEZY-SC2 which has wider memory bandwidth.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"349 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":"115676941","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
How to Speed Up CUDA-WSat-PcL by 5x 如何将CUDA-WSat-PcL加速5倍
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0087
Heng Liu, Arrvindh Shriraman, Evgenia Ternovska
{"title":"How to Speed Up CUDA-WSat-PcL by 5x","authors":"Heng Liu, Arrvindh Shriraman, Evgenia Ternovska","doi":"10.1109/CANDAR.2016.0087","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0087","url":null,"abstract":"The Propositional Satisfiability Problem (SAT) is one of the most fundamental NP-complete problems, and is central to many domains of computer science. Utilizing a massively parallel architecture on a Graphics Processing Unit (GPU) together with a conventional CPU on NVIDIA's Compute Unified Device Architecture (CUDA) platform, this work proposes an efficient scheme to implement one parallel Stochastic Local Search (SLS) algorithms for SAT: CUDA-WSat-PcL. The implementation leads up to 5x speedup over the latest implementation of CUDA-WSat-PcL on CUDA. Additionally, our profiling results show that the CUDA portion of the new implementation is now at least 6x faster.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"37 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":"126089587","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
On-the-Fly Data Compression/Decompression Mechanism with ExpEther 实时数据压缩/解压机制与ExpEther
2016 Fourth International Symposium on Computing and Networking (CANDAR) Pub Date : 2016-11-01 DOI: 10.1109/CANDAR.2016.0031
Hideki Shimura, Takuji Mitsuishi, Masaki Kan, T. Yoshikawa, H. Amano
{"title":"On-the-Fly Data Compression/Decompression Mechanism with ExpEther","authors":"Hideki Shimura, Takuji Mitsuishi, Masaki Kan, T. Yoshikawa, H. Amano","doi":"10.1109/CANDAR.2016.0031","DOIUrl":"https://doi.org/10.1109/CANDAR.2016.0031","url":null,"abstract":"ExpEther is a virtualization technique that extends PCIe of a host CPU to Ethernet. Since all devices connected by ExpEther can be treated as if they were directly connected to the host, a multi-GPU system called GBU-BOX that connects a number of GPUs virtually to a host can be easily developed. However, the smaller bandwidth of Ethernet compared to PCIe often bottlenecks the system. An on-the-fly data compression/decompression mechanism is proposed for the ExpEther NIC to compensate for the gap in bandwidth between PCIe and Ethernet. Two algorithms, WAH and SECOMPAX, are implemented on an FPGA for compressing bitmap index data. The former reduces the amount of data on Ethernet to 28% while the latter reduces it to 27% when Graph500 BSF is executed on GPU-BOX. Considering the hardware overhead, WAH is a good solution for applications.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"126 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":"126796015","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信