ERA

Download the full-sized PDF of Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel ProcessorsDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R32B8VP3Q

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Approximation Algorithms for Multi-processor Task Scheduling Problems on Identical Parallel Processors Open Access

Descriptions

Other title
Subject/Keyword
Scheduling
Approximation
Multi-Processing
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Khakpash, Saber
Supervisor and department
Salavatipour, Mohammad (Computing Science)
Examining committee member and department
Salavatipour, Mohammad (Computing Science)
Stewart, Lorna (Computing Science)
Elmallah, Ehab (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2013-07-04T09:32:48Z
Graduation date
2013-11
Degree
Master of Science
Degree level
Master's
Abstract
In this thesis we present approximation algorithms for some multi-processor task scheduling problems. In a scheduling problem, there is a set of processors P that can be used to process a set of tasks T and the goal is to find a feasible scheduling of the tasks on the processors, while optimizing an objective function. In a multi-processor task scheduling problem, tasks can be executed on several processors simultaneously. In scheduling problems, tasks can be preemptive or non-preemptive. Preemptive tasks can be interrupted during their execution and resumed later with no cost. In contrast, a non-preemptive task cannot be interrupted during its execution. In Chapter 2 we propose polynomial time algorithms using linear programming to solve the preemptive scheduling problems for minimizing the maximum completion time, the maximum latency, and the maximum flow time. In Chapter 3 we consider two non-preemptive scheduling problems: the problem of minimizing the maximum completion time when tasks have minimum degree of parallelism, and problem of minimizing the maximum flow time. In Chapter 4 we consider online scheduling of multi-processor tasks with minimum degree of parallelism. In online scheduling, the scheduler does not have access to the entire input instance initially and the scheduler will have access to tasks' characteristics over time. We show that it is not possible for an online scheduler to find a feasible scheduling for all input instances of the problem. We propose a bicriteria (O(log m),1)-approximation algorithm for the problem.
Language
English
DOI
doi:10.7939/R32B8VP3Q
Rights
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-04-24T22:35:54.132+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 457803
Last modified: 2015:10:12 18:07:15-06:00
Filename: Khakpash_Saber_Fall 2013.pdf
Original checksum: 2104707691600f439d27ca42d46569e2
Well formed: false
Valid: false
Status message: Lexical error offset=452407
Page count: 50
Activity of users you follow
User Activity Date