pdf

Improvement of priority bitmap scheduling algorithm for real-time system

  • 2013-09-19
  • 193.04KB
  • Points it Requires : 1

Real-time operating systems require fast speed and predictability, and must ensure that real-time tasks are completed within the required time. This paper describes the mechanism of the priority bitmap scheduling algorithm and then proposes improvements in terms of the number of tasks supported, the required data space, and the processing of multiple tasks of the same priority.

unfold

You Might Like

Uploader
mamselc
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×