Copyright © 1988 Published by Elsevier Science B.V.
Short communication
Timing results of some internal sorting algorithms on the IBM 3090
Available online 14 August 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The information contained in a paper by Rönsch adn Strauss on the performance of sorting algorithms on vector computers is completed with performance data of the IBM 3090 on sorting. For scalar sorting, the IBM 3090 turns out to be faster than all the machines considered by Rönnsch and Strauss. Due to this high scalar speed, FORTRAN-coded vector sorting is never more efficient than scalar sorting on the IBM 3090, at least for the vector sorting algorithms considered. On the other hand, for optimized library routines the IBM 3090 outperforms the CRAY X-MP (but not the AMDAHL 1200) at most vector lenghts.
Author Keywords: Sorting algorithms; internal sorting; performance analysis; vector computer; IBM 3090







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)




