ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Parallel Computing
Volume 6, Issue 1, January 1988, Pages 115-117
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (224 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0167-8191(88)90010-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1988 Published by Elsevier Science B.V.

Short communication

Timing results of some internal sorting algorithms on the IBM 3090

P. Carnevali

IBM ECSEC, Via Giorgione 159, 00147, Roma, Italy

Available online 14 August 2003.

Purchase the full-text article



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

Article Outline

• References

Parallel Computing
Volume 6, Issue 1, January 1988, Pages 115-117
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.