ISCAS OpenIR  > 互联网软件技术实验室
优先级有限时的单处理器静态优先级调度
Alternative Titleuniprocessor static priority scheduling with limited priority levels
王保进; 李明树; 王志刚
2006
Source软件学报
Volume17Issue:3Pages:602-610
English Abstract静态优先级调度在实际应用中经常受到系统支持的优先级个数的影响,当任务个数多于系统优先级个数时,需要将几个任务优先级映射成一个系统优先级.这可能引起优先级映射问题,使映射前可调度的系统(任务集合)在映射后变得不可调度.解决这一问题需要减少时间复杂度的映射算法和判定映射后任务可调度性的充分必要条件主要存在3种映射算法:(1)按照任务优先级递减顺序进行映射的DPA(decreasingpriorityassignment)算法;(2)按照优先级递增顺序进行映射的IPA(Increasingpriorityassignment)算法;(3)阈值段间映射法(thresholdsegmentmapping,简称TSM).描述了3种算法的实现和判定条件,论述并证明了算法特性,分析并通过仿真实验比较了算法的性能,最后总结了3种算法各自的适用场合.比较结果和结论对实时嵌入式系统的设计和实现具有一定的参考价值.
Indexed Typeei ; cscd
Keyword优先级映射 Dpa算法 Ipa算法 抢占阈值 Tsm算法
Department互联网软件技术实验室
Language中文
CSCD IDCSCD:2351984
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/2731
Collection互联网软件技术实验室
Recommended Citation
GB/T 7714
王保进,李明树,王志刚. 优先级有限时的单处理器静态优先级调度[J]. 软件学报,2006,17(3):602-610.
APA 王保进,李明树,&王志刚.(2006).优先级有限时的单处理器静态优先级调度.软件学报,17(3),602-610.
MLA 王保进,et al."优先级有限时的单处理器静态优先级调度".软件学报 17.3(2006):602-610.
Files in This Item:
File Name/Size DocType Version Access License
20061703602.pdf(433KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[王保进]'s Articles
[李明树]'s Articles
[王志刚]'s Articles
Baidu academic
Similar articles in Baidu academic
[王保进]'s Articles
[李明树]'s Articles
[王志刚]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[王保进]'s Articles
[李明树]'s Articles
[王志刚]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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