Performance Analysis of Different Scheduling Processor Based for Real Time Systems
| dc.contributor.author | Nahid Mohammed Issa Ghanawa | |
| dc.date.accessioned | 2022-11-24T09:30:25Z | |
| dc.date.available | 2022-11-24T09:30:25Z | |
| dc.date.issued | 2019-04 | |
| dc.description | A Thesis Submitted in Fulfilment for the Degree 0fM.Sc. in Embedded Systems | en_US |
| dc.description.abstract | Abstract:- Process scheduling selects from among the processes that are ready (in ready queue) to execute so the CPU can be allocated to one of them. CPU scheduling is important because when we have multiple runnable processes, it can have a big effect on resource utilization and the overall perfonnance of the system. this project discussed three types of non- preemptive scheduling algorithms, first come first served (FCFS), shortest job first(SJF) scheduling and priority scheduling to compare their efficiency perfonnance in terms of: average waiting time, average turnaround time, utilization and throughput. The objective is to know which algorithm is more suitable for a certain process. Many tasks were performed by the three algorithms, and we obtained a set of results fiom samples were taken. noticed that they were close together, so average results for 1000 samples was taken to get more accuracy. It was found that the best algorithm is SIF , F CF S algorithm is better for processes that have a longer processing time, and priority is better in cases where tasks are sorted according to their priority. | en_US |
| dc.description.sponsorship | Dr: Ahmed Mohammed E1-hassan | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/18097 | |
| dc.publisher | ALNEELAIN UNIVERSITY | en_US |
| dc.subject | algorithms | en_US |
| dc.title | Performance Analysis of Different Scheduling Processor Based for Real Time Systems | en_US |
| dc.type | Thesis | en_US |