Abstract
This paper presents a new algorithm for a batch of task makespan minimisation in heterogeneous multigrid computing. Heterogeneous grids are known to cause straggling task problem that increases task execution makespan. Existing task distribution algorithms solve this problem by using information about the compute node capacities or task sizes. However, such information may not always be available. Task stalling solves both problems. However, this method is described for queuing systems consisting of only two heterogeneous servers or grids. Our proposed algorithm is based on an improved task stalling method, allowing it to distribute tasks in systems consisting of two or more grids. Experiment results show reduced task execution makespan by up to 19,92% compared to FIFO. This allows us to conclude that the new algorithm is suitable for a batch of task makespan minimisation in heterogeneous multigrid computing.
Highlights
J = {t1, t2, ... , tm} of m tasks clusters ← order clusters by each cluster′s efficiency μi (1 ≤ i ≤ n) lengths ← calculate buffer length ki for each buffer bi (1 ≤ i < n) for each task tj ∈ J do repeat for each cluster ci ∈ clusters do if cluster ni accepts new tasks schedule task tj to cluster ni else if i < n and number of tasks in buffer bi < ki add task tj to buffer bi end if end for until task tj is distributed end for
Summary
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
