Aiming at the high requirements of time and processor performance for heterogeneous distributed simulation system of unmanned cluster warfare, a list scheduling algorithm (Task Duplicate and Access Integrated Scheduli...
详细信息
Aiming at the high requirements of time and processor performance for heterogeneous distributed simulation system of unmanned cluster warfare, a list scheduling algorithm (Task Duplicate and Access Integrated schedulingalgorithm, DAIS) based on task access and task replication is proposed. The algorithm combines the advantages of the HEFT (Heterogeneous Earliest Finish Time) algorithm and the PEFT (Predict Earliest Finish Time) algorithm, introduces the idea of critical path and task access degree to reconstruct the task schedulinglist in the priority calculation phase, and adopts the task replication strategy in the processor allocation phase to optimize the processor allocation results. The effectiveness of the DAIS algorithm is verified by conducting comparison experiments with randomly generated directed acyclic graphs (Directed Acyclic Graph, DAG), and simulation results show that the method can obtain shorter scheduling lengths.
In this paper, we investigate an open problem by Gyorgyi and Kis for a single-machine scheduling problem with a non-renewable resource (NR-SSP) and total weighted completion time criterion. The problem is NP-hard, eve...
详细信息
In this paper, we investigate an open problem by Gyorgyi and Kis for a single-machine scheduling problem with a non-renewable resource (NR-SSP) and total weighted completion time criterion. The problem is NP-hard, even if every job has the same processing time, and each weight is equal to its required amount of the resource. Gyorgyi and Kis prove that a simple list scheduling algorithm for this special case is a 3-approximation algorithm and conjecture that the algorithm for the case is a 2-approximation algorithm. We prove their conjecture. More strongly, we show that the approximation ratio is strictly less than 2 for any instance, and for any epsilon>0, there exists an instance for which the approximation ratio is more than 2-epsilon.
In this paper, we consider the W-prize-collecting scheduling problem on parallel machines. In this problem, we are given a set of n jobs, a set of m identical parallel machines and a value W. Each job J(j) has a proce...
详细信息
In this paper, we consider the W-prize-collecting scheduling problem on parallel machines. In this problem, we are given a set of n jobs, a set of m identical parallel machines and a value W. Each job J(j) has a processing time, a profit and a rejection penalty. Each job is either accepted and processed on one of the machines without preemption, or rejected and paid a rejection penalty. The objective is to minimize the sum of the makespan of accepted jobs and the penalties of rejected jobs, and at the same time the total profit brought by accepted jobs is not less than W. We design a 2-approximation algorithm for the problem based on the greedy method and the list scheduling algorithm.
Efficient tasks scheduling is critical for achieving high performance in heterogeneous computing systems (HCS). The tasks scheduling problem is NP-hard in general. In order to obtain better solutions,
Efficient tasks scheduling is critical for achieving high performance in heterogeneous computing systems (HCS). The tasks scheduling problem is NP-hard in general. In order to obtain better solutions,
暂无评论