Efficient Resource Scheduling For Multiple-Cham-Structured Task over Distributed Processor Systems

摘要

We present an improvement in Bokhari's, Dermler's. and Mughal's, algorithms for partitioning multiple-chain-like lusks across a host-satellite distributed system. The time complexity of our present algorithm is reduced from the time complexity O(NM~2 log max(M,N)) of Bokhari and complexity O(kNM~2) of Dcrmler and Moghal to O(MN log M). where N (N < M) is the number of satellites and M is the number of modules in each of the N chains which must he partitioned between a salellite and the host.