An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

DOI10.1016/J.COMPELECENG.2008.11.020MaRDI QIDQ1040952zbMATH OpenOpenAlexFDO

Authors Min He, Xiaolong Wu, S. Q. Zheng

Publication date 27 November 2009

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.compeleceng.2008.11.020

zbMATH Keywords

optical interconnectionparallel algorithmsparallel computingsorting

Mathematics Subject Classification ID

Computer system organization (68M99) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2040827
• Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses
• Parallel enumeration sort on OTIS-hypercube
• Integer sorting and routing in arrays with reconfigurable optical buses
• scientific article; zbMATH DE number 4064478

Cited in

(3)

• Communication-efficient sorting algorithms on reconfigurable array of processors with slotted optical buses
• scientific article; zbMATH DE number 2134687 (Why is no real title available?)
• scientific article; zbMATH DE number 2040827 (Why is no real title available?)

This page was built for publication: An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040952)