检索结果-内蒙古大学图书馆

33rd IEEE International parallel and distributed Processing Symposium (IPDPS)

作者： Marzulo, Leandro A. J. Bianchini, Calebe P. Santiago, Leandro Ferreira, Victor C. Goldstein, Brunno F. Franca, Felipe M. G. Univ Estado Rio De Janeiro UERJ Inst Matemat & Estat Rio De Janeiro Brazil Univ Presbiteriana Mackenzie Fac Comp & Informat Sao Paulo SP Brazil Univ Fed Rio De Janeiro UFRJ Programa Engn Sistemas & Comp COPPE Rio De Janeiro Brazil

ISBN: (纸本)9781538655559

parallel and distributed programming is essential for exploiting the processing power of modern computing platforms. However, during the first years of a Computer Science course, students usually learn problem solving techniques, data structures and programming paradigms that are inherently sequential, hindering the transition to parallel architectures. parallel Programming Marathons organized in Brazil are similar to other Programming Competitions around the world and have been used for teaching and stimulating undergraduate and graduate students into learning to "think in parallel" and to develop applications for different parallel architectures, including multicores, clusters and accelerators. This paper presents the structure of this parallel Programming Marathon and an overview of how it supports regional and national contests. Also, this work presents use cases on parallel and distributed computing course from two different Brazilian universities that use a challenge based learning approach and employ marathon problems as course assignments. This approach contributed to increase students' interest towards High Performance computing.

关键词： High Performance computing Marathon of parallel Programming parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Unplugged Activities to Introduce parallel computing in Introductory Programming Classes: an Experience Report 19

Unplugged Activities to Introduce Parallel Computing in Intr...

引用

ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE)

作者： Ghafoor, Sheikh K. Brown, David W. Rogers, Mike Hines, Thomas Tennessee Technol Univ Cookeville TN 38505 USA

ISBN: (纸本)9781450363013

Learning programming in early introductory classes is challenging for first year university students, and introducing parallel programming (PDC) in early classes along with traditional sequential programming is even more challenging. Unplugged activities may help alleviate some of the difficulties for students. Unplugged activities have been shown to increase student interest, and to enhance student understanding of CS programming concepts [1]. We have used unplugged activities to teach PDC concepts before introducing parallel programming. Our experiences show that using unplugged activities to introduce the PDC concepts reduce the barrier to learn parallel programming.

关键词： Unplugged Activities parallel and distributed computing Introductory Programming

来源：评论

学校读者我要写书评

暂无评论

parallel Multi-population Improved Brain Storm Optimization with Differential Evolution strategies for State Estimation in Distribution Systems using Just In Time Modeling and Correntropy

Parallel Multi-population Improved Brain Storm Optimization ...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Azuma, Daichi Fukuyama, Yoshikazu Oi, Akihiro Jintsugawa, Toru Fujimoto, Hisashi Meiji Univ Grad Sch Adv Math Sci Tokyo Japan Fuji Elect Co Ltd Corp R&D Headquarters Tokyo Japan

ISBN: (纸本)9781728124858

This paper proposes parallel multi-population improved brain storm optimization with differential evolution strategies (PMP-IBSODE) for state estimation in distribution systems (SEDS) using just in time (JIT) modeling and correntropy. SEDS is a function which estimates system conditions such as voltage and current everywhere in the distribution system using limited measurement data. When outliers, which are not true values, are measured at the measurement points, JIT modeling and correntropy can be effective. Moreover, application of evolutionary computation techniques is necessary for the SEDS considering of a nonlinear characteristic of an objective function caused by equipment in distribution systems. Various evolutionary computation techniques including IBSODE have been applied to the SEDS. However, speed-up of calculation and high quality estimation results are required because of penetration of renewable energies. An evolutionary computation technique using multi-population and parallel distributed computing is one of solutions for the challenges. The proposed method is verified to speed up computation time and obtain higher quality estimation results than conventional methods.

关键词： multi population improved brain storm optimization with differential evolution strategies parallel and distributed computing state estimation in distribution systems just in time modeling correntropy

来源：评论

学校读者我要写书评

暂无评论

A Low-Cost, High-Performance Implementation of RSA Algorithm Using GPGPU

A Low-Cost, High-Performance Implementation of RSA Algorithm...

引用

Springer International Conference on Emerging Technologies in Data Mining and Information Security (IEMIS)

作者： Srivatsa, P. S. Sasaank Rao, P. V. R. R. Bhogendra Keshav Mem Inst Technol Hyderabad India Def Res & Dev Lab Hyderabad Kanchanbagh India

ISBN: (纸本)9789811319518;9789811319501

Information security has been of great use in various civilian and defence domains. However, the arduous procedures involved in securely establishing a common key lead to asymmetric-key encryption. The high computational needs of asymmetric-key encryption process made them impractical to be used for real-world applications. The proliferation of low-cost, high-performance computing through GPGPUs made many applications with high-performance requirements feasible to implement and use in real-world applications. A successful attempt has been made to implement RSA algorithm using GPGPU and the results are presented in this paper.

关键词： parallel and distributed computing Heterogeneous computing GPGPU computing OpenCL Asymmetric-key encryption

来源：评论

学校读者我要写书评

暂无评论

Interconnection Network Reliability Evaluation: Multistage Layouts

引用

丛书名： Performability engineering series

2020年

作者： Neeraj Kumar Goyal S. Rajkumar

ISBN: (数字)9781119620600

ISBN: (纸本)9781119620587

Keeping in view the growth of the technological frontiers, there is always a need for the development of reliable, fault tolerant and cost- effective interconnection networks (INs) which are the critical metrics to achieve the goal of parallelism. The main objective of this book is to design new fault tolerant interconnection network layouts capable of path redundancy among dynamic failures. New INs designs are proposed and their observed results are found promising when compared with some of the earlier networks. The book also covers the reliability evaluation of various industrial network topologies considering multiple reliability performance parameters (2-TR, broadcast and ATR). Finally, the book also focuses on reliability evaluation and comparison of various topologies considering connectivity among multiple sources and multiple destinations (MSMT) nodes.

关键词： parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Optimization design for parallel coloring of a set of graphs in the High-Performance computing 15

Optimization design for parallel coloring of a set of graphs...

引用

IEEE 15th International Scientific Conference on Informatics (INFORMATICS)

作者： Dudas, Adam Skrinarova, Jarmila Vesel, Eduard Univ Zilina Fac Management Sci & Informat Zilina Slovakia Matej Bel Univ Fac Nat Sci Banska Bystrica Slovakia

ISBN: (纸本)9781728131795

This paper presents solution to problem of edge coloring of sizable set of cubic graphs and examination of relations between these graphs. We solved this problem on various computing systems and for various sizes of the problem (various number of graphs). For the computations we used High-Performance computing Cluster and Amazon Web Services cloud environment. We measured and analyzed time of computation of edge coloring and other properties. Largest set we worked with contained almost 10 million graphs. We created new methodology, which can be used to finding order of the edges which optimizes time of computation of edge coloring for certain subset of graphs. On the basis of this methodology, we implemented algorithm for parallel edge coloring of set of graphs. For testing of the methodology, we designed 8 experiments. Results showed, that worst time of edge coloring of graph from set of 19 935 graphs before use of the methodology was 1260 ms. After application of our methodology, we found same order of edge coloring for whole group of 19 935 graphs and the highest time of coloring was 10 ms.

关键词： parallel and distributed computing HPC virtual machines edge coloring of cubic graphs

来源：评论

学校读者我要写书评

暂无评论

decryst: an efficient software suite for structure determination from powder dirtraction

引用

JOURNAL OF APPLIED CRYSTALLOGRAPHY 2018年第4期51卷 1237-1243页

作者： Liu, Yu Chinese Acad Sci Inst Phys Natl Lab Superconduct Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100149 Peoples R China

Presented here is decryst, a software suite for structure determination from powder diffraction, which uses the direct-space method, and is able to apply anti-bump constraints automatically and efficiently during the procedure of global optimization using the crystallographic collision detection algorithm by Liu [Acta Cryst. (2017), A73, 414-422]. decryst employs incremental computation in its global-optimization cycles, which results in dramatic performance enhancement. It is also designed with parallel and distributed computing in mind, allowing for even better performance by simultaneous use of multiple processors. Owing to the parallelized usage of the equivalent position combination method [Deng & Dong (2009). J. Appl. Cryst. 42, 953-958] in decryst, it is particularly suitable for determination of structures with mostly unknown bonding relations, and offers some unprecedented opportunities for these structures. decryst is free and open-source software, and can be obtained at https://***/CasperVector/decryst/;it strives to be simple yet flexible, in the hope that the underlying techniques could be adopted in more crystallographic applications.

关键词： incremental computation parallel and distributed computing powder diffraction structure determination computer programs decryst

来源：评论

学校读者我要写书评

暂无评论

Scalable distributed Semantic Network for knowledge management in cyber physical system

引用

JOURNAL OF parallel and distributed computing 2018年第Part1期118卷 22-33页

作者： Song, Shengli Lin, Yishuai Guo, Bin Di, Qiang Lv, Rong Xidian Univ Software Engn Inst Xian Shaanxi Peoples R China Northwestern Polytech Univ Sch Comp Sci Xian Shaanxi Peoples R China Xidian Univ Sch Comp Sci & Technol Xian Shaanxi Peoples R China

The remarkable growth of emerging technologies and computing paradigms in cyberspace and the cyber physical systems generate a huge mass of data sources. These different autonomous and heterogeneous data sources can contain complementary or semantically equivalent information stored under different formats that vary from structured, semi structured, to unstructured. These heterogeneities influence on data semantics and meaning. Therefore, knowledge management became more and more difficult and sometimes fruitless. In this paper, we propose a new scalable model, named distributed Semantic Network (DSN), for heterogeneous data representation and can extract more semantic information from different data sources. We use the prior knowledge of WordNet and Wikipedia to scale out DSN horizontally and vertically. Furthermore, we proposed a MapReduce based framework to construct the knowledge base more effectively in parallel and distributed computing (PDC). The experimental results show that DSN can better model the semantic information in the text. It can extract a larger amount of information from the text with a higher precision, achieving 34% increase in quantity and 15% promotion on precision than the best -performing alternative method on same datasets. On the three datasets, our proposed PDC framework shorten the process time by 5.8-11.5 times. (C) 2017 Elsevier Inc. All rights reserved.

关键词： parallel and distributed computing Knowledge management distributed semantic network MapReduce framework Cyber physical system

来源：评论

学校读者我要写书评

暂无评论

Scaling-up reasoning and advanced analytics on BigData

引用

THEORY AND PRACTICE OF LOGIC PROGRAMMING 2018年第5-6期18卷 806-845页

作者： Condie, Tyson Das, Ariyam Interlandi, Matteo Shkapsky, Alexander Yang, Mohan Zaniolo, Carlo Univ Calif Los Angeles Los Angeles CA 90095 USA

BigDatalog is an extension of Datalog that achieves performance and scalability on both Apache Spark and multicore systems to the point that its graph analytics outperform those written in GraphX. Looking back, we see how this realizes the ambitious goal pursued by deductive database researchers beginning 40 years ago: this is the goal of combining the rigor and power of logic in expressing queries and reasoning with the performance and scalability by which relational databases managed BigData. This goal led to Datalog which is based on Horn Clauses like Prolog but employs implementation techniques, such as semi-naive fixpoint and magic sets, that extend the bottom-up computation model of relational systems, and thus obtain the performance and scalability that relational systems had achieved, as far back as the 80s, using data-parallelization on shared-nothing architectures. But this goal proved difficult to achieve because of major issues at (i) the language level and (ii) at the system level. The paper describes how (i) was addressed by simple rules under which the fixpoint semantics extends to programs using count, sum and extrema in recursion, and (ii) was tamed by parallel compilation techniques that achieve scalability on multicore systems and Apache Spark. This paper is under consideration for acceptance in Theory and Practice of Logic Programming.

关键词： Deductive databases Datalog BigData parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

parallel Multipopulation Differential Evolutionary Particle Swarm Optimization for Voltage and Reactive Power Control

引用

ELECTRICAL ENGINEERING IN JAPAN 2018年第3期204卷 31-40页

作者： Yoshida, Hotaka Fukuyama, Yoshikazu Meiji Univ Sch Interdiscipl Math Sci Dept Network Design Tokyo Japan Meiji Univ Tokyo Japan

This paper presents parallel multipopulation differential evolutionary particle swarm optimization (DEEPSO) for voltage and reactive power control (VQC). The problem can be formulated as a mixed integer nonlinear optimization problem and various evolutionary computation techniques have been applied to the problem including PSO, differential evolution (DE), and DEEPSO. Since VQC is one of the online controls, speed-up of computation is required. Moreover, there is still room for improvement in solution quality. This paper applies parallel multipopulation DEEPSO in order to speed up the calculation and improve solution quality. The proposed method is applied to IEEE 30, 57, and 118 bus systems. The results indicate that the proposed method can realize fast computation and minimize more active power losses than the conventional evolutionary computation techniques.

关键词： voltage and reactive power control parallel and distributed computing parallel differential evolutionary particle swarm optimization multipopulation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：