Skip to content
Free planNo credit card requiredStart writing

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “parallel performance analysis”

Zarras A, ArrayTracer : A Parallel Performance Analysis Tool

Titos Saridakis, Christos Nikolaou, Maria Karavassili et al. · 1996

ArrayTracer is a high−level, low−overhead performance analysis tool for parallel applications. It provides the selective tracing facilities at a user−defined grain. The tracing technique used is program instrumentation. Instrumentation code is inserted at source code level during a source−to−source translation. The tool allows tracing of application’s high−level concepts (e.g. program variables, subroutine calls, interprocess communication events, etc.) rather than tracing of low−level events (e.g. memory location accesses, disk accesses, network accesses, etc.). ArrayTracer is heavily based on compile− time information and attempts to off−load the execution time tracing overhead by extracting as much information as possible during the static analysis of application’s source code. The tool’s operations are divided into five stages: user interaction to determine trace parameters, instrumentation of source code during the compilation phase, collection of traces, processing of traces and analysis of the application’s behavior, and presentation of the analysis results. In this report we focus on the first three stages, and present an encouraging preliminary performance evaluation.

Cited by 0

Performance analysis of a reconfigurable redundant parallel manipulator

Angelo Vertuan, Giovanni Legnani, Riccardo Adamini et al. · Institutional Research Information System (Università degli Studi di Brescia) · 2009

This work discusses the kinetostatic performances of a new reconfigurable parallel-serial hybrid manipulator with redundant actuators carrying a serial wrist with 3 degrees of freedom (dof). The parallel part can be easily reconfigured with a simple disassembly and reassembly procedure to obtain different configurations that can be classified in the following groups: 3 dof, 4 dof and 3 dof with redundant actuation. The paper focuses on the kinematics of the parallel structure solving the direct and the inverse kinematics, analyzing the singularities and evaluating some kinetostatic performance indices.

Cited by 5Open access

Performance analysis of parallel beam XY compliant mechanism

Sandesh Solepatil, Narendra Deore · AIP conference proceedings · 2024

In today's quick-paced and fiercely competitive industry, engineering applications are assessed on accuracy and precision. In compliant mechanisms, beam deflection is employed to meet the growing need for precision motion. A sort of mechanism known as a "compliant mechanism" allows for enhanced precision without necessarily lowering accuracy because it is depend on the rigidity mobility and of a component. Molecular deformation and beam bending in the elastic zone are used to create motion. Precision scanning, microscopes, and biological scanners are common uses for compliant mechanisms.

Cited by 0Open access

Performance Analysis of Large Scale Parallel Matrix Multiplication

智 尚 · Software Engineering and Applications · 2013

随着科学研究和工程计算的发展,大规模计算和模拟已经无法避免。这些大规模计算往往涉及海量数据的运算和处理,因此并行计算被用来一方面解决大规模的快速计算,另一方面解决海量数据的处理。基于MPI的并行计算可以方便地进行分布式运算,把海量数据分散在集群超级计算机上,使得每单个处理器(CPU)处理一小部分数据,从而实现快速运算和大规模计算。本文基于MPI的并行编程,实现了大规模矩阵的相乘运算,并且测试了点对点通信下的不通信机制(阻塞通信、非阻塞通信及其混合通信)的标准通信的并行性能。针对大型矩阵相乘计算,组建了完整的快速标准通信方法,并且防止死锁的发生。为今后的进一步实际应用奠定基础,提供有用的参考。 The large scale computing is difficult to be avoided following the requirement of modern scientific re- searches and practical engineering applications. The computing and processing of massive data have to be involved in these large scale computing. The parallel computing therefore is employed to solve these issues of large scale comput- ing not only on fast computing but also on data processing. MPI-based parallel computing can easily realize distributed computing and massive data scattered in the cluster supercomputer, making each a single processor to handle a small portion of data in order to achieve fast computing and large scale computing. Based on MPI parallel programming a large-scale matrix multiplication operation was developed. Through the testes on the parallel performance of the point to point communications with the blocking communication, non-blocking communication and mixed communication, a complete set of rapid communication to prevent the occurrence of deadlock was established. The results were significant for the future practical applications.

Cited by 1Open access

Holistic Hardware Counter Performance Analysis of Parallel Programs

Brian J. N. Wylie, Bernd Mohr, Felix Wolf · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2006

The KOJAK toolkit has been augmented with refined hardware performance counter support, including more convenient measurement specification, additional metric derivations and hierarchical structuring, and an extended algebra for integrating multiple experiments. Comprehensive automated analysis of a hybrid OpenMP/MPI parallel program, the ASC Purple sPPM benchmark, is demonstrated with performance experiments on equisized POWER4-II-based IBM Regatta p690+ cluster, Opteron-based Cray XD1 cluster and UltraSPARC-IV-based Sun Fire E25000 systems. Automatically assessed communication and synchronisation performance properties, combined with a rich set of measured and derived counter metrics, provide a holistic analysis context and facilitate multi-platform comparison.

Cited by 12Open access

Enhancing Parallel Programming Education with High-Performance Clusters Utilizing Performance Analysis

Roth, Anna-Lena, James, David, Kuhn, Michael et al. · Gesellschaft für Informatik (GI) · 2024

The use of high-performance clusters in parallel programming education is not trivial. Not only working on a cluster can be a challenge. Using clusters requires the development of complex parallel programs that are executed with many processes. This increases the necessity for performance analysis to determine bottlenecks, identify optimization opportunities, and evaluate scalability. For learners, performance analysis is a crucial aspect of understanding parallel programs and systems. However, due to its complexity and the prior knowledge required, learners are often overwhelmed by the analysis and interpretation of performance metrics. We conducted a usability test to identify barriers and issues of using a high-performance cluster in parallel programming education in conjunction with professional performance analysis using the tools Score-P, Scalasca, and Cube. At the same time, we tested EduMPI, a novel learning support tool that simplifies the process of executing parallel programs and automates performance analysis at runtime.

Cited by 0Open access

High performance remote sensing data analysis using parallel computation

Jean E. Patterson, R. Ferraro, Lawrence Sparks · 1990

This paper examines the JPL/Caltech parallel processing system designed for rapid processing and transfer of large quantities of data from remote sensing instruments flown on NASA missions. Two remote sensing analysis applications that use this processing system are described: (1) an analysis system for retrieval of atmospheric parameters (such as species abundance, atmospheric temperature, and water vapor profiles) from data obtained by a Fourier transform IR spectrometer and (2) a prototype airborne SAR processing system. It is shown that a parallel processing system such as the JPL/Caltech system can offer supercomputer computational capability and high-volume data throughput and still be cost-effective.

Cited by 0

Performance analysis issues for parallel implementations of propagation algorithm

Léonardo Brenner, Luiz Gustavo Fernandes, Paulo Fernandes et al. · 2004

We present a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an image interpolation application. The theoretical performance analysis is based on the construction of generic models using stochastic automata networks (SAN) formalism to describe each implementation scheme. The prediction results can be compared to the achieved performance in some real test cases to verify the accuracy of our modeling technique. The main contribution is to point out the advantages and problems of our approach to the development of generic models of parallel implementations.

Cited by 3

Kinematic dexterity performance analysis of a parallel robot manipulator

Haiqiang Zhang, Huanzhi Yuan, Changtao Yan et al. · International Conference on Intelligent Equipment and Special Robots (ICIESR 2021) · 2021

In this paper, a three-degree of freedom (DOF) parallel robot is introduced, which can process high-speed difficult and high-precision components in aerospace and automotive engineering. An appropriate reference system is established and the model of the equipment is designed. The kinematics of the mechanism is analyzed, and the complete Jacobian matrix of the mechanism is established by position inverse solution and D-H method. Using the condition number and manipulability as indexes, the dexterity index and the optimum workspace of the parallel robot are evaluated. According to the obtained results, the distribution maps of performance indexes of 3-PUS-UP parallel robot mechanism within workspace are drawn by Matlab software. The research results illustrate that the proposed parallel manipulator has good kinematic dexterity and thus a suitable candidate for five-axis machining.

Cited by 0

Supporting Scalable Performance Monitoring and Analysis of Parallel Programs

Kei-Chun Li, Kang Zhang, Kang Zhang Fdanielli · 1999

. Tools for performance monitoring and analysis become indispensable parts of programming environments for parallel computers. As the number of processors increases, the conventional techniques for monitoring the performance of parallel programs will produce large amounts of data in the form of event trace files. On the other hand, this wealth of information is a problem for the programmer who is forced to navigate through it, and for the tools that must store and process it. What makes this situation worse is that most of the time, a large amount of the data are irrelevant to understanding the performance of an application. In this paper, we present a new approach for collecting performance data. By tracing all the events but storing only the statistics of the performance, our approach can provide accurate and useful performance information yet require far less data to be stored. In addition, this approach also supports real-time performance monitoring. Keywords: performance monitori...

Cited by 0