Optimal Task Scheduling for Parallel Systems using State-Space Search

About this item

Title

Optimal Task Scheduling for Parallel Systems using State-Space Search

Content partner

The University of Auckland Library

Collection

ResearchSpace@Auckland

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 t...

Read more

Format

Research paper

Research format

Thesis

Thesis level

Doctoral

Date created

2020

Creator

Orr, Michael

URL

http://hdl.handle.net/2292/50077

What is the copyright status of this item?

Share, Modify

See below for specifics about how you may use this item.

More Information

The University of Auckland Library has this to say about the rights status of this item:

Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.

You can learn more about the rights status of this item at:

• https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
• http://creativecommons.org/licenses/by-nc-sa/3.0/nz/
• http://purl.org/eprint/accessRights/OpenAccess

What can I do with this item?

You must always check with The University of Auckland Library to confirm the specific terms of use, but this is our understanding:

Non-infringing use

NZ Copyright law does not prevent every use of a copyright work. You should consider what you can and cannot do with a copyright work.

Share it

This item is suitable for copying and sharing with others, without further permission.

Modify it

This item is suitable for modifying, remixing and building upon, without further permission.

No commercial use

You may not use this item commercially.