Least-space-time-first scheduling algorithm: A policy for complex real-time tasks in multiple processor systems

Bo-Chao Cheng, Alexander D Stoyenko , Thomas J Marlowe
{"title":"Least-space-time-first scheduling algorithm: A policy for complex real-time tasks in multiple processor systems","authors":"Bo-Chao Cheng,&nbsp;Alexander D Stoyenko ,&nbsp;Thomas J Marlowe","doi":"10.1016/0066-4138(94)90007-8","DOIUrl":null,"url":null,"abstract":"<div><p>Significant prior work exists on scheduling for the ‘simple-tasks-single-processor’, ‘simple-tasks-multiple-processor’, and ‘complex-tasks-single-processor’, but few researchers have yet considered the ‘complex-tasks-multiple-processor’ model. We propose a new algorithm, Least Space-Time First (LSTF), to deal with the general ‘complex-task-multiple-processor’ model. We demonstrate that LSTF outperforms the Highest-Level-First, Earliest-Deadline-First and Least-Laxity-First scheduling disciplines in the sense of minimizing maximum tardiness of a set of tasks. LSTF can gracefully incorporate some realistic overhead assumptions, including context switch and communication. The Unit Precedence Graph and Soft-Precedence Edges significantly facilitate implementation of LSTF.</p></div>","PeriodicalId":100097,"journal":{"name":"Annual Review in Automatic Programming","volume":"18 ","pages":"Pages 33-38"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0066-4138(94)90007-8","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Review in Automatic Programming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0066413894900078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Significant prior work exists on scheduling for the ‘simple-tasks-single-processor’, ‘simple-tasks-multiple-processor’, and ‘complex-tasks-single-processor’, but few researchers have yet considered the ‘complex-tasks-multiple-processor’ model. We propose a new algorithm, Least Space-Time First (LSTF), to deal with the general ‘complex-task-multiple-processor’ model. We demonstrate that LSTF outperforms the Highest-Level-First, Earliest-Deadline-First and Least-Laxity-First scheduling disciplines in the sense of minimizing maximum tardiness of a set of tasks. LSTF can gracefully incorporate some realistic overhead assumptions, including context switch and communication. The Unit Precedence Graph and Soft-Precedence Edges significantly facilitate implementation of LSTF.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最小空间优先调度算法:多处理器系统中复杂实时任务的调度策略
在“简单任务-单处理器”、“简单任务-多处理器”和“复杂任务-单处理器”的调度上已有大量的前期工作,但很少有研究人员考虑“复杂任务-多处理器”模型。我们提出了一种新的算法,最小时空优先(LSTF),以处理一般的“复杂任务-多处理器”模型。我们证明了LSTF在最小化一组任务的最大延迟的意义上优于最高级优先、最早截止日期优先和最松散优先的调度原则。LSTF可以优雅地合并一些实际的开销假设,包括上下文切换和通信。单元优先图和软优先边极大地促进了LSTF的实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Author index Foreword Keyword index Author index Preface
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1