File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: FAST SORTING ALGORITHMS ON UNIFORM LADDERS (MULTIPLE SHIFT-REGISTER LOOPS).

TitleFAST SORTING ALGORITHMS ON UNIFORM LADDERS (MULTIPLE SHIFT-REGISTER LOOPS).
Authors
Issue Date1980
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tc
Citation
Ieee Transactions On Computers, 1980, v. C-29 n. 7, p. 618-631 How to Cite?
AbstractTwo sorting algorithms on the uniform ladder (a new storage device based on charged coupled devices, or magnetic bubbles implementation, are presented. When one ladder cannot accommodate all the input records and two or more ladders are needed, Algorithm 2 attains a negligible unoverlapped sorting time (which can be removed with a minor modification in the system hardware and hence in Algorithm 2). In comparison, Algorithm 2 obviates the need for explicit merging of the ladders. This implies that unlike the MLISO scheme, ladders are not tied up for merging, and can be recycled once their contents are outputted. Therefore, in a real processing environment, the number of ladders required by Algorithm 2 may even be less than the theoretical minimum which can be attained by the MLISO scheme.
Persistent Identifierhttp://hdl.handle.net/10722/152205
ISSN
2015 Impact Factor: 1.723
2015 SCImago Journal Rankings: 0.924

 

DC FieldValueLanguage
dc.contributor.authorChin, Francis Yen_US
dc.contributor.authorFok, Samson Ken_US
dc.date.accessioned2012-06-26T06:36:31Z-
dc.date.available2012-06-26T06:36:31Z-
dc.date.issued1980en_US
dc.identifier.citationIeee Transactions On Computers, 1980, v. C-29 n. 7, p. 618-631en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://hdl.handle.net/10722/152205-
dc.description.abstractTwo sorting algorithms on the uniform ladder (a new storage device based on charged coupled devices, or magnetic bubbles implementation, are presented. When one ladder cannot accommodate all the input records and two or more ladders are needed, Algorithm 2 attains a negligible unoverlapped sorting time (which can be removed with a minor modification in the system hardware and hence in Algorithm 2). In comparison, Algorithm 2 obviates the need for explicit merging of the ladders. This implies that unlike the MLISO scheme, ladders are not tied up for merging, and can be recycled once their contents are outputted. Therefore, in a real processing environment, the number of ladders required by Algorithm 2 may even be less than the theoretical minimum which can be attained by the MLISO scheme.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tcen_US
dc.relation.ispartofIEEE Transactions on Computersen_US
dc.titleFAST SORTING ALGORITHMS ON UNIFORM LADDERS (MULTIPLE SHIFT-REGISTER LOOPS).en_US
dc.typeArticleen_US
dc.identifier.emailChin, Francis Y:chin@cs.hku.hken_US
dc.identifier.authorityChin, Francis Y=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0019032775en_US
dc.identifier.volumeC-29en_US
dc.identifier.issue7en_US
dc.identifier.spage618en_US
dc.identifier.epage631en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChin, Francis Y=7005101915en_US
dc.identifier.scopusauthoridFok, Samson K=7005182791en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats