| O（N）时空复杂度排序器的设计 |
| |
| 引用本文： | 李之棠,李汉菊.O（N）时空复杂度排序器的设计[J].华中科技大学学报(自然科学版),1994(6). |
| |
| 作者姓名： | 李之棠 李汉菊 |
| |
| 作者单位： | 毕中理工大学计算机科学与工程系 |
| |
| 基金项目： | 国家自然科学基金,湖北省自然科学基金 |
| |
| 摘 要： | 用特别设计的自动检索电路与一般存储器一起构成一个独立的硬件排序单元．其时间、空间复杂度均是Ｏ（Ｎ）．它既可以作为主ＣＰＵ的协处理器，也可以作为高性能计算系统（如并行处理系统）或高速数据库查询系统（如数据库机）的一个专用功能单元
|
| 关 键 词： | 排序器 O（N）时空复杂度 数据库机 |
Design of a Sorting Unit with Space-time Complexity O(N) |
| |
| Li ZhitangDept.of Computer Sci.&Engin.,H. U. S.T.,Wuhan ,China
,Li Hanju.Design of a Sorting Unit with Space-time Complexity O(N)[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1994(6). |
| |
| Authors: | Li ZhitangDeptof Computer Sci&Engin H U ST Wuhan China Li Hanju |
| |
| Affiliation: | Li ZhitangDept.of Computer Sci.&Engin.,H. U. S.T.,Wuhan 430074,China
,Li Hanju |
| |
| Abstract: | An independent hardware sorting unit is formed with a specially designed automatic re-trieval circuit and a few general-purpose memories. Each byte of the is written suc-cessively in the sorting unit with the corresponding mark bits. The bytes are then read outfrom the priority encoder circuit so that the sorting for tuples will be completed from thelowest to the highest byte of the |
| |
| Keywords: | in turn If the number of tuples to be sorted is nand that of bytes of the Keywords for each tuple is m then the sorting time complexity willbe 2nm or 2N(N=nm) or O(N) The main hardware of the sorting unit is the general-pur-pose RAMs in which there are |
| 本文献已被 CNKI 等数据库收录！ |
