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

SCALING parallel programs FOR MULTIPROCESSORS - METHODOLOGY AND EXAMPLES

COMPUTER 1993年第7期26卷 42-50页

作者： SINGH, JP HENNESSY, JL GUPTA, A Comput. Syst. Lab. Stanford Univ. CA

To design effective large-scale multiprocessors, computer architects need to understand how parallel applications will be scaled to use these machines. Previous studies of scaling have defined useful models for the constraints under which parallel applications might be scaled, but they do not show how applications might actually be scaled to meet these constraints. Typically, data set size is the only parameter scaled. The authors argue that scaling real applications is more complicated. In scientific applications that simulate physical phenomena, for example, a scientist will want to scale other application parameters in conjunction with the data set size to obtain useful results. Realistic scaling methods for these applications are usually based on the contributions that different application parameters make to the error in the simulation. This article uses the widely applicable principle of scaling parameters so that their error contributions are about equal. Through examples, the authors show that scaling in realistic ways can lead to different conclusions about the effectiveness and design of larger multiprocessors. The authors also conclude that system designers must understand the relevant characteristics of the benchmark applications they use if they are to arrive at correct design decisions for building large multiprocessor systems.

关键词： Barnes-Hut hierarchical N-body method N-body problems astrophysics computing constant problem-size scaling digital simulation galaxies galaxies large multiprocessors memory-constrained scaling multiprocessors parallel programming parallel programs simulation time-constrained scaling

来源：评论

学校读者我要写书评

暂无评论

Efficient Auto-Tuning of parallel programs with Interdependent Tuning Parameters via Auto-Tuning Framework (ATF)

引用

ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION 2021年第1期18卷 1–26页

作者： Rasch, Ari Schulze, Richard Steuwer, Michel Gorlatch, Sergei Univ Munster Munster Germany Univ Edinburgh Edinburgh Midlothian Scotland

Auto-tuning is a popular approach to program optimization: it automatically finds good configurations of a program's so-called tuning parameters whose values are crucial for achieving high performance for a particular parallel architecture and characteristics of input/output data. We present three new contributions of the Auto-Tuning Framework (ATF), which enable a key advantage in general-purpose auto-tuning: efficiently optimizing programs whose tuning parameters have interdependencies among them. We make the following contributions to the three main phases of general-purpose auto-tuning: (1) ATF generates the search space of interdependent tuning parameters with high performance by efficiently exploiting parameter constraints;(2) ATF stores such search spaces efficiently in memory, based on a novel chain-of-trees search space structure;(3) ATF explores these search spaces faster, by employing a multi-dimensional search strategy on its chainof-trees search space representation. Our experiments demonstrate that, compared to the state-of-the-art, general-purpose auto-tuning frameworks, ATF substantially improves generating, storing, and exploring the search space of interdependent tuning parameters, thereby enabling an efficient overall auto-tuning process for important applications from popular domains, including stencil computations, linear algebra routines, quantum chemistry computations, and data mining algorithms.

关键词： Auto-tuning parallel programs interdependent tuning parameters

来源：评论

学校读者我要写书评

暂无评论

Effectively utilizing global cluster memory for large data-intensive parallel programs

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2006年第1期17卷 66-77页

作者： Oleszkiewicz, J Xiao, L Liu, Y Smiths Aerosp Grand Rapids MI 49512 USA Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA Hong Kong Univ Sci & Technol Dept Comp Sci Kowloon Hong Kong Peoples R China

Large scientific parallel applications demand large amounts of memory space. Current parallel computing platforms schedule jobs without fully knowing their memory requirements. This leads to uneven memory allocation in which some nodes are overloaded. This, in turn, leads to disk paging, which is extremely expensive in the context of scientific parallel computing. To solve this problem, we propose a new peer-to-peer solution called parallel Network RAM. This approach avoids the use of disk, better utilizes available RAM resources, and will allow larger problems to be solved while reducing the computational, communication, and synchronization overhead typically involved in parallel applications. We proposed several different parallel Network RAM designs and evaluated the performance of each under different conditions. We discovered that different designs are appropriate in different situations.

关键词： parallel programs peer-to-peer cluster network RAM scheduling simulation

来源：评论

学校读者我要写书评

暂无评论

parallel programs and background load. Efficiency studies with the PAR-bench system 91

Parallel programs and background load. Efficiency studies wi...

引用

5th ACM International Conference on Supercomputing

作者： Nagel, Wolfgang E. Linn, Markus A. Zentralinstitut für Angewandte Mathematik Forschungszentrum Jülich GmbH (KFA) Postfach 1913 5170 Jülich Fed. Rep. Germany

ISBN: (纸本)0897914341

Today most of the multiprocessor supercomputer systems are still used within a multiprogramming environment, where the individual processors execute different jobs which are totally independent. All programs compete for the available resources. With multitasking, processors may also execute different parts of one program in parallel. The behaviour of parallel programs within a multiprogramming environment and the influence of these programs on the overall workload is of great interest for the rating of multitasking concepts with respect to their efficiency in practice. While the efficiency of multitasking is proved for parallel programs running in a dedicated environment, this paper leads to a new approach for the assessment of multitasking. It shortly describes the benchmark generation environment PAR-Bench, which is implemented on a Cray Y-MP under the UNICOS operating system;based on full information about system activities, this system enables reasonable measurements of parallel programs in a multiprogramming mode. Additionally, a few typical results obtained from first measurements are summarized. © 1991 ACM.

关键词： Autotasking Cray Y-MP Hardware performance monitor parallel programs Performance visualization Portable supercomputer benchmark UNICOS

来源：评论

学校读者我要写书评

暂无评论

Detection of High-Level Synchronization Anomalies in parallel programs

引用

INTERNATIONAL JOURNAL OF parallel PROGRAMMING 2015年第4期43卷 656-678页

作者： Jannesari, Ali German Res Sch Simulat Sci Aachen Germany Rhein Westfal TH Aachen Aachen Germany

In parallel programs concurrency bugs are often caused by unsynchronized accesses to shared memory locations, which are called data races. In order to support programmers in writing correct parallel programs, it is therefore highly desired to have tools on hand that automatically detect such data races. Today, most of these tools only consider unsynchronized read and write operations on a single memory location. Concurrency bugs that involve multiple accesses on a set of correlated variables may be completely missed. Tools may overwhelm programmers with data races on various memory locations, without noticing that the locations are correlated. In this paper, we propose a novel approach to data race detection that automatically infers sets of correlated variables and logical operations by analyzing data and control dependencies. We develop an algorithm that is inspired by lockset analysis and combine it with happens-before analysis to provide the first hybrid, dynamic race detector for correlated variables. We implemented our approach on top of the Valgrind, a framework for dynamic binary instrumentation. Our evaluation confirmed that we can catch data races missed by existing detectors and provide additional information for effective bug fixing.

关键词： Data race detection parallel programs Dynamic analysis Correlated variables High-level data races

来源：评论

学校读者我要写书评

暂无评论

Using Ontologies and Algebra of Algorithms for Formalized Development of parallel programs

引用

FUNDAMENTA INFORMATICAE 2009年第1-3期93卷 111-125页

作者： Doroshenko, Anatoliy Yatsenko, Olena Natl Acad Sci Ukraine Inst Software Syst UA-03187 Kiev Ukraine

An approach to formalized development of parallel programs using ontologies and algebraalgorithmic facilities is proposed. Ontology gives opportunity to describe the skeleton of the program representing main objects in the given subject domain, i.e. data, functions to process data and relations between functions. Once the skeleton of the program has been built, further development can be done in automated manner with the Integrated toolkit for Design and Synthesis (IDS) developed by the authors, which is based on using algorithmic algebras facilities. The application of the approach is illustrated with an example of developing parallel MPI program in the subject domain of sorting algorithms.

关键词： ontology algebra of algorithms designing and synthesis of programs parallel programs

来源：评论

学校读者我要写书评

暂无评论

Detecting race conditions in parallel programs that use semaphores

引用

ALGORITHMICA 2003年第4期35卷 321-345页

作者： Klein, PN Lu, HI Netzer, RHB Brown Univ Dept Comp Sci Providence RI 02912 USA Acad Sinica Inst Informat Sci Taipei 115 Taiwan

We address the problem of detecting race conditions in programs that use semaphores for synchronization. Netzer and Miller showed that it is NP-complete to detect race conditions in programs that use many semaphores. We show in this paper that it remains NP-complete even if only two semaphores are used in the parallel programs. For the tractable case, i.e., using only one semaphore, we give two algorithms for detecting race conditions from the trace of executing a parallel program on p processors, where n semaphore operations are executed. The first algorithm determines in 0 (n) time whether a race condition exists between any two given operations. The second algorithm runs in 0 (np log n) time and outputs a compact representation from which one can determine in 0(l) time whether a race condition exists between any two given operations. The second algorithm is near-optimal in that the running time is only 0 (log n) times the time required simply to write down the output.

关键词： race conditions parallel programs semaphores tractability scheduling

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE VISUALIZATION FOR parallel programs

引用

THEORETICA CHIMICA ACTA 1993年第4-5期84卷 377-384页

作者： LUSK, E Argonne National Laboratory

We describe here a set of graphical performance visualization tools that have been developed at Argonne National Laboratory for increasing one's understanding of the behavior of parallel programs.

关键词： parallel programs GRAPHICAL PERFORMANCE VISUALIZATION

来源：评论

学校读者我要写书评

暂无评论

Performance-energy adaptation of parallel programs in pervasive computing

引用

JOURNAL OF SUPERCOMPUTING 2014年第3期70卷 1260-1278页

作者： Zhu, Liang Jin, Hai Liao, Xiaofei Yue, Jianhui Huazhong Univ Sci & Technol Sch Comp Sci & Technol Cluster & Grid Comp Lab Serv Comp Technol & Syst Lab Wuhan 430074 Peoples R China Univ Maine Orono ME 04469 USA

It is meaningful to use a little energy to obtain more performance improvement compared with the increased energy. It also makes sense to relax a small quantity of performance restriction to save an enormous amount of energy. Trading a small amount of energy for a considerable sum of performance or vice versa is possible if the relativities between performance and energy of parallel programs are exactly known. This work studies the relativities by recording the performance speedup and energy consumption of parallel programs when the number of cores on which programs run are changed. We demonstrate that the performance improvement and the increased energy consumption have a linear negative *** addition, these relativities can guide us to do performance-energy adaptation under two assumptions. Our experiments show that the average correlation coefficients between performance and energy are higher than 97 %. Furthermore, it can be found that exchanging less than 6 % performance loss for more than 37 % energy consumption is feasible and vise versa.

关键词： Multi/many-core processors parallel programs Scalability Energy consumption

来源：评论

学校读者我要写书评

暂无评论

BENCHMARKING parallel programs IN A MULTIPROGRAMMING ENVIRONMENT - THE PAR-BENCH SYSTEM

引用

parallel COMPUTING 1991年第10-11期17卷 1303-1321页

作者： NAGEL, WE LINN, MA Zentralinstitut für Angewandte Mathematik Forschungszentrum Jülich GmbH (KFA) Postfach 1913 5170 Jülich Germany

While the efficiency of multitasking is proven for parallel programs running in a dedicated environment, this paper wants to show a new approach for the assessment of multitasking. It describes the benchmark generation environment PAR-Bench, which enables measurements of effects introduced by parallel programs running in a multiprogramming mode. The PAR-Bench system is implemented on Cray multiprocessor systems under the operating systems COS and UNICOS. Using PAR-Bench, the benchmark process is divided into two parts: In a first step, according to user-supplied parameters like MFLOPS rate, memory and I/O activities, CPU time etc., the PAR-Bench system generates synthetic benchmark programs by using the hardware performance monitor HPM. These programs can be used to simulate a given site's workload in a flexible way. In a second step, the system can be used to run this workload several times with varied parameters;the substantial work to be done is fixed, nevertheless dynamical changes of program parameters like memory size, priority, and also variations of the degree of parallelism are supported. The PAR-Bench system provides information about mutual influences of parallel programs and background load, enabling us to evaluate different multitasking implementations, different operating systems, and different computer hardware. Because of the abundance of data concerning characteristic program parameters and program timings, as a further component of PAR-Bench the graphical analyzing system GRANSYS was developed, realizing automatic analysis features for benchmark data including data interpretation and visualization.

关键词： SUPERCOMPUTER BENCHMARK HARDWARE PERFORMANCE MONITOR CRAY Y-MP parallel programs AUTOTASKING UNICOS PERFORMANCE VISUALIZATION

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：