Abstract
File or database processing in business oriented microcomputers requires frequent data sorting. In a situation of modest system resources of microcomputers, applied software sorting procedures may not be efficient enough for some applications. An alternative approach is to achieve fast sorting by means of specialized hardware. Known hardware sorters are not economically justified for low cost microcomputers. As an efficient and cost-effective solution, we propose a new concept of a sorting processor for microcomputers, SPR. The SPR is dedicated to accelerate sorting and sort-based database operations. The sorting method is radix sort with 64K radix. The paper presents the basic algorithm and hardware organization of the SPR. A detailed functional description of the sorting operation is given. Using the SPR a sorting algorithm achieves an order of complexity O(N) with specific sorting speed within a few microseconds per 16-bit word. The described hardware is convenient for VLSI implementation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
