ارسل ملاحظاتك

ارسل ملاحظاتك لنا







يجب تسجيل الدخول أولا

Scheduling Algorithms for CPU

المصدر: المجلة الليبية لعلوم التعليم
الناشر: الجمعية الليبية لعلوم التعليم
المؤلف الرئيسي: Baka, Raheel (Author)
مؤلفين آخرين: Elobeidi, Mofida (Co-Author)
المجلد/العدد: ع3
محكمة: نعم
الدولة: ليبيا
التاريخ الميلادي: 2021
الشهر: فبراير
الصفحات: 24 - 39
رقم MD: 1439916
نوع المحتوى: بحوث ومقالات
اللغة: الإنجليزية
قواعد المعلومات: EduSearch
مواضيع:
كلمات المؤلف المفتاحية:
Job Scheduling | CPU Scheduling | Multilevel Feedback Queue | Process Scheduling | Time quantum | Turn-Around-Time | Waiting-Time | Context-Switching | MLFQS(Multilevel Feed Back Queue Scheduling) | MLQS (Multilevel Queue Scheduling)
رابط المحتوى:
صورة الغلاف QR قانون
حفظ في:
المستخلص: The process scheduling, is one of the most important tasks of the operating system. We present in this paper some types of scheduling algorithms of CPU. One of the most common scheduling algorithms used by the most operating systems is the Round Robin method in which, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice) circularly. But the most important issue in RR algorithm, which highly affects its efficiency. It determines the amount of the time quantum. Assigning very small and very large values for this parameter, will lead to performance decrease due to increasing context switching overhead, and degradation of the RR method to FCFS algorithm consequently. We will suggest a solution of allocated time quantum.

عناصر مشابهة