Work-First in Nested Parallelism for Parallel Task

Show simple item record

dc.contributor.advisor Sinnen, O en
dc.contributor.advisor Giacaman, N en
dc.contributor.author Tong, Weng Hao en
dc.date.accessioned 2015-07-23T21:31:27Z en
dc.date.issued 2015 en
dc.identifier.citation 2015 en
dc.identifier.uri http://hdl.handle.net/2292/26396 en
dc.description Full text is available to authenticated members of The University of Auckland only. en
dc.description.abstract Parallel Task is a Java-based technology that incorporates the benefits of task parallelism into Object-Oriented Java applications. However, Parallel Task’s existing Help-First scheduling policy struggles to perform well in fine-grained nested parallelism; while the Work-First scheduling policy is ideal in fine-grained nested parallelism, the typical Work-First approach is not viable due to its conflicting behaviours with Parallel Task. An alternative strategy for a Work-First solution in Parallel Task is needed. This thesis presents a solution that addresses the performance limitations identified in Parallel Task by combining both the existing Help-First and Work-First scheduling policies together in Parallel Task in an effort to help alleviate its performance limitations in finegrained nested parallelism. This solution uses the advantages of both scheduling policies where Help-First is used to distribute tasks for load balancing, while Work-First is used to execute tasks efficiently during fine-grained nested parallelism. The proposed solution comprises of three different implementations of Work-First: Global Task Population Control, Local Task Queue Control, and Task Depth Control. Each implementation monitors the load of Parallel Task and governs when it is suitable to employ Work-First, based on their own perspectives. The Global Task Population Control evaluates the load of Parallel Task based on the population of tasks in the system. The Local Task Queue Control evaluates the load of each worker task queue. The Task Depth Control examines the hierarchical task structure by examining the nested depth of a task. Each implementation will apply Work-First to newly created tasks if Parallel Task is found to perform inefficiently from their perspectives. All three proposed control policies for the integration of Work-First into Parallel Task are evaluated in numerous experiments. The results show that the Work-First scheduling for Parallel Task achieves a clear and significant improvement in performance over the pure Help- First approach. However, this improvement is not enough to gain a speedup > 1.00 for finegrained nested parallelism in certain situations. The Task Depth Control was found to have the best overall performance between all three implementations in all tested environments. en
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof Masters Thesis - University of Auckland en
dc.relation.isreferencedby UoA99264781303902091 en
dc.rights 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. en
dc.rights Restricted Item. Available to authenticated members of The University of Auckland. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ en
dc.title Work-First in Nested Parallelism for Parallel Task en
dc.type Thesis en
thesis.degree.discipline Software Engineering en
thesis.degree.grantor The University of Auckland en
thesis.degree.level Masters en
dc.rights.holder Copyright: The Author en
pubs.elements-id 492114 en
pubs.record-created-at-source-date 2015-07-24 en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics