Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/36906
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: Using fundamental electrical theory for varying time quantum uni-processor scheduling
Author: Harwood, A.
Shen, H.
Citation: Journal of Systems Architecture, 2001; 47(2):181-192
Publisher: Elsevier Science BV
Issue Date: 2001
ISSN: 1383-7621
Statement of
Responsibility: 
Aaron Harwood and Hong Shen
Abstract: Given the total number of instructions to be completed on a uni-processor system and the average cycle time per instruction we introduce a method of calculating time quantum allocation to individual fine grain tasks. The main theory behind our method is based on fundamental equations describing electrical phenomenon. We show how electric circuit analysis can be used to describe the fundamental scheduling problem, and provide a framework for defining more elaborate scheduling problems such as multiprocessor and multicomputer task scheduling. As a matter of physical soundness we demonstrate through unit derivation that our electrical analogy provides proper physical quantities that are supported by current literature. Our analysis shows that variable time round-robin scheduling (VTRR) provides a more appropriate means of scheduling fine-grain tasks than constant time round-robin scheduling (CTRR). We prove that, our VTRR scheduler always completes at least one task per cycle. We show through numerical comparisons some differences between VTRR and CTRR performance.
Keywords: Uni-processor
Electric circuit analysis
Task scheduling
Description: Copyright © 2001 Elsevier Science B.V. All rights reserved.
DOI: 10.1016/S1383-7621(00)00065-5
Description (link): http://www.elsevier.com/wps/find/journaldescription.cws_home/505616/description#description
Published version: http://dx.doi.org/10.1016/s1383-7621(00)00065-5
Appears in Collections:Aurora harvest 6
Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.