Optimal Task Scheduling for Parallel Systems Using State-space Search

Released on by Michael Orr
preview-18

  • Optimal Task Scheduling for Parallel Systems Using State-space Search Book Detail

  • Author : Michael Orr
  • Release Date : 2020
  • Publisher :
  • Genre : Combinatorial optimization
  • Pages : 161
  • ISBN 13 :
  • File Size : 72,72 MB
DOWNLOAD BOOK

Optimal Task Scheduling for Parallel Systems Using State-space Search by Michael Orr PDF Summary

Book Description: It is of ever-increasing importance that programs are able to take full advantage of the parallel systems on which they are run. Task scheduling is the problem of producing a schedule for a program, such that the tasks which make up the program are each allocated to a specific processor and in a specific order which minimises the overall run-time. This problem is NP-hard, so that the amount of work required grows exponentially as the number of tasks is increased. Although the NP-hardness of the problem usually discourages optimal solving, an optimal schedule can give a significant advantage in time critical systems or applications where a single schedule is reused many times. Previous research with branch-and-bound for optimal task scheduling has shown promise with small task graphs, being competitive with other methods. The state-space model used in that work has an obvious drawback of allowing many duplicate states to occur in the state-space, which theoretically causes a large amount of additional time and memory to be required. This thesis proposes a new state-space model called Allocation-Ordering (AO), which improves on older models through its carefully designed lack of duplicate states. AO divides the task scheduling problem into two distinct sub-problems (allocation and ordering) which are handled in sequence within the state-space. Experimental evaluation confirms the benefits of the model. The benefits of AO’s lack of duplicate states for other branch and bound algorithms are then explored, specifically variants with interesting properties such as parallelisation and low memory requirements. We then investigate its applicability to more complex task scheduling models: the model is first adapted to allow optimal task scheduling with related heterogeneous processors, and then to allow optimal task scheduling with task duplication. The success of the adaptation of AO shows its flexibility, and suggests it may have wide applicability to variants of the task scheduling problem, and potentially other problems.

Disclaimer: www.yourbookbest.com does not own Optimal Task Scheduling for Parallel Systems Using State-space Search books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.

Task Scheduling for Parallel Systems

Task Scheduling for Parallel Systems

File Size : 7,7 MB
Total View : 6928 Views
DOWNLOAD

A new model for task scheduling that dramatically improves the efficiency of parallel systems Task scheduling for parallel systems can become a quagmire of heur