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

international symposium on parallel and distributed Processing (IPDPS)

作者： Tahsin Reza Geoffrey Sanders Roger Pearce Lawrence Livermore National Laboratory (LLNL) Center for Applied Scientific Computing (CASC)

Given an edge-weighted graph and a set of known seed vertices of interest, a network scientist often desires to understand the graph relationships to explain connections between the seed vertices. If the size of the seed set is 2, shortest path calculations are an attractive computational kernel to explore the connections between the two vertices. When the seed set is 3 or larger (say up to 1,000s) Steiner minimal tree – min-weight acyclic connected subgraph (of the input graph) that contains all the seed vertices – is an attractive generalization of shortest weighted paths. In general, computing a Steiner minimal tree is NP-hard, but decades ago several polynomial-time algorithms were designed and proven to yield Steiner trees whose total weight is bounded within 2 times the minimal Steiner tree. Despite its rich theoretical literature, works related to parallel Steiner minimal tree computation and their scalable implementations are rather scarce. In this paper, we present a parallel 2-approximation Steiner minimal tree algorithm (with theoretical guarantees) and its MPI-based distributed implementation. In place of distance computation between all pairs of seed vertices, an expensive phase in many approximation algorithms, the solution we employ, exploits Voronoi cell computation. Also, this approach has higher parallel efficiency than others that involve minimum spanning tree computation on the entire graph. Furthermore, our distributed design exploits asynchronous processing and a message prioritization scheme to accelerate convergence of distance computation, employs techniques to avoid inefficient distributed spanning tree computation on the entire graph, and harnesses a combination of vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance of our solution using real-world graphs with up to 128 billion edges and 512 compute nodes (8K processes), show the ability to find Steiner trees with up to 10K seed ver

关键词： Steiner trees distributed processing Scalability Approximation algorithms Computational efficiency Kernel Convergence

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Mapping Polybench Kernels to HPC CGRAs

An Analysis of Mapping Polybench Kernels to HPC CGRAs

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Markus Weinhardt Faculty of Engineering and Computer Science Osnabr&#x00FC ck University of Applied Sciences Germany

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

This paper presents a detailed analysis of Mapping the Polybench C 4.2.1 kernels to Coarse-Grain Reconfigurable Arrays (CGRAs), targeting High-Performance computing (HPC). The results show that the Polybench kernels are well suited for acceleration on a CGRA due to their regular array accesses. However, seperately mapping the innermost loops of the Polybench kernels to a CGRA yields only limited speedups because the small size of the generated dataflow graphs limits the available parallelism and results in a low computational intensity. Therefore, loop transformations which will increase the parallelism and the speedups are suggested. While this work focuses on a specific CGRA and its compiler, the observations and conclusions are also transferable to other CGRAs and their compilers.

关键词： Jacobian matrices Heating systems Finite impulse response filters High performance computing Pipelines Switches parallel processing

来源：评论

学校读者我要写书评

暂无评论

Applying distributed application global states monitoring to speculative query processing in RDBMS 19

Applying distributed application global states monitoring to...

引用

19th international symposium on parallel and distributed computing (ISPDC)

作者： Sasak-Okon, Anna Tudruj, Marek Univ Maria Curie Sklodowska Lublin Poland Polish Acad Sci Inst Comp Sci Polish Japanese Acad Informat Technol Warsaw Poland

ISBN: (纸本)9781728189468

The paper is concerned with the methodology for speculative query execution support in distributed Relational Database Management Systems (RDBMS). The proposed approach is based on the analysis of the multigraph representations of the stream of input queries arriving to a RDBMS. As a result, the optimized set of speculative queries is found to support execution of current queries. The speculative query results are used to speed-up execution of the query input stream. The paper presents how the proposed speculative query execution approach can be implemented inside a novel distributed program design framework PEGASUS DA in which program execution decisions are taken based on the system-supported monitoring of the distributed application global states. The paper shows the architecture of the speculative support provided by such framework for the distributed RDBMS and the assumed speculation approach. The implementation issues of the multi-threaded distributed support based on the RDBMS SQLite engines are discussed. distributed data synchronization and speculative query execution strategy as well as speculation results distribution are discussed. The proposed approach to distributed implementation of the speculative support to RDBMSs using the PEGASUS DA framework is illustrated on the example of the modifying query handling in a RDBMS facing the presented speculative query support for query execution.

关键词： speculative query execution global states monitoring distributed database

来源：评论

学校读者我要写书评

暂无评论

parallel dynamic domain decomposition in space - Time for data assimilation problems

Parallel dynamic domain decomposition in space - Time for da...

引用

2020 international symposium on Automation, Information and computing, ISAIC 2020

作者： D’Amore, L. Cacciapuoti, R. University of Naples "Federico II" Complesso Universitario M. S. Angelo via Cintia Naples80126 Italy

In the present work we employ a load balancing scheme involving an adaptive and dynamic workload redistribution both along Space and Time directions for solving Data Assimilation problems where the observations are non-uniformly distributed, general sparse and its distribution changes during the time. We will consider the Constrained Least Square model (CLS) as prototype of Data Assimilation problems and we will validate the proposed approach on different configurations. Validation is performed using parallel computing Toolbox of MATLABR2013a on high performance hybrid computing architecture. © 2021 Institute of Physics Publishing. All rights reserved.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

Solving the Container Explosion Problem for distributed High Throughput computing 34

Solving the Container Explosion Problem for Distributed High...

引用

34th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Shaffer, Tim Hazekamp, Nicholas Blomer, Jakob Thain, Douglas Univ Notre Dame Notre Dame IN 46556 USA European Lab Particle Phys CERN Geneva Switzerland

ISBN: (纸本)9781728168760

Container technologies are seeing wider use at advanced computing facilities for managing highly complex applications that must execute at multiple sites. However, in a distributed high throughput computing setting, the unrestricted use of containers can result in the container explosion problem. If a new container image is generated for each variation of a job dispatched to a site, shared storage is soon exceeded. On the other hand, if a single large container image is used to meet multiple needs, the size of that container may become a problem for storage and transport. To address this problem, we observe that many containers have an internal structure generated by a structured package manager, and this information could be used to strategically combine and share container images. We develop LANDLORD to exploit this property and evaluate its performance through a combination of simulation studies and empirical measurement of high energy physics applications.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Preface to the special issue on Formal Approaches to parallel and distributed Systems 2018

引用

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING 2020年 116卷

作者： Loulergue, Frederic No Arizona Univ Sch Informat Comp & Cyber Syst Flagstaff AZ 86011 USA Univ Orleans INSA Ctr Val Loire LIFO EA 4022 Orleans France

This special issue contains extended versions of selected papers from the 5th international symposium on Formal Approaches to parallel and distributed Systems (4PAD 2018). The symposium was held in Orleans, France on July 19th, 2020 in conjunction with the 2018 international Conference on High Performance computing & Simulation (HPCS 2018). (C) 2020 Elsevier Inc. All rights reserved.

关键词： distributed systems Synchronous and asynchronous communication Choregraphies CPU-GPU heterogeneous systems parallelism semantics Synthesis

来源：评论

学校读者我要写书评

暂无评论

Litener: An Accelerator-Enabled Lightweight Container for Edge computing

Litener: An Accelerator-Enabled Lightweight Container for Ed...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Ryan Dyson Carlos Reañ o Queen&#x0027 s University Belfast United Kingdom Universitat de Val&#x00E9 ncia Spain

ISBN: (数字)9781665497473

ISBN: (纸本)9781665497480

Containers supporting accelerators, such as Docker, include management tasks that require a significant amount of computing resources. While these resources are available in the Cloud, in other scenarios such as the Edge resources are more limited. An accelerator-enabled lightweight container would be desirable in such scenarios. In this paper, we analyse platforms to containerise applications using accelerators, including but not limited to Docker. After this analysis, we present a lightweight container, referred to as Litener, focused on using accelerators in scenarios with limited resources. Although the focus is on accelerators, many of the optimisations described can also be applied to scenarios that do not use accelerators. Experiments show a speedup of up to 7.78X when compared to other platforms.

关键词： Conferences Containers Task analysis Optimization Edge computing

来源：评论

学校读者我要写书评

暂无评论

Generating Minimal Nondeterministic Finite Automata Using a parallel Algorithm 19

Generating Minimal Nondeterministic Finite Automata Using a ...

引用

19th international symposium on parallel and distributed computing (ISPDC)

作者： Jastrzab, Tomasz Czech, Zbigniew J. Wieczorek, Wojciech Silesian Tech Univ Dept Algorithm & Software Gliwice Poland Silesia Univ Katowice Fac Sci & Technol Katowice Poland

ISBN: (纸本)9781728189468

The goal of this paper is to develop a parallel algorithm that, on input of a learning sample, identifies a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative examples. Given a sample, a minimal NFA or the range of possible sizes of such an NFA, that represents the target regular language is sought. We define the task of finding an NFA, which accepts all positive examples and rejects all negative ones, as a constraint satisfaction problem, and then propose a parallel algorithm to solve the problem. The results of computational experiments on the variety of test samples are reported.

关键词： parallel algorithm learning regular languages using nondeterministic finite automata constraint satisfaction and satisfiability problems grammatical inference

来源：评论

学校读者我要写书评

暂无评论

Load Balancing Run-Times and Space Usage for computing the Power Set 34

Load Balancing Run-Times and Space Usage for Computing the P...

引用

34th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Goodwin, Roger L. Frontiernet Dot Net Summit Point WV 25446 USA

ISBN: (纸本)9781728174457

This paper discusses load balancing the number of sets on multiple processors to compute the power set. The algorithm complexity measures (e.g. run-time and space usage) are merely functions of the load balance. This paper presents two approaches to computing the power set in a parallel environment. Both approaches use different round robin load balancing algorithms. Because of the load balance assignments, both approaches have different production algorithms for computing the power set. This paper covers both the run-time analyses and the space usage analyses of the parallel algorithms. We present mathematical formulas for the space usage analyses. We present a third, non-parallel algorithm for benchmark purposes. The purpose of the algorithm is to give the total amount of space needed to save the power set. The non-parallel algorithm also gives some idea of the maximum run-time an algorithm should take to find any of the sub-sets to the power set on any given processor in a parallel environment.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

TianheStar: Orchestrating SSSP Applications on Tianhe Supercomputer

TianheStar: Orchestrating SSSP Applications on Tianhe Superc...

引用

IEEE/ACM international symposium on Cluster computing and the Grid (CCGRID)

作者： Xinbiao Gan Qian Tang Feng Xiong Shijie Li Bo Yang Tiejun Li School of Computer National University of Defense Technology

ISBN: (数字)9798350395662

ISBN: (纸本)9798350395679

computing single-source shortest paths (SSSP) is one of the fundamental problems in graph theory and is also essential for data-intensive applications. As the potential of artificial intelligence (AI) continues to be explored, and with the advent of exascale supercomputing, there is a growing need for an extremely fast graph engine for SSSP applications. Current distributed SSSP engines for large-scale graph applications, unfortunately, often exhibit poor efficiency when running on supercomputers. In this paper, we introduce TianheStar, an ultra-fast SSSP engine designed specifically for graph search on the Tianhe supercomputer. TianheStar effectively minimizes communication costs and establishes a new balance between computation and communication. The key idea of TianheStar is to leverage network topology information for performing topology-aware message aggregation and architecture-aware group communication. These two techniques effectively reduce the number of messages and the average number of communication hops, respectively. We validate TianheStar using Graph500, a widely adopted benchmark for graph search on supercomputers. Extensive evaluation demonstrates that, compared to the state-of-the-art solutions, TianheStar achieves a remarkable performance improvement. We have deployed TianheStar on the latest Tianhe supercomputer and secured the top position in the latest Graph500. We achieved an outstanding performance of 23,021 GTEPS (Giga Traversed Edges Per Second) for SSSP using 4096 nodes. Furthermore, we have delved into real-world graphs representing the USA road networks and conducted computations to determine the shortest paths between vertices. Our experimental results demonstrate that TianheStar can traverse the USA road network, comprising over 58,333,344 edges, in less than 0.1 second on the Tianhe supercomputer. This performance represents a speedup of over a thousand times compared to parallel shortest-path graph computations on the Aziz supercompu

关键词： Cloud computing Costs Network topology Roads High performance computing Benchmark testing Supercomputers Graph theory Artificial intelligence Engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：