Performance evaluation of vector implementations of combinatorial algorithms (Q1062729)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Performance evaluation of vector implementations of combinatorial algorithms |
scientific article; zbMATH DE number 3915535
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance evaluation of vector implementations of combinatorial algorithms |
scientific article; zbMATH DE number 3915535 |
Statements
Performance evaluation of vector implementations of combinatorial algorithms (English)
0 references
1985
0 references
Vector implementations are proposed for the binary knapsack problem (dynamic programming) and the shortest path problem (Dijkstra's and Floyd's algorithm). Improvements in the performance due to the vectorization (CRAY-1) are reported, and seem to be in accordance with the discussion of a general model for performance evaluation.
0 references
combinatorial algorithms
0 references
Dijkstra-Floyd algorithm
0 references
Vector implementations
0 references
binary knapsack problem
0 references
dynamic programming
0 references
shortest path problem
0 references
performance evaluation
0 references
