Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

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 7,601 papers for “parallel performance comparison”

Performance Comparison of Serial and Parallel Multipliers in Massively Parallel Environment

Shilpa Mayannavar, Uday Wali · 2018 International Conference on Electrical, Electronics, Communication, Computer, and Optimization Techniques (ICEECCOT) · 2018

Computational environment of Deep Learning Neural Networks (DLNNs) is considerably different than that of Conventional computer systems. DLNNs require thousands, if not millions of compute cores compared to one or few in conventional systems. Therefore, there is a need to review the performance issue to gain better understanding of how systems behave in such massively parallel architectures. Precision, speed, memory access, bus contention, resource sharing, chip area etc are some of the key issues that need to be studied in the changed context. Low precision multiplication remains one of the commonly used operations in neural computations. This paper draws reader attention to some interesting results in area-speed tradeoffs when applied to massively parallel architectures. A new low precision fixed point representation is discussed. A hardware accelerators and its software components used in the simulation are briefly discussed. Results show that serial multipliers can perform better than parallel multipliers considering the throughput per unit area of Silicon.

Cited by 4

Parallel ROLAP Data Cubes performance Comparison and Analysis

Wei Shi, Qi Deng, Boyong Liang · 2003

The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tasks in large data warehouses. In order to meet the need for improved performance created by growing data sizes, parallel solutions for generating the data cube are becoming increasingly important. This Project Report reports the test result of building and querying data cube between large parallel database: DB2 and Panda sys-tem. We have investigated two large parallel database: DB2 and Oracle 9i. Under the default setup of DB2 and Panda system, we tested the performance of building a cube in both Panda system and DB2 and also some data cube queries. We mainly studied the Partition difference between Panda system and DB2, then analyze the reason of the test result after the serious study of these two systems. 1

Cited by 0

Performance comparison of Java based parallel programming models

Muhammad Na’im Fikri Jamaluddin, Azlan Ismail, Amir Abd Rashid, Talha Takleh Omar Takleh · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 2019

Parallel programming has been implemented in many areas to solve various computational problem with the aim, to improve the performance and scalability of the software application. There are a few parallel programming models commonly used, namely, threads, and message passing (distributed) models. Furthermore, various APIs have been proposed to implement these models based on two popular languages, notably, C/C++ and Java. A few studies have been done to compare the performance of parallel programming models, specifically, pure versus hybrid model. However, most of existing comparisons targeted on MPI/OpenMP based on C/C++ language. In this paper, our aim is to explore the performance comparison between threads, message passing and hybrid model in Java, specifically using Java multithreading and MPJ Express. For this reason, we have chosen a problem called word count occurrence which is significant in Natural Language Processing and use it to design and implement the parallel programs. We then present their performance and discuss the results.

Cited by 0Open access

Performance comparison of java based parallel programming models

Muhammad Na’im Fikri Jamaluddin, Azlan Ismail, Amir Abd Rashid et al. · Indonesian Journal of Electrical Engineering and Computer Science · 2019

<span lang="EN-MY">Parallel programming has been implemented in many areas to solve various computational problem with the aim, to improve the performance and scalability of the software application. There are a few parallel programming models commonly used, namely, threads, and message passing (distributed) models. Furthermore, various APIs have been proposed to implement these models based on two popular languages, notably, C/C++ and Java. A few studies have been done to compare the performance of parallel programming models, specifically, pure versus hybrid model. However, most of existing comparisons targeted on MPI/OpenMP based on C/C++ language. In this paper, our aim is to explore the performance comparison between threads, message passing and hybrid model in Java, specifically using Java multithreading and MPJ Express. For this reason, we have chosen a problem called word count occurrence which is significant in Natural Language Processing and use it to design and implement the parallel programs. We then present their performance and discuss the results.</span>

Cited by 7Open access

Comparison of genomes using high-performance parallel computing

Nalvo F. Almeida, Edson N. Cáceres, C. E. R. Alves et al. · 2004

Comparison of the DNA sequences and genes of two genomes can be useful to investigate the common functionalities of the corresponding organisms and get a better understanding of how the genes or groups of genes are organized and involved in several functions. We use high-performance parallel computing to compare the whole genomes of two organisms, namely Xanthomonas axonopodis pv. citri and Xanthomonas campestris pv. campestris, each with more than five million base pairs. Our purpose is two-fold. First we intend to exploit the high-performance power of a cluster of low-cost microcomputers, propose a parallel solution to this problem, and show its feasibility with implementation and performance results. Second we do additional comparisons of the two genomes by locating and compare not only the homologous genes (expressed in terms of the 20-letter amino acids) but also compare the regions or gaps (in terms of the 4-letter DNA nucleotides) between the corresponding homologous genes. We have implemented the proposed comparison strategy to compare the two genomes Xanthomonas axonopodis pv. citri (Xac) and Xanthomonas campestris pv. campestris (Xcc). The parallel platform used is a Beowulf cluster of 64 nodes consisting of low cost microcomputers. Xac has 5175554 base pairs and 4313 protein-coding genes while Xcc has 5076187 base pairs and 4182 protein-coding genes. The parallel solution is based on the dynamic programming approach and presents not only less processing time, but also better quality results as compared to approaches based on Blast and EGG.

Cited by 5

Performance comparison of parallel optical interconnects for enterprise servers

Casimer DeCusatis, R.G. Atkins · 2004

There is an emerging need in the computing industry for higher bandwidth, longer distance, and increased density inter- connections within clusters of high performance enterprise-class computer systems. Many of these servers share a common set of high level requirements which lend themselves to the use of par- allel optical interconnects to either supplement or replace existing copper data buses. In this paper, we describe the results of applica- tion testing perfomed on 12-fiber parallel optical cables and con- nectors, including a relative comparison between three different multimode cable assembly sources. Assembly loss and effects of both axial and off-axis pull forces are measured for cable sam- ples mated to a laser transmitter array. Significant variations exist in the performance of the same type of cable assembly from dif- ferent manufacturing sources, particularly concerning their sus- ceptibility to pull forces; we also investigate the effects of fiber strain relief to improve performance of these links. While currently available 12-fiber array connectors are not equivalent in perfor- mance to standard duplex connectors, this work suggests areas for future improvement and data communication application require- ments which should be considered when using parallel fiber optic arrays.

Cited by 2

Comparison among Performance Measures for Parallel Matrix Multiplication Algorithms

Halil Snopçe, Azir Aliu · Research Journal of Applied Sciences Engineering and Technology · 2014

In this study we analyze how to make a proper selection for the given matrix-matrix multiplication operation and to decide which is the best suitable algorithm that generates a high throughput with a minimum time, a comparison analysis and a performance evaluation for some algorithms is carried out using the identical performance parameters.

Cited by 1Open access

A Comparison of High Performance, Parallel Computing Java Packages

Nan C. Schaller, Sidney W. Marshall · 2010

Abstract. The high-performance computing community has developed numerous Java packages that support parallel and distributed computing. Most of these packages are designed for the typical parallel message passing and shared memory architectural paradigms. This paper presents the results of a recent study that included a web search for such packages, describes the paradigms implemented in them, and evaluates their performance on a parallel, 4-processor SMP machine using three benchmark programs that represent a mix of typical parallel applications, chosen from The Java Grande Benchmark Suite. A brief description of each package and a discussion its ease of installation and use are also provided. 1

Cited by 0

Performance Comparison of Liquid–Liquid Extraction in Parallel Microflows

Anil B. Vir, A. S. Fabiyan, Jason R. Picardo et al. · Industrial & Engineering Chemistry Research · 2014

Parallel bicontinuous flows, which include stratified and core-annular flow, have applications in liquid–liquid extraction in microchannels. The flow regime has a significant impact on interphase mass transfer. Either stratified flow or core-annular flow can result in better extraction, depending on the physical properties of the fluids and solute and the operating conditions. In this work, we systematically compare the extraction performance of core-annular and stratified flow. Mathematical models are developed for each flow regime and solved semianalytically. Both models are validated with experimental data from the literature. Using the models we analyze both flow regimes across the parameter space. Two basis for comparison are used: (i) specified flow rates of the two fluid streams and (ii) specified pressure gradient and holdup (volume fraction of the carrier stream). For core-annular flow, two distinct cases are analyzed based on the position of the solute bearing carrier stream: (i) the carrier stream is the core fluid and the solvent stream is the annular fluid and (ii) the carrier stream is the annular fluid. The results are explained in terms of two key factors: the interfacial area and the ratio of diffusion time to residence time in each fluid. This new understanding is coalesced into a set of guidelines for selecting the parallel flow regime which enhances extraction performance.

Cited by 20

Parallel Performance Comparison of Three Direct Separable Elliptic Solvers

Gergana Bencheva · 2003

The parallel properties of three fast direct solution methods for linear systems with separable block tridiagonal matrices and a related C/MPI code are studied. Fast algorithm for separation of variables and two variants of the generalized marching algorithm are first summarized. The results from numerical tests performed on two coarse-grained parallel architectures are then reported. The obtained speed-up and efficiency coefficients are compared. The general conclusion is that not always the best sequential solver has the best parallel performance. 1

Cited by 0

Performance Comparison of Three Parallel Implementations of a SchwarzSplitting Algorithm

Jim Gamble, Calvin J. Ribbens · VTechWorks (Virginia Tech) · 1989

We describe three implementations of a Schwarz splitting algorithm for the numerical solution of two dimensional, second-order, linear elliptical partial differential equations. One implementation makes use of the SCHEDULE package. A second uses the language extensions available in SEQUENT Fortran for creating and controlling parallel processes. The third implementation is a hybrid of the first two -- using explicit (non-portable) calls to create a control parallel processes, but using data structures and overhead similar to the implementation that uses SCHEDULE. We report from several experiments with typical test problems on a Sequent Symmetry S81 shared-memory multiprocessor. We measure the overhead involved in using SCHEDULE, and discuss advantages and disadvantages of this approach.

Cited by 0Open access

Parallel Performance Comparison between Encore and OpenMP using Pedestrian Simulation

David Escher · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2017

Parallel programming has become ubiquitous and more than a preference, it is a necessity for utilizing hardware resources (multiple cores) in order to speed-up computation. However, developing parallel programs is difficult and error-prone. In ordert o make development of parallel programs easier and less error-prone,new programming languages are being developed. This thesis compares Encore, a new programming language, against C++ with OpenMP for parallelizing program execution. The focus of this comparison is the respective run-times and parallel scalability, when running a pedestrian simulation program.

Cited by 0Open access

Performance Comparison of Adder Topologies with Parallel Processing Adder Circuit

J Muralidharan, M Senthisivakumar, A. M. Vijaya Prakash · Innovations in Information and Communication Technology Series · 2020

In today’s modern era IC architecture design adders are become obligatory block. The growth in digitalization scenario to produce compact design products parameters like power, delay and area should be minimized. In most of the complex design of digital circuits, adder is an elementary factor. If the performance of digital adders is enriched, it would lead to quickening the binary operations in involved in the complex circuits. The constraints in the operation delay of an adder are due to carry propagation in the circuit. The adder topologies involved in this work includes Carry Save Adder, Carry Select Adder, Ripple Carry Adder and Kogge Stone Adder

Cited by 1Open access

Comparison and End-to-End Performance Analysis of Parallel Filesystems

Michael Kluge · Qucosa (Saxon State and University Library Dresden) · 2011

This thesis presents a contribution to the field of performance analysis for Input/Output (I/O) related problems, focusing on the area of High Performance Computing (HPC). Beside the compute nodes, High Performance Computing systems need a large amount of supporting components that add their individual behavior to the overall performance characteristic of the whole system. Especially file systems in such environments have their own infrastructure. File operations are typically initiated at the compute nodes and proceed through a deep software stack until the file content arrives at the physical medium. There is a handful of shortcomings that characterize the current state of the art for performance analyses in this area. This includes a system wide data collection, a comprehensive analysis approach for all collected data, an adjusted trace event analysis for I/O related problems, and methods to compare current with archived performance data. This thesis proposes to instrument all soft- and hardware layers to enhance the performance analysis for file operations. The additional information can be used to investigate performance characteristics of parallel file systems. To perform I/O analyses on HPC systems, a comprehensive approach is needed to gather related performance events, examine the collected data and, if necessary, to replay relevant parts on different systems. One larger part of this thesis is dedicated to algorithms that reduce the amount of information that are found in trace files to the level that is needed for an I/O analysis. This reduction is based on the assumption that for this type of analysis all I/O events, but only a subset of all synchronization events of a parallel program trace have to be considered. To extract an I/O pattern from an event trace, only these synchronization points are needed that describe dependencies among different I/O requests. Two algorithms are developed to remove negligible events from the event trace. Considering the related work for the analysis of a parallel file systems, the inclusion of counter data from external sources, e.g. the infrastructure of a parallel file system, has been identified as a major milestone towards a holistic analysis approach. This infrastructure contains a large amount of valuable information that are essential to describe performance effects observed in applications. This thesis presents an approach to collect and subsequently process and store the data. Certain ways how to correctly merge the collected values with application traces are discussed. Here, a revised definition of the term "performance counter" is the first step followed by a tree based approach to combine raw values into secondary values. A visualization approach for I/O patterns closes another gap in the analysis process. Replaying I/O related performance events or event patterns can be done by a flexible I/O benchmark. The constraints for the development of such a benchmark are identified as well as the overall architecture for a prototype implementation. Finally, different examples demonstrate the usage of the developed methods and show their potential. All examples are real use cases and are situated on the HRSK research complex and the 100GBit Testbed at TU Dresden. The I/O related parts of a Bioinformatics and a CFD application have been analyzed in depth and enhancements for both are proposed. An instance of a Lustre file system was deployed and tuned on the 100GBit Testbed by the extensive use of external performance counters.

Cited by 4Open access

Performance Comparison of Parallel Programming Paradigms on a Multicore Cluster

Enzo Rucci, Franco Chichizola, Marcelo Naiouf et al. · 2012

Currently, most supercomputers are multicore clusters.This type of architectures is said to be hybrid, because they combine distributed memory with shared memory.Traditional parallel programming paradigms (message passing and shared memory) cannot be naturally adapted to the hardware features offered by these architectures.A parallel paradigm that combines message passing with shared memory is expected to better exploit them.Therefore, in this paper the performance of two parallel programming paradigms (message passing and combination of message passing with shared memory) is analyzed for multicore clusters.The study case used is the construction of phylogenetic trees by means of the Neighbor-Joining method.Finally, conclusions and future research lines are presented.

Cited by 0