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...
Saved in:
主要作者: | Mohammed, Maysoon A. |
---|---|
格式: | Thesis |
語言: | 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)