Competitive Algorithm for On-Line Multiprocessor Scheduling
Author:
Affiliation:
Fund Project:
摘要
|
图/表
|
访问统计
|
参考文献
|
相似文献
|
引证文献
|
资源附件
摘要:
介绍了局内问题的竞争算法,给出了多种任务加工表局内问题的竞争算法。
Abstract:
The concepts of competitive algorithm are introduced and competitive algorithm for on line multiprocessor scheduling is obtained.The best upper bound of the algorithm's competitive rate is proved to be 2-1 m .