Periodic Job Scheduling in Heterogeneous Environments
Date Issued
2007
Date
2007
Author(s)
Lee, Ho-Hsuan
DOI
en-US
Abstract
This paper consider a scheduling problem for periodic jobs
in a heterogeneous environment. There are m heterogeneous processors and n identical jobs. Jobs are available one at a time periodically. Each job is assigned to a processor. The goal is to minimizes the summation of completion time of all jobs.
We propose a Minimum-Completion-First (MCF) for scheduling identical and periodic jobs to heterogeneous processors. We show that MCF is optimal under the restriction that the number of jobs is smaller than the amount of time unit for a fastest processor to process a job. We also conduct experiments to illustrate that MCF produces excellent schedules in general cases.
Subjects
週期性工作
同質工作
排程
異質處理器
最佳解
periodic job
identical job
scheduling
heterogeneous processors
optimal
Type
thesis