摘要
讨论了并行查询中丛生树的自顶向下和自底向上两类处理机分派算法的优点及其不足之处，在此基础上提出了一个新的处理机分派的调度算法，本算法可达到近似最优调度效果．
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.
出处
《华中理工大学学报》
CSCD
北大核心
1999年第10期56-58,共3页
Journal of Huazhong University of Science and Technology
