Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 7,601 papers for “parallel performance comparison”
N. Scaife · 2015
Abstract. This paper presents a practical evaluation and comparison of three state-of-the-art parallel functional languages. The evaluation is based on implementations of three typical symbolic computation programs, with performance measured on a Beowulf-class parallel architecture. ∗This work is primarily supported by the Austrian Academy of Sciences (APART fellowship 624), the Japan
Cited by 0
Hikaru Kitano, Atsushi Nunome, Hiroaki Hirata · 2019
Heapsort algorithm was found many decades ago, but no parallel heapsort algorithm had been presented. In our previous work, we challenged the development of a parallel heapsort algorithm. In this paper we improve our previous algorithm partially and analyze the performance in detail. As a more massive amount of data are sorted, or as more complex comparison is required for sorting, our parallel heapsort algorithm can sort the data more efficiently.
Cited by 2
Tom Thomas · Religion · 1992
Nowadays, the rapid development of the internet calls for a high performance file system, and a lot of efforts have already been devoted to the issue of assigning nonpartitioned files in a parallel file system with the aim of pursuing a prompt response to requests. Yet most of the existing strategies still fail to bring about an optimal performance on system mean response time metrics, and new strategies which can achieve better performance in terms of mean response time become indispensable for parallel file systems. This paper, while addressing the issue of assigning nonpartitioned files in parallel file systems where the file accesses exhibit Poisson arrival rates and fixed service times, presents an on-line file assignment strategy, named prediction-based dynamic file assignment (PDFA), to minimize the mean response time among disks under different workload conditions, and a comparison of the PDFA with the well-known file assignment algorithms, such as HP and SOR. Comprehensive experimental results show that PDFA is able to improve the performance consistently in terms of mean response time among all algorithms for comparison.
Cited by 0
Brandon S. Parker · 2006
Modern high performance computing is dependent on parallel processing systems. Most current benchmarks reveal only the high level computational throughput metrics, which may be sufficient for single processor systems, but can lead to a misrepresentation of true system capability for parallel systems. A new benchmark is therefore proposed. CLUE (Cluster Evaluator) uses a cellular automata algorithm to evaluate the scalability of parallel processing machines. The benchmark also uses algorithmic variations to evaluate individual system components' impact on the overall serial fraction and efficiency. CLUE is not a replacement for other performance-centric benchmarks, but rather shows the scalability of a system and provides metrics to reveal where one can improve overall performance. CLUE is a new benchmark which demonstrates a better comparison among different parallel systems than existing benchmarks and can diagnose where a particular parallel system can be optimized.
Cited by 0Open access
Jürgen Brehm, Patrick H Worley · University of North Texas Digital Library (University of North Texas) · 1997
Today`s massively parallel machines are typically message-passing systems consisting of hundreds or thousands of processors. Implementing parallel applications efficiently in this environment is a challenging task, and poor parallel design decisions can be expensive to correct. Tools and techniques that allow the fast and accurate evaluation of different parallelization strategies would significantly improve the productivity of application developers and increase throughput on parallel architectures. This paper investigates one of the major issues in building tools to compare parallelization strategies: determining what type of performance models of the application code and of the computer system are sufficient for a fast and accurate comparison of different strategies. The paper is built around a case study employing the Performance Prediction Tool (PerPreT) to predict performance of the Parallel Spectral Transform Shallow Water Model code (PSTSWM) on the Intel Paragon. 13 refs., 6 tabs.
Cited by 6Open access
Ming Han, W. Lian, Dong Yang et al. · 2023
This paper puts forward a novel parallel mechanism with multiple driving modes to address the inherent limitations of workspace and singular configurations in single-driven parallel mechanisms. Taking the planar 6R parallel mechanism as an example, we conduct numerical and simulation-based studies to demonstrate the superior kinematic performance of the multi-drive mode parallel mechanism. The analytical process involved initial investigation and characterization of the mechanism, development of prototype, establishment of inverse kinematics model and introduction of local transmission index. Motion/force transmission indices under both single driving mode and multiple driving modes were then compared and analyzed. Drawing on the motion/force transmission index, we identified the good transmission workspace of the mechanism and performed a performance comparison analysis. The results unequivocally demonstrate that engaging the multi-drive mode substantially enhances the parallel mechanism's kinematic performance.
Cited by 0
E. A. Kiselev, V. I. Kiselev, B. M. Shabanov et al. · Lobachevskii Journal of Mathematics · 2020
The paper is devoted to the evaluation of energy efficiency of High Performance Computing systems used in a scientific supercomputer center. The authors propose a method for the comparison of energy efficiency of computing systems based on the power consumption and execution time of parallel programs. The paper presents a software tool that allows to determine the energy consumption profile of a parallel program automatically without changing its source code. The paper also presents the results of power consumption comparison of NAS Parallel Benchmarks (BT, EP, IS, and LU) tests on computing systems with codenames Intel microprocessors Broadwell, Cascade Lake, Knights Landing and Skylake).
Cited by 4
Rui Fan, Hong Xia Xiao · Advanced materials research · 2013
Aim to solve the harmonic problems in microgrid, parallel operation of APFs (active power filter) is studied. With the comparison and study of many strategies about current sharing and parallel operation, a new parallel method and control strategy of APF is proposed in microgrid. And the implementation method of parallel operation and current sharing is studied. Finally, both the simulation and experimental results demonstrates that the method is correct and effective, and the good dynamic performance and compensation effect have been proved.
Cited by 0
Jack Dongarra · 2005
Abstract : The goal of performance modeling is to measure predict, and understand the performance of a computer program or set of programs on a computer system. The applications of performance modeling are numerous, including evaluation of algorithms, optimization of code implementation, parallel library development, and comparison of system architectures, parallel system design, and procurement of new systems. The overall objective of this effort was to survey a number of DoD related applications in an effort to ascertain their needs with respect to determining what metrics exist, what metrics need to be developed.
Cited by 1
A. Chadi Aljundi, Ahmad Chadi, A Jundi et al. · 2003
Interconnection network performance is a key factor when constructing parallel computers. The choice of an interconnection network used in a parallel computer depends on a large number of performance factors which are very often application dependent. We propose a performance evaluation and a comparison methodology. This methodology is applied on a new class of interconnection networks (Over-Sized Delta Network) and on the Omega network, and will be used in future work in order to evaluate the use of multi- stage interconnection networks as an intercommunication medium in today's Symmetric Multiprocessors.
Cited by 0
Jack Dongarra, Piotr Łuszczek · 2006
Abstract : The goal of performance modeling is to measure, predict, and understand the performance of a computer program or set of programs on a computer system. The applications of performance modeling are numerous, including evaluation of algorithms, optimization of code implementations, parallel library development, and comparison of system architectures, parallel system design, and procurement of new systems. The overall objective of this effort was to survey a number of DoD related applications in an effort to ascertain their needs with respect to determining what metrics exist, what metrics need to be developed.
Cited by 0
Lai Wang, Meilin Yu, Matthias K. Gobbert · Maryland Shared Open Access Repository (USMAI Consortium) · 2017
The compact direct flux reconstruction method (CDFR) for conservation laws utilizes techniques from compact finite difference methods to directly approximate spatial derivatives of fluxes within standard elements. The CDFR scheme is a compact high-order method family which can be efficiently parallelized for high performance computing. In the present study, a parallel performance study of the 3rd-order CDFR scheme with a 3rd-order explicit Runge-Kutta scheme is conducted. The inviscid isentropic vortex propagation problem is adopted as a test case. The numerical performance studies have demonstrated that the CDFR method can efficiently solve conservation laws. The parallel performance study shows excellent observed speedup and efficiency. A comparison between different partition approaches of the mesh also demonstrates that optimized communication between processes can improve the parallel performance.
Cited by 0Open access
DING Yue, XU Chuanfu, QIU Haozhong, DAI Weixi, WANG Qingsong, LIN Yongzhen, WANG Zhenghua · SHILAP Revista de lepidopterología · 2023
Heterogeneous parallel architecture is an important technology trend in current high-performance computing.Since various heterogeneous platforms usually support different programming models,the development of cross-platform performance portable heterogeneous parallel application is difficult.SYCL is a single-source cross-platform parallel programming open standard based on C++ language.The current research on SYCL mainly focuses on the performance comparison with other parallel programming models,but there are few researches on the different parallel kernel implementations provided in SYCL and their performance optimization.To address this situation,the open source multi-phase flow simulation software openLBMflow is implemented based on the SYCL programming model for cross-platform heterogeneous parallel simulation.The performance optimization methods of SYCL parallel applications are systematically summarized by comparing the basic parallel version,the fine-grained tuned ND-range parallel version and many-to-one mapping computation to work-items method.The results show that on Intel Xeon Platinum 9242 CPU and NVIDIA Tesla V100 GPU,the basic parallel kernel achieves a speedup of 2.91 on CPU without additional tuning compared to the optimized OpenMP parallel implementation,indicating the out-of-the-box performance advantage of SYCL.Using the basic parallel version as a baseline,the ND-range parallel version achieves up to 1.45x speedup on the CPU and 2.23x speedup on the GPU respectively by changing the work-group size and shape.By changing and optimizing the number and shape of lattices processed per work-item,the many-to-one mapping computation to work-items method achieves up to 1.57x speedup on the CPU and 1.34x speedup on the GPU respectively compared to the basic parallel version.The results show that SYCL parallel applications are more suitable for many-to-one mapping computation to work-items method on the CPU and ND-range parallel kernels on the GPU to improve performance.
Cited by 0Open access
Shedden, Judith M., Schneider, Walter · eScholarship (California Digital Library) · 1991
Given the massively parallel nature of the brain an obvious question is why are so many information proccssing functions serial? In particular, this ftapter addresses the issue of the comparison process. Behavioral data show that in perceptual matching tasks (such as menwry scanning and visual search) performance is systematically affected by stimulus load, in that required processing time increases with each additional comparison item It is arguable whether this indicates a processing system that performs serial comparisons, or a system for which comparisons are done in parallel but reaction time is affected by load because of other system limitations. In this simulation we show that in a modular connectionist system vector transmission is possible in parallel, but the comparison process within a module must be done serially unless accuracy is sacrificed.
Cited by 0Open access
Ming Huo, Shikharesh Majumdar · 2004
This research is concerned with achieving high performance on middleware-based inter-operable distributed object computing systems. This paper reports a preliminary investigation of the impact of using parallel architectures that use concurrent server invocations to improve performance. One of these architectures is observed to lead to a substantial performance improvement in comparison to the conventional sequential interaction architecture.
Cited by 0
Ming Huo, Shikharesh Majumdar · ACM SIGSOFT Software Engineering Notes · 2004
This research is concerned with achieving high performance on middleware-based inter-operable distributed object computing systems. This paper reports a preliminary investigation of the impact of using parallel architectures that use concurrent server invocations to improve performance. One of these architectures is observed to lead to a substantial performance improvement in comparison to the conventional sequential interaction architecture.
Cited by 1
Csaba Andras Moritz · 2007
We study various aspects of cost modeling and its applications for efficient resource utilization and system design in parallel systems. We use performance models for performance comparison between several platforms and communication layers. New performance models are presented capturing various levels of details of communication performance in message-passing and shared memory applications, such as aspects of pipelined communication, costs involved due to resource and network contention, and locality and synchronization aspects. These models are used to predict the performance of parallel message-passing applications and to eliminate performance bottlenecks. The models are applied in a range of different parallel systems including systems supporting synchronized shared memory programming models, distributed memory multiprocessors, clusters of shared memory multiprocessors, network of workstations and single-chip multiprocessors. We also use the cost models in a mapping scheme of impli...
Cited by 0
Avery Ching, Alok Choudhary, Wei-keng Liao et al. · 2008
Abstract — Modern data-intensive structured datasets constantly undergo manipulation and migration through parallel scientific applications. Directly supporting these time consuming operations is an important step in providing high-performance I/O solutions for modern large-scale applications. High-level interfaces such as HDF5 and Parallel netCDF provide convenient APIs for accessing structured datasets, and the MPI-IO interface also supports efficient access to structured data. Parallel file systems do not traditionally support such structured access from these higher level interfaces. In this work we present two contributions. First, we demonstrate an implementation of structured data access support in the context of the Parallel Virtual File System (PVFS). We call this support “datatype I/O ” because of its similarity to MPI datatypes. This support is built by using a reusable datatypeprocessing component from the MPICH2 MPI implementation. The second contribution of this work is a comparison of I/O characteristics when using modern high-performance noncontiguous I/O methods. We use our I/O characteristics comparison to assess the performance of all the noncontiguous I/O methods using three test applications. We also point to further optimizations that could be leveraged for even more efficient operation.
Cited by 0
Yu Zhang, Max Q.‐H. Meng · 2013
This study mainly focuses on comparison of multi-robot task allocation problem and evaluation of corresponding solutions. Auction has been used in the problem widely. Various kinds of auction have been proposed previously. In this paper, we compare three auction-based algorithms applied in the task allocation problem from different aspects. In addition, an incremental variant is adopted in the parallel auction to improve its performance. We also compare the improved auction with the general parallel auction. Simulation results demonstrate that the improved parallel auction achieves better performance on the overall cost and completion time than the general parallel auction. Moreover, we summarize the suitable conditions for the algorithms we mentioned in the paper based on the simulation results.
Cited by 4
B N Chandrashekhar, H. A. Sanjay · 2021 Third International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV) · 2021
The entire world of parallel computing endured a change when accelerators are gradually embraced in today's high-performance computing cluster. A hybrid CPU-GPU cluster is required to speed up the complex computations by using parallel programming paradigms. This paper deals with performance evaluation of sequential, parallel and hybrid programming paradigms on the hybrid CPU-GPU cluster using the sorting strategies such as quick sort, heap sort and merge sort. In this research work performance comparison of C, MPI, and hybrid [MPI+CUDA] on CPU-GPUs hybrid systems are performed by using the sorting strategies. From the analysis it is observed that, the performance of parallel programming paradigm MPI is better when compared against sequential programming model. Also, research work evaluates the performance of CUDA on GPUs and hybrid programming model [MPI+CUDA] on CPU+GPU cluster using merge sort strategies and noticed that hybrid programming model [MPI+CUDA] has better performance against traditional approach and parallel programming paradigms MPI and CUDA When the overall performance of all three programming paradigms are compared, MPI+CUDA based on CPU+GPU environment gives the best speedup.
Cited by 3