| 并行查询中的处理机分派算法研究 |
| |
| 引用本文： | 李庆华,孟咏喜.并行查询中的处理机分派算法研究[J].华中科技大学学报(自然科学版),1999(10). |
| |
| 作者姓名： | 李庆华 孟咏喜 |
| |
| 作者单位： | 华中理工大学计算机科学与技术学院 |
| |
| 摘 要： | 讨论了并行查询中丛生树的自顶向下和自底向上两类处理机分派算法的优点及其不足之处，在此基础上提出了一个新的处理机分派的调度算法，本算法可达到近似最优调度效果．
|
| 关 键 词： | 查询树 丛生树 处理机分派 调度 |
Algorithm for Processor Allocation in Parallel Query |
| |
| Li Qinghua Meng Yongxi Li Qinghua Prof., College of Computer Sci. & Tech.,HUST,Wuhan ,China..Algorithm for Processor Allocation in Parallel Query[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,1999(10). |
| |
| Authors: | Li Qinghua Meng Yongxi Li Qinghua Prof College of Computer Sci & Tech HUST Wuhan China |
| |
| Institution: | Li Qinghua Meng Yongxi Li Qinghua Prof., College of Computer Sci. & Tech.,HUST,Wuhan 430074,China. |
| |
| Abstract: | The advantages and disadvantages of both the bottom up approach and top down approach for processor allocation in bushy tree of parallel query are discussed. A new schedule algorithm of processor allocation is proposed, expected to achieve nearly optimal results. |
| |
| Keywords: | query tree bushy tree processor allocation schedule |
| 本文献已被 CNKI 等数据库收录！ |
