https://scholars.lib.ntu.edu.tw/handle/123456789/488274
標題: | Cost-Optimal Parallel Algorithms for Constructing B-Trees. | 作者: | Wang, Biing-Feng GEN-HUEY CHEN |
公開日期: | 1994 | 卷: | 81 | 期: | 1-2 | 起(迄)頁: | 55-72 | 來源出版物: | Inf. Sci. | 摘要: | In this paper two cost-optimal parallel algorithms are presented for constructing a B-tree for a sorted list of N keys. These two parallel algorithms are designed on the shared-memory SIMD computer: one, based on the EREW model, uses N loglog N processors and requires O(loglog N) time; the other, based on the CREW model, uses N processors and requires O(1) time. © 1994. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0028542440&doi=10.1016%2f0020-0255%2894%2990089-2&partnerID=40&md5=4b9535d4018cd67e781520e169187d37 | DOI: | 10.1016/0020-0255(94)90089-2 | SDG/關鍵字: | Computational complexity; Data storage equipment; Data structures; Mathematical models; Optimal systems; Parallel processing systems; Program processors; Trees (mathematics); B trees; Cost optimal parallel algorithms; Algorithms |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。