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

International Conference on Advanced Information Networking and Applications (AINA)

作者： Chao-Tung Yang Kuan-Wei Cheng Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance.

关键词： Processor scheduling Dynamic scheduling Load management Master-slave Concurrent computing Distributed computing Clustering algorithms Runtime computer science Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

On implementation of an enhanced and integrated parallel programming Web-based toolkit

On implementation of an enhanced and integrated parallel pro...

引用

International Conference on Information Technology: Research and Education (ITRE)

作者： Kuan-Ching Li Chao-Tung Yang Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan High Performance Computing Laboratory Department of Computer Science and Infnmation Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0780389328

The computing power provided by high performance and low cost PC-based clusters and grid computing platforms are attractive and they are equal or superior to supercomputers and mainframes. In parallel, discussions on how to obtain more computing power from these computing platforms become an interesting issue. The development of applications for these high-performance computing platforms is complicated for several reasons: the complexity of applications themselves, which combines aspects of super computing and distributed computing, and by the need to achieve higher performance. This paper describes the design rationale and implementation of a parallel programming Web-based toolkit, to ease the parallel programming learning process, with the use of Web-based interface. The toolkit has widely been used in MPI parallel programming courses (both in graduate and undergraduate levels) and industry trainings.

关键词： parallel programming Concurrent computing Application software Distributed computing Grid computing High performance computing Visualization computer science Supercomputers Industrial training

来源：评论

学校读者我要写书评

暂无评论

Towards Electronic Structure-Based Ab-Initio Molecular Dynamics Simulations with Hundreds of Millions of Atoms

arXiv

引用

arXiv 2021年

作者： Schade, Robert Kenter, Tobias Elgabarty, Hossam Lass, Michael Schütt, Ole Lazzaro, Alfio Pabst, Hans Mohr, Stephan Hutter, Jürg Kühne, Thomas D. Plessl, Christian Paderborn Center for Parallel Computing Paderborn University Warburger Str. 100 Paderborn33098 Germany Department of Computer Science Paderborn University Warburger Str. 100 Paderborn33098 Germany Department of Chemistry Paderborn University Warburger Str. 100 Paderborn33098 Germany Department of Materials ETH Zürich ZürichCH-8092 Switzerland HPE Switzerland GmbH Basel Switzerland Intel Extreme Computing Software and Systems Zürich Switzerland Barcelona Spain University of Zurich Switzerland Department of Chemistry University of Zurich Switzerland

We push the boundaries of electronic structure-based ab-initio molecular dynamics (AIMD) beyond 100 million atoms. This scale is otherwise barely reachable with classical force-field methods or novel neural network and machine learning potentials. We achieve this breakthrough by combining innovations in linear-scaling AIMD, efficient and approximate sparse linear algebra, low and mixed-precision floating-point computation on GPUs, and a compensation scheme for the errors introduced by numerical approximations. The core of our work is the non-orthogonalized local submatrix method (NOLSM), which scales very favorably to massively parallel computing systems and translates large sparse matrix operations into highly parallel, dense matrix operations that are ideally suited to hardware accelerators. We demonstrate that the NOLSM method, which is at the center point of each AIMD step, is able to achieve a sustained performance of 324 PFLOP/s in mixed FP16/FP32 precision corresponding to an efficiency of 67.7% when running on 1536 NVIDIA A100 GPUs. Copyright © 2021, The Authors. All rights reserved.

关键词： Electronic structure

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing environments

Decision tree construction for data mining on grid computing...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Chao-Tung Yang Shu-Tzu Tsai Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of data mining applied in the grid environment as well as user equivalent perspective, grid roles can be categorized into three types. It was aimed, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill the architecture, an existing parallel decision tree algorithm was first applied (the SPRINT algorithm) to the grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.

关键词： Decision trees Data mining Grid computing computer architecture Clustering algorithms Concurrent computing Distributed computing computer science Application software Chaos

来源：评论

学校读者我要写书评

暂无评论

The anatomy of a course in cluster and grid computing

The anatomy of a course in cluster and grid computing

引用

International Conference on Information Technology: Research and Education (ITRE)

作者： Chao-Tung Yang Kuan-Ching Li High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0780389328

Cluster and grid computing is a relatively new interdisciplinary field, where computer science, engineering and computational biology are its core supporting disciplines. The rise of cluster and grid computing discipline brings to computer science faculty members new opportunities and challenges, both in education and in research. In this paper, we explore issues in teaching cluster and grid computing, the developing of curricula, and thoughts to foster student to work on research projects in cluster and grid computing.

关键词： Anatomy Grid computing Distributed computing Concurrent computing computer networks Brain modeling Predictive models computer science Education Space technology

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for force directed scheduling of flattened and hierarchical signal flow graphs

Parallel algorithms for force directed scheduling of flatten...

引用

IEEE International Conference on computer Design: VLSI in computers and Processors, (ICCD)

作者： P. Prabhakaran P. Banerjee Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana IL USA Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

In this paper we present some novel algorithms for scheduling hierarchical signal flow graphs in the domain of high-level synthesis. There are several key contributions of this paper. First, we develop a novel extension of the force directed scheduling problem which naturally handles loops and conditionals by coming up with a scheme of scheduling hierarchical signal flow graphs. Second, we develop three new parallel algorithms for the scheduling problem. Third, our parallel algorithms are portable across a wide range of parallel platforms. We report results on a set of high-level synthesis benchmarks on 8-processor SGI Challenge and a network of 4 SUN SPARCstation5 work stations. Finally, while some parallel algorithms for VLSI CAD reported by earlier researchers have reported a loss of qualities of results, our parallel algorithms produce exactly the same results as the sequential algorithms on which they are based.

关键词： parallel algorithms Flow graphs Processor scheduling Concurrent computing Scheduling algorithm Contracts Cost function Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Data management for large-scale scientific computations in high performance distributed systems

Data management for large-scale scientific computations in h...

引用

International Symposium on High Performance Distributed computing

作者： A. Choudhary M. Kandemir H. Nagesh J. No X. Shen V. Taylor S. More R. Thakur Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

With the increasing number of scientific applications manipulating huge amounts of data, effective data management is an increasingly important problem. Unfortunately, so far the solutions to this data management problem either require deep understanding of specific storage architectures and file layouts (as in high-performance file systems) or produce unsatisfactory I/O performance in exchange for ease-of-use and portability (as in relational DBMSs). In this paper we present a new environment which is built around an active meta-data management system (MDMS). The key components of our three-tiered architecture are user application, the MDMS, and a hierarchical storage system (HSS). Our environment overcomes the performance problems of pure database-oriented solutions, while maintaining their advantages in terms of ease-of-use and portability. The high levels of performance are achieved by the MDMS, with the aid of user-specified directives. Our environment supports a simple, easy-to-use yet powerful user interface, leaving the task of choosing appropriate I/O techniques to the MDMS. We discuss the importance of an active MDMS and show how the three components, namely application, the MDMS, and the HSS, fit together. We also report performance numbers from our initial implementation and illustrate that significant improvements are made possible without undue programming effort.

关键词： Large-scale systems Distributed computing High performance computing Data visualization Engineering management Concurrent computing Relational databases Art Data analysis Image analysis

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for simultaneous scheduling, binding and floorplanning in high-level synthesis

Parallel algorithms for simultaneous scheduling, binding and...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： P. Prabhakaran P. Banerjee Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign IL USA Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

With small device features in submicron technologies, interconnection delays play a dominant part in cycle time. Hence, it is important to consider the impact of physical design during high level synthesis. In comparison to a traditional approach which separates high-level synthesis from physical design, an algorithm which is able to make these stages interact very closely, would result in solutions with lower latency and area. However, such an approach could result in increased runtimes. parallel processing is an attractive way of reducing the runtimes. In this paper, two parallel algorithms for simultaneous scheduling, binding and floorplanning algorithm are presented. A detailed hardware model is considered, taking into account multiplexor and register areas and delays. Experimental results are reported on an IBM SP-2 multicomputer, with close to linear speedups for a set of benchmark circuits.

关键词： parallel algorithms High level synthesis Runtime Integrated circuit interconnections Delay effects Algorithm design and analysis parallel processing Scheduling algorithm Hardware Registers

来源：评论

学校读者我要写书评

暂无评论

Outlier detection in performance data of parallel applications

Outlier detection in performance data of parallel applicatio...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： Katharina Benkert Edgar Gabriel Michael M. Resch Parallel Software Technologies Laboratory Department of Computer Science University of Houston Houston TX USA High Performance Computing Center Stuttgart (HLRS) Stuttgart Germany

When an adaptive software component is employed to select the best-performing implementation for a communication operation at runtime, the correctness of the decision taken strongly depends on detecting and removing outliers in the data used for the comparison. This automatic decision is greatly complicated by the fact that the types and quantities of outliers depend on the network interconnect and the nodes assigned to the job by the batch scheduler. This paper evaluates four different statistical methods used for handling outliers, namely a standard interquartile range method, a heuristic derived from the trimmed mean value, cluster analysis and a method using robust statistics. Using performance data from the Abstract Data and Communication Library (ADCL) we evaluate the correctness of the decisions made with each statistical approach over three fundamentally different network interconnects, namely a highly reliable InfiniBand network, a gigabit Ethernet network having a larger variance in the performance, and a hierarchical gigabit Ethernet network.

关键词： Application software Switches Runtime Ethernet networks Software performance High performance computing Context Telecommunication network reliability Statistical analysis Software libraries

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the timestamps of concurrent events in traces of hybrid MPI/OpenMP applications

Synchronizing the timestamps of concurrent events in traces ...

引用

作者： Becker, Daniel Geimer, Markus Rabenseifner, Rolf Wolf, Felix German Research School for Simulation Sciences Laboratory for Parallel Programming 52062 Aachen Germany RWTH Aachen University Department of Computer Science 52056 Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre 52428 Jülich Germany University of Stuttgart High Performance Computing-Center 70550 Stuttgart Germany

ISBN: (纸本)9780769542201

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the indepth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：