By Topic

Systolic s2-way merge sort is optimal

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
H. Schmeck ; Inst. fur Inf. & Praktische Math., Kiel Univ., West Germany ; H. Schroder ; C. Starke

The time complexity of Thompson and Kung's (1977) s2 -way merge sort is analyzed and shown to be asymptotically optimal with respect to the recently improved lower bound on sorting on a mesh-connected n×n array. New lower bounds for systolic sorting are derived. A systolic version of s2 -way merge sort is systematically constructed and shown to be asymptotically optimal as well

Published in:

IEEE Transactions on Computers  (Volume:38 ,  Issue: 7 )