Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00079
Tomoki Agematsu, Satoshi Obana
In recent years, as the number of cloud services increases, leakage of confidential information is a matter of concern. Techniques for processing data while preserving confidentiality of data are called secure computation, and secure computation based on fully homomorphic encryption (FHE for short) is one of the most important ways of realizing secure computation. FHE is a cryptosystem that can perform both arbitrary times of additions and multiplications of data in the encrypted state. Therefore, by using FHE, we can realize arbitrary operations in the encrypted state. However, it is not so easy to realize complex operations using FHE in practice. In particular, there are difficulties in realizing complex operations with high accuracy. Such computation is highly desired in various situations (e.g., in computing medical statistics). Nevertheless, the methodology to compute complex operations given a certain accuracy is not well studied so far. In this research, we propose a method to compute division and a u-th root in the encrypted state using FHE. In the proposed method, the result of an operation can achieve the given accuracy. We employ the n-th order maclaurin approximate polynomial to approximate division and a u-th root by homomorphic addition and multiplication. We evaluate the error of an approximation using a remainder term. Also, we implemented the proposed method and measured execution time for division and a square root.
{"title":"How to Realize Highly Accurate Computation with Fully Homomorphic Encryption","authors":"Tomoki Agematsu, Satoshi Obana","doi":"10.1109/CANDARW.2018.00079","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00079","url":null,"abstract":"In recent years, as the number of cloud services increases, leakage of confidential information is a matter of concern. Techniques for processing data while preserving confidentiality of data are called secure computation, and secure computation based on fully homomorphic encryption (FHE for short) is one of the most important ways of realizing secure computation. FHE is a cryptosystem that can perform both arbitrary times of additions and multiplications of data in the encrypted state. Therefore, by using FHE, we can realize arbitrary operations in the encrypted state. However, it is not so easy to realize complex operations using FHE in practice. In particular, there are difficulties in realizing complex operations with high accuracy. Such computation is highly desired in various situations (e.g., in computing medical statistics). Nevertheless, the methodology to compute complex operations given a certain accuracy is not well studied so far. In this research, we propose a method to compute division and a u-th root in the encrypted state using FHE. In the proposed method, the result of an operation can achieve the given accuracy. We employ the n-th order maclaurin approximate polynomial to approximate division and a u-th root by homomorphic addition and multiplication. We evaluate the error of an approximation using a remainder term. Also, we implemented the proposed method and measured execution time for division and a square root.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133191990","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00101
T. Miyazaki, H. Hidari, Naohisa Hojo, Ittetsu Taniguchi, H. Tomiyama
OpenCL is one of the most popular frameworks for parallel computing. OpenCL is platform independent in principle, and OpenCL programs can be executed on various hardware platforms such as GPUs, multicore processors and FPGAs. However, OpenCL programs written for GPUs are often poorly executed on multicore processors in terms of performance due to the granularity of threads. This paper addresses efficient execution of GPU-oriented OpenCL programs on multicore processors. This paper solves a couple of draw-backs in an existing OpenCL framework and shows the effectiveness of this work through experiments.
{"title":"Revisiting Thread Execution Methods for GPU-Oriented OpenCL Programs on Multicore Processors","authors":"T. Miyazaki, H. Hidari, Naohisa Hojo, Ittetsu Taniguchi, H. Tomiyama","doi":"10.1109/CANDARW.2018.00101","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00101","url":null,"abstract":"OpenCL is one of the most popular frameworks for parallel computing. OpenCL is platform independent in principle, and OpenCL programs can be executed on various hardware platforms such as GPUs, multicore processors and FPGAs. However, OpenCL programs written for GPUs are often poorly executed on multicore processors in terms of performance due to the granularity of threads. This paper addresses efficient execution of GPU-oriented OpenCL programs on multicore processors. This paper solves a couple of draw-backs in an existing OpenCL framework and shows the effectiveness of this work through experiments.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133304468","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}
Pub Date : 2018-11-01DOI: 10.1109/candarw.2018.00007
Rui Zhang
Program Committee Muhammad Cheema, Monash University, Australia Reynold Cheng, The University of Hong Kong, Hong Kong Yunjun Gao, Zhejiang University, China Yoshiharu Ishikawa, Nagoya University, Japan Hua Lu, Aalborg University, Denmark Jianzhong Qi, The University of Melbourne, Australia Simonas Saltenis, Aalborg University, Denmark Weiwei Sun, Fudan University, China Lu-An Tang, NEC Lab America, USA Xing Xie, Microsoft Research Asia, China Xike Xie, Aalborg University, Denmark Man Lung Yiu, The Hong Kong Polytechnic University, Hong Kong Wenjie Zhang, University of New South Wales, Australia Ying Zhang, University of New South Wales, Australia
{"title":"Workshops Organization","authors":"Rui Zhang","doi":"10.1109/candarw.2018.00007","DOIUrl":"https://doi.org/10.1109/candarw.2018.00007","url":null,"abstract":"Program Committee Muhammad Cheema, Monash University, Australia Reynold Cheng, The University of Hong Kong, Hong Kong Yunjun Gao, Zhejiang University, China Yoshiharu Ishikawa, Nagoya University, Japan Hua Lu, Aalborg University, Denmark Jianzhong Qi, The University of Melbourne, Australia Simonas Saltenis, Aalborg University, Denmark Weiwei Sun, Fudan University, China Lu-An Tang, NEC Lab America, USA Xing Xie, Microsoft Research Asia, China Xike Xie, Aalborg University, Denmark Man Lung Yiu, The Hong Kong Polytechnic University, Hong Kong Wenjie Zhang, University of New South Wales, Australia Ying Zhang, University of New South Wales, Australia","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133661983","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00038
M. Hasegawa, J. Tada
In the upper-level caches like as L1 caches, the temporal locality mainly affects the performance of the caches. Although the Adaptive Demotion Policy (ADP) can achieve the performance improvement at the upper-level caches compared to the conventional hardware suitable replacement policies, the most recently used block will be evicted when all the blocks in the accessed set have the same priority value. Hence, there is a possibility of decreasing the performance of the cache by spoiling the temporal locality. To avoid this problem, this paper proposes a cache replacement policy which focuses on preventing the eviction of the most recently used block, and the policy is called Adaptive Demotion Policy with considering Temporal Locality (ADPTL). At a cache hit, if the priority values of all the blocks in the accessed set except the hit block are the highest value, the ADPTL decreases these priority values by one. This operation prevents the eviction of the most recently used block. The performance evaluation shows that the ADPTL achieves the reduction of the cache misses and the IPC improvement at the L1 caches compared to the LRU policy and the ADP.
{"title":"An Adaptive Demotion Policy with Considering Temporal Locality","authors":"M. Hasegawa, J. Tada","doi":"10.1109/CANDARW.2018.00038","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00038","url":null,"abstract":"In the upper-level caches like as L1 caches, the temporal locality mainly affects the performance of the caches. Although the Adaptive Demotion Policy (ADP) can achieve the performance improvement at the upper-level caches compared to the conventional hardware suitable replacement policies, the most recently used block will be evicted when all the blocks in the accessed set have the same priority value. Hence, there is a possibility of decreasing the performance of the cache by spoiling the temporal locality. To avoid this problem, this paper proposes a cache replacement policy which focuses on preventing the eviction of the most recently used block, and the policy is called Adaptive Demotion Policy with considering Temporal Locality (ADPTL). At a cache hit, if the priority values of all the blocks in the accessed set except the hit block are the highest value, the ADPTL decreases these priority values by one. This operation prevents the eviction of the most recently used block. The performance evaluation shows that the ADPTL achieves the reduction of the cache misses and the IPC improvement at the L1 caches compared to the LRU policy and the ADP.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116075217","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00011
Katsunobu Imai, Kyosuke Oroji, T. Kubota
Larger than Life cellular automaton (LtL) is a class of cellular automata and is a generalization of the game of Life by extending its neighborhood radius. We have studied the three-dimensional extension of LtL. In this paper, we show a radius-4 three-dimensional LtL has some special patterns like gliders and blinkers in Life which realize several functions such as turning and copying gliders. Employing these functions we also show that it is weakly universal because it is possible to simulate any one-dimensional cellular automaton circuit including the rule 110 cellular automaton.
{"title":"A Weakly Universal Three-Dimensional Larger than Life Cellular Automaton","authors":"Katsunobu Imai, Kyosuke Oroji, T. Kubota","doi":"10.1109/CANDARW.2018.00011","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00011","url":null,"abstract":"Larger than Life cellular automaton (LtL) is a class of cellular automata and is a generalization of the game of Life by extending its neighborhood radius. We have studied the three-dimensional extension of LtL. In this paper, we show a radius-4 three-dimensional LtL has some special patterns like gliders and blinkers in Life which realize several functions such as turning and copying gliders. Employing these functions we also show that it is weakly universal because it is possible to simulate any one-dimensional cellular automaton circuit including the rule 110 cellular automaton.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121947622","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00021
Atsushi Ito, Fu Xiang, Hiroyuki Hatano, Hidetoshi Uchiyama
In this paper, we mention the result of the experiment to observe a lost child by using BLE beacons. We performed a trial of a children observation service in June 2017 in a 5-story building. One or more children moved with BLE beacon. Some witnesses moved with a smartphone to detect a BLE beacon that was held by a child. Also, we used some fixed beacon to detect a position of witnesses. We prepared 19 test patterns to test the possible combinations of the position of a smartphone, status of the application (foreground or background), floors, the number of the lost children and witnesses to estimate the accuracy of location and floor of the lost child. As a result, the possibility to detect floor was 76.1%, and the possibility to detect the location on a floor was 78%. We would like to discuss the reason for the low accuracy and the plan for the next step as the conclusion.
{"title":"A Study on Observing a Lost Child Using BLE Beacons","authors":"Atsushi Ito, Fu Xiang, Hiroyuki Hatano, Hidetoshi Uchiyama","doi":"10.1109/CANDARW.2018.00021","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00021","url":null,"abstract":"In this paper, we mention the result of the experiment to observe a lost child by using BLE beacons. We performed a trial of a children observation service in June 2017 in a 5-story building. One or more children moved with BLE beacon. Some witnesses moved with a smartphone to detect a BLE beacon that was held by a child. Also, we used some fixed beacon to detect a position of witnesses. We prepared 19 test patterns to test the possible combinations of the position of a smartphone, status of the application (foreground or background), floors, the number of the lost children and witnesses to estimate the accuracy of location and floor of the lost child. As a result, the possibility to detect floor was 76.1%, and the possibility to detect the location on a floor was 78%. We would like to discuss the reason for the low accuracy and the plan for the next step as the conclusion.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124803984","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00093
Yuji Suga
We report status survey of SSL/TLS sites in 2018 after pointing out about "search form" issues. From 2014, several researchers were conducting fixed point observation to crawl SSL/TLS sites using. jp domain URL list extracted from Alexa Top Sites, and investigation on improvement of usage rate of SSL/TLS versions and Export-grade encryption algorithms. They also pointed out that on-line login sites belonging to the an association of Japanese banks were well-controlled in SSL/TLS server configurations and also contents management, however ordinary sites had "search form" issues. In this paper, we re-investigate the status of SSL/TLS sites including Japanese banks.
在指出“搜索表单”问题后，我们报告了2018年SSL/TLS网站的现状调查。从2014年开始，一些研究人员进行定点观察，以抓取使用SSL/TLS的站点。从Alexa Top Sites中提取出jp域名URL列表，并对SSL/TLS版本和export级加密算法使用率的提高进行了研究。他们还指出，属于日本银行协会的在线登录网站在SSL/TLS服务器配置和内容管理方面得到了很好的控制，但普通网站存在“搜索表单”问题。本文重新研究了包括日本银行在内的SSL/TLS站点的现状。
{"title":"Status Survey of SSL/TLS Sites in 2018 After Pointing Out About \"Search form\" Issues","authors":"Yuji Suga","doi":"10.1109/CANDARW.2018.00093","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00093","url":null,"abstract":"We report status survey of SSL/TLS sites in 2018 after pointing out about \"search form\" issues. From 2014, several researchers were conducting fixed point observation to crawl SSL/TLS sites using. jp domain URL list extracted from Alexa Top Sites, and investigation on improvement of usage rate of SSL/TLS versions and Export-grade encryption algorithms. They also pointed out that on-line login sites belonging to the an association of Japanese banks were well-controlled in SSL/TLS server configurations and also contents management, however ordinary sites had \"search form\" issues. In this paper, we re-investigate the status of SSL/TLS sites including Japanese banks.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129558494","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00059
S. Kamei, H. Kakugawa
This paper considers dynamically maintaining two disjoint dominating sets for sleep scheduling or cluster head scheduling in sensor networks. We formulate this problem as the local (1, |Ni|)-critical section (abbr. CS) problem which is one of the generalizations of the mutual exclusion problem. This is the problem of controlling the system in such a way that, for each process, among its neighbors and itself, at least one process must be in the CS and at least one process must be out of the CS at each time. In this paper, first, we consider an inefficient (costly) self-stabilizing algorithm for the local (1, |Ni|)-CS problem. Additionally, this paper shows the necessary and sufficient conditions to solve the problem without any deadlock detection based on the algorithm. After that, an efficient self-stabilizing algorithm for the local (1, |Ni|)-CS problem is proposed. The convergence time of the proposed algorithm is O(n) rounds under the weakly fair distributed daemon.
{"title":"Self-Stabilizing Algorithm for Dynamically Maintaining Two Disjoint Dominating Sets","authors":"S. Kamei, H. Kakugawa","doi":"10.1109/CANDARW.2018.00059","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00059","url":null,"abstract":"This paper considers dynamically maintaining two disjoint dominating sets for sleep scheduling or cluster head scheduling in sensor networks. We formulate this problem as the local (1, |Ni|)-critical section (abbr. CS) problem which is one of the generalizations of the mutual exclusion problem. This is the problem of controlling the system in such a way that, for each process, among its neighbors and itself, at least one process must be in the CS and at least one process must be out of the CS at each time. In this paper, first, we consider an inefficient (costly) self-stabilizing algorithm for the local (1, |Ni|)-CS problem. Additionally, this paper shows the necessary and sufficient conditions to solve the problem without any deadlock detection based on the algorithm. After that, an efficient self-stabilizing algorithm for the local (1, |Ni|)-CS problem is proposed. The convergence time of the proposed algorithm is O(n) rounds under the weakly fair distributed daemon.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129017684","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00089
M. Payeras-Capellà, M. M. Puigserver, Miquel A. Cabot-Nadal
Blockchain can be the base for an evolution in several digital services. Fair Certified Notification is one of these and requires a fair exchange of values: a message and a non-repudiation of origin proof in exchange for a non-repudiation of reception evidence. The main contribution of this paper is the introduction of a blockchain-based Multiparty Fair Certified Notification system allowing the simultaneous fair notification to a set of receivers. We present and evaluate a smart contract for an optimistic multiparty protocol that achieves the properties of confidentiality, fairness and timeliness with a stateless TTP.
{"title":"Smart Contract for Multiparty Fair Certified Notifications","authors":"M. Payeras-Capellà, M. M. Puigserver, Miquel A. Cabot-Nadal","doi":"10.1109/CANDARW.2018.00089","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00089","url":null,"abstract":"Blockchain can be the base for an evolution in several digital services. Fair Certified Notification is one of these and requires a fair exchange of values: a message and a non-repudiation of origin proof in exchange for a non-repudiation of reception evidence. The main contribution of this paper is the introduction of a blockchain-based Multiparty Fair Certified Notification system allowing the simultaneous fair notification to a set of receivers. We present and evaluate a smart contract for an optimistic multiparty protocol that achieves the properties of confidentiality, fairness and timeliness with a stateless TTP.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117022594","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}
Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00054
H. Murai, M. Sato, M. Nakao, Jinpil Lee
Recently, low productivity owing to more and more complicated programs has become a serious problem in the field of High Performance Computing (HPC). Omni is a compiler infrastructure based on source-to-source translation for Fortran and C. It was developed by RIKEN and the University of Tsukuba. We are developing a metaprogramming framework for existing HPC languages including Fortran based on Omni with a goal of higher productivity of HPC programs. In this paper, we show the design and prototype implementation of this framework, which is based on directives and abstract syntax trees, and evaluate its feasibility and effectiveness. Through case studies of loop unrolling and the data-layout optimization of derived types, it is verified that various kinds of code transformations can be specified with this framework to improve program productivity.
{"title":"Metaprogramming Framework for Existing HPC Languages Based on the Omni Compiler Infrastructure","authors":"H. Murai, M. Sato, M. Nakao, Jinpil Lee","doi":"10.1109/CANDARW.2018.00054","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00054","url":null,"abstract":"Recently, low productivity owing to more and more complicated programs has become a serious problem in the field of High Performance Computing (HPC). Omni is a compiler infrastructure based on source-to-source translation for Fortran and C. It was developed by RIKEN and the University of Tsukuba. We are developing a metaprogramming framework for existing HPC languages including Fortran based on Omni with a goal of higher productivity of HPC programs. In this paper, we show the design and prototype implementation of this framework, which is based on directives and abstract syntax trees, and evaluate its feasibility and effectiveness. Through case studies of loop unrolling and the data-layout optimization of derived types, it is verified that various kinds of code transformations can be specified with this framework to improve program productivity.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124584298","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：