Performance evaluation of vector implementations of combinatorial algorithms

Authors:
Celso Ribeiro
Affiliations:
-
Venue:
Parallel Computing
Year:
1984

Citing 7
Cited 0

The CRAY-1 computer system

Communications of the ACM - Special issue on computer architecture
Algorithm 97: Shortest path

Communications of the ACM
Parallel Computations

Parallel Computations
The Architecture of Symbolic Computers

The Architecture of Symbolic Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
High Speed Computer and Algorithm Organization

High Speed Computer and Algorithm Organization
Dynamic Programming

Dynamic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the performance and the use of vector computers for the solution of combinatorial optimization problems, particularly dynamic programming and shortest path problems. A general model for performance evaluation and vector implementations for the problems described above are studied. These implementations were done on a CRAY-1 vector computer and the computational results obtained show (i) the adequacy of the performance evaluation model and (ii) very important gains concerning computing times, showing that vector computers will be of great importance in the field of combinatorial optimization.