Lịch khai giảng trong các hệ thống thời gian thực P2
Lịch khai giảng trong các hệ thống thời gian thực P2
Scheduling of Independent Tasks This chapter deals with scheduling algorithms for independent tasks. The first part of this chapter describes four basic algorithms: rate monotonic, inverse deadline, earliest deadline first, and least laxity first. These algorithms deal with homogeneous sets of tasks, where tasks are either periodic or aperiodic. However, real-time applications often require both types of tasks. In this context, periodic tasks usually have hard timing constraints and are scheduled w