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

12th CASC International Workshop

作者： Andrianov, Serge N. St Petersburg State Univ Fac Appl Math & Control Proc St Petersburg 198504 Russia

ISBN: (纸本)9783642152733

It is known that accelerator physics technology has made essential contributions to other branches of science and technology. Experiments realized on linear and circular accelerators have made remarkable discoveries about the basic nature of matter. In particular, there are now two accelerator projects. The first of them is already realized the Large Hadron Collider, the second the pilot project for future dedicated EDM machine. These and other similar projects (i. e., the project NICA JINR, Dubna) demand some special requirements for simulation methods and technologies. Indeed, the successful functioning of these accelerators requires essential advancement in theory and technology leading to new particle accelerators capabilities. The complexity of accelerator physics problems makes comprehensive use of modern analytical, numerical, and symbolic methods. Only if we integrate these approaches the corresponding computational technologies will be effective. In the present report, we discuss sonic problems of correlation between symbolic and numerical manipulation. The main approach for beam dynamics is based on Lie algebraic methods and corresponding matrix formalism as presentation tools. All suggested approaches are realized using symbolic algorithms, and the corresponding symbolic formulae are assumed as a basis of numerical algorithms. This approach allows to realize the necessary numerical modeling using parallel and distributed computational systems for some practical problems.

关键词： Symbolic algebra beam physics code generation Lie algebraic methods parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

Component-wise Meshing Approach and Evaluation of Bonding Strategy on the Interface of Components for Assembled Finite Element Analysis of Structures

Component-wise Meshing Approach and Evaluation of Bonding St...

引用

9th International Conference on Fracture and Damage Mechanics

作者： Yamada, Tomonori Kushida, Noriyuki Araya, Fumimasa Nishida, Akemi Nakajima, Norihiro Japan Atom Energy Agcy Ctr Computat Sci & eSyst Taito Ku Tokyo 1100015 Japan

ISBN: (纸本)9780878492411

The finite elements are extensively utilized to solve various problems in engineering fields with the growth of computing technologies. However, there is a lack of methodology for analyses of huge assembled structures. The mechanics on the interface of each components, for instance, contact, bolt joint and welding in assembly is a key issue for important huge structure such as nuclear power plants. On the other hand, it is well known that as finite element models become large and complex, construction of detailed mesh becomes a bottleneck in the CAE procedures. To solve these problems, the authors would like to introduce component-wise meshing approach and bonding strategy on the interface of components. In order to assemble component-wise meshes, the penalty method is introduced not only to constrain the displacements, but also to introduce classical spring connection on the joint interface, although penalty method is claimed that it is not suitable for iterative solver. In this paper, the convergence performance of an iterative solver with penalty method is investigated and the detailed component-wise distributed computation scheme is described with numerical examples.

关键词： Finite Element Method parallel and distributed computing Iterative Solver Assembled Structure

来源：评论

学校读者我要写书评

暂无评论

Low Randomness Rumor Spreading via Hashing

Low Randomness Rumor Spreading via Hashing

引用

29th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Giakkoupis, George Sauerwald, Thomas Sun, He Woelfel, Philipp Univ Calgary Dept Comp Sci Calgary AB Canada Max Planck Inst Informat Saarbrucken Germany Fudan Univ Inst Modern Math & Phys Shanghai Peoples R China

ISBN: (纸本)9783939897354

We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple push-based protocols, in which nodes choose the neighbor they send the information to in each round using pairwise independent hash functions, or a pseudo-random generator, respectively. For several wellstudied topologies our algorithms use exponentially fewer random bits than previous protocols. For example, in complete graphs, expanders, and random graphs only a polylogarithmic number of random bits are needed in total to spread the rumor in O(log n) rounds with high probability. Previous explicit algorithms, e.g., [10, 17, 6, 15], require Omega(n) random bits to achieve the same round complexity. For complete graphs, the amount of randomness used by our hashing-based algorithm is within an O(log n)-factor of the theoretical minimum determined by Giakkoupis and Woelfel [15].

关键词： parallel and distributed computing Randomness Rumor Spreading

来源：评论

学校读者我要写书评

暂无评论

Diagnosability problems of the exchanged hypercube and its generalization

引用

International Journal of Computer Mathematics: Computer Systems Theory 2017年第2期2卷 39-52页

作者： Cheng, Eddie Qiu, Ke Shen, Zhizhang Department of Mathematics and Statistics Oakland University Rochester MI United States Department of Computer Science Brock University St. Catharines ON Canada Department of Computer Science and Technology Plymouth State University Plymouth NH United States

We continue to study various properties of the generalized exchanged hypercube (GEH) structure. We also derive the g-good-neighbour diagnosability of the exchanged hypercube structure, a special case of GEH, i.e. the maximum number of faulty vertices that can be identified therein through self-diagnosis, where every non-faulty vertex has at least g (≥ 1) non-faulty neighbours, in terms of both the PMC and the comparison diagnostic ((MM^*)) models. © 2017, © 2017 Informa UK Limited, trading as Taylor & Francis Group.

关键词： exchanged hypercube Fault tolerance property g-good-neighbour diagnosability generalized exchanged hypercube parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

The engineering handbook of smart technology for aging, disability, and independence /

引用

2008年

作者： edited by Abdelsalam (Sumi) Helal Mounir Mokhtari Bessam Abdulrazak.

来源：内蒙古大学图书馆图书评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parallel Domain Decomposition Methods for Ray-Tracing on multi-cores and multi-processors

Parallel Domain Decomposition Methods for Ray-Tracing on mul...

引用

10th International Symposium on distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Venet, Cedric Magoules, Frederic Ecole Cent Paris Appl Math & Syst Lab Chatenay Malabry France

ISBN: (纸本)9780769544151

In this paper, an original parallel domain decomposition method for ray-tracing is proposed to solve numerical acoustic problems on multi-cores and multi-processors computers. A hybrid method between the ray-tracing and the beam-tracing method is first introduced. Then, a new parallel method based on domain decomposition principles is proposed. This method allows to handle large scale open domains for parallel computing purpose, better than other existing methods. parallel numerical experiments, carried out on a real world problem-namely the acoustic pollution analysis within a large city-illustrate the performance of this new domain decomposition method.

关键词： Domain decomposition methods parallel and distributed computing Acoustics Ray-tracing methods Beam-tracing methods

来源：评论

学校读者我要写书评

暂无评论

Operator Placement for Efficient distributed Complex Event Processing in MANETs 11

Operator Placement for Efficient Distributed Complex Event P...

引用

11th IEEE International Conference on Wireless and Mobile computing, Networking and Communications (WiMob)

作者： Starks, Fabrice Plagemann, Thomas Peter Univ Oslo Dept Informat Oslo Norway

ISBN: (纸本)9781467377010

Complex Event Processing (CEP) and Mobile Adhoc networks (MANETs) are two technologies that can be used to enable monitoring applications for Emergency and Rescue missions (ER). MANETs are characterized by energy limitations, and in-network processing or distributed CEP is one possible solution. Operator placement mechanism for distributed CEP has a direct impact on energy consumption. Existing operator placement mechanisms focus on static network topologies and are therefore inappropriate for MANETs scenarios. We propose a novel energy efficient decentralized distributed placement mechanism, designed to achieve fast convergence with minimal data transmission cost while achieving a near optimal placement assignment. We compare our decentralized placement mechanism with a centralized approach under different mobility scenarios. Furthermore, we evaluate the distributed CEP under different workload scenarios in order to gain additional insight into different performance characteristics of the system. Finally, we measure the impact of a simple placement replication scheme on the overall system performance in terms of delay and message overhead. Our decentralized placement mechanism achieves up to almost 50% lower message overhead compared to the centralized approach, and it has lower message overhead across different mobility scenarios compared to the centralized approach. The placement replication scheme achieves up to 51% lower delay compared to the decentralized placement mechanism with no replication.

关键词： Computer networks Mobile computing parallel and distributed computing Performance Wireless communications

来源：评论

学校读者我要写书评

暂无评论

A parallel scheduling algorithm for parallel applications

引用

parallel Algorithms and Applications 1995年第4期6.0卷 303-316页

作者： Bozyigit, Muslim Abdulghani, Amin A. University of Cambridge Computer Laboratory Cambridge CB2 3QG New Museums Site United Kingdom Rutgers University Computer Science Department NJ United States

In this work, a parallel scheduling algorithm for scheduling a set of n partially ordered tasks on an m-processor parallel computing system is studied. The method is based on a conventional list scheduling, in particular, an earliest-task-first approach. Otherwise, the algorithm developed is an original algorithm. It is designed for a hypercube type system and is tested on a Transputer based environment. The time complexity of the algorithm is 0(n(log n + log m)). The parallel scheduling algorithm produces the same schdules as its sequential counterpart whose complexity is O(mn²(logn + logm)), but in a shorter time. © 1995, Taylor & Francis Group, LLC. All rights reserved.

关键词： Hypercube parallel algorithms parallel and distributed computing parallel scheduling Transputers

来源：评论

学校读者我要写书评

暂无评论

Unplugged parallelism for First-Year CS Majors 2022

Unplugged Parallelism for First-Year CS Majors

引用

53rd Annual ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE)

作者： Anthony, Barbara M. Erdil, D. Cenk Glebova, Olga Montante, Robert Southwestern Univ Georgetown 78626 TX Guyana Sacred Heart Univ Fairfield CT 06825 USA Georgia State Univ Atlanta GA 30302 USA Bloomsburg Univ Bloomsburg PA 17815 USA

ISBN: (纸本)9781450390705

We use "unplugged" activities to introduce parallel concepts in a first-year seminar for Computer Science majors. Student teams explore parallel approaches to computational tasks. Pre- and post-activity surveys, and a reflection paper, measure the impact of these activities on students' views about parallel programming. Our goal is to encourage parallel thinking about programming tasks before sequential approaches become ingrained. Computer Science curricula have traditionally focused on sequential approaches to programming, which were well matched to earlier computer systems. However, current systems almost all use multiprocessor CPUs, and are frequently used in clusters or networks of multiple computers. Recent curricular guidelines from organizations such as ACM and ABET recommend exposure to parallel computing concepts.

关键词： parallel and distributed computing unplugged activities computing education

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：