Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Applications》 2010-16
Add to Favorite Get Latest Update

Linear approximate analysis approach of fixed priority scheduling

MO Tie-qiang,PENG Hao Department of Computer Science,Hunan International Economics University,Changsha 410205,China  
By the approaches of being linearly close to the workload of tasks in hard real-time system the closer response time upper bound can be used to decrease the running time.At the same time it is linear in time of complexity for the upper bound in the sufficient schedulable tests of task sets.In interactive system design tools,system optimization via search,and admission of new tasks into dynamic systems,this new linear upper bound can considerably improve efficiency of test.Further,it is wide in application for the scheduling model without the limit of deadline and jitter.The pertinent experiments show that the method of utilizing the approximate upper time has improved the efficiency of exact test of the schedulability.
【Fund】: 湖南省高等学校科学研究项目(No.09C597)~~
【CateGory Index】: TP368.11
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Co-citations】
Chinese Journal Full-text Database 1 Hits
1 MO Tie-qiang,DUAN Shan(Department of Computer Science,Hunan International Economics University,Changsha Hunan 410205,China);Scheduling analysis of linear approximate response time in hard real-time system[J];Journal of Computer Applications;2010-02
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved