Fan: Operatsion tizimlar 11-maruza. Jarayonlar va oqimlarni rejalashtirish. O’qituvchi: dotsent. Hamroyev A. Sh

Bu yerda m – davriy hodisalar soni, i – hodisa raqami, P(i) – hodisaning qabul qilinish davri, T(i) – hodisaga ishlov berish uchun ketgan vaqt.

•  

Rejalashtirish algoritmlari

• 1. Sikllik rejalashtirish
• 2. Ustuvor rejalashtirish
• 3. Kafolatlangan rejalashtirish
• 4. Lotereyali rejalashtirish
• 5. Adolatli rejalashtirish

Foydalanilgan adabiyotlar

• 1. Andrew S. Tanenbaum, Albert S. Woodhull. Modern Operating Systems: Third Edition, Chapter 2, Procces and Streams, 2.1. Proccesses
• 2. Гордеев А.В. Операционные системы, Глава 2
• 3.http://www.tutorialspoint.com/operating_system/os_processes.htm
• 4.http://www.tutorialspoint.com/operating_system/os_process_scheduling.htm