On detecting parallelism in software

Authors:
Satish K. Tripathi
Affiliations:
University of Maryland, College Park, MarylandU.S.A.
Venue:
Journal of Systems and Software
Year:
1986

Citing 6
Cited 0

Probability and Statistics with Reliability, Queuing and Computer Science Applications

Probability and Statistics with Reliability, Queuing and Computer Science Applications
Modelling of the parallel resolution of a numerical problem on a locally distributed computing system

SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Queueing Network Models for Parallel Processing with Asynchronous Tasks

IEEE Transactions on Computers
Communication Issues in the Design and Analysis of Parallel Algorithms

IEEE Transactions on Software Engineering
Performance Measures for Evaluating Algorithms for SIMD Machines

IEEE Transactions on Software Engineering
An “Active Server” model for the performance of parallel programs written using rendezvous

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the last decade a number of parallel algorithms for various kinds of scientific and real-time applications have been proposed. These algorithms need to be evaluated for both time and communication complexities. The evaluation should be machine independent and be able to identify common features in different algorithms. In this paper we review the performance-evaluation issues for parallel algorithms and present a simple model for comparative evaluation of these algorithms.