Speeding sort algorithms by special instructions

DOI10.1007/BF01934066MaRDI QIDQ1154271zbMATH OpenOpenAlexFDO

Authors Hannu Erkiö

Publication date 1981

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01934066

zbMATH Keywords

performance improvementinternal sortingdynamic microprogramming21, 2-19 (1981)inner loops

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• An empirical study of FORTRAN programs
• Dynamic Problem-Oriented Redefinition of Computer Architecture via Microprogramming
• Dynamic microprogramming
• Heuristic Synthesis of Microprogrammed Computer Architecture
• Insertion merge sorting
• System Design of a Dynamic Microprocessor
• Techniques of Program Execution with a Writable Control Memory

Cited in

(1)

• Making bubblesort recursive

This page was built for publication: Speeding sort algorithms by special instructions

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