Priority and dynamic quantum time algorithms for central processing unit scheduling
Central Processing Unit scheduling is a key concept in computer multitasking, multiprocessing operating system and real‐ time operating system designs. Scheduling refers to the way processes are assigned to run on the Central Processing Unit. Central Processing Unit is scheduled using different type...
محفوظ في:
المؤلف الرئيسي: | Mohammed, Maysoon A. |
---|---|
التنسيق: | أطروحة |
اللغة: | English |
منشور في: |
2018
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://umpir.ump.edu.my/id/eprint/23477/1/Priority%20and%20dynamic%20quantum%20time%20algorithms%20for%20central%20processing%20unit%20scheduling.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A new priority rule cloud scheduling technique that utilizes gaps to increase the efficiency of jobs distribution
بواسطة: Saydul Akbar, Murad
منشور في: (2023) -
Optimization grid scheduling with priority base and bees algorithm
بواسطة: Ahmed, Mohammed Shihab
منشور في: (2014) -
Multi-round divisible real-time scheduling algorithm on multiprocessor platforms
بواسطة: Razmara, Pegah
منشور في: (2015) -
Real time scheduling for autonomous mobile robots using genetic algorithm and constraint based reasoning
بواسطة: Mohammed Hasan, Ammar Abdo
منشور في: (2006) -
Optimizing accuracy in deriving priorities in analytic hierarchy process using evolutionary computing
بواسطة: Zakaria , Nur Farha
منشور في: (2010)