Operating_system_chapter_9

در نمایش آنلاین پاورپوینت، ممکن است بعضی علائم، اعداد و حتی فونت‌ها به خوبی نمایش داده نشود. این مشکل در فایل اصلی پاورپوینت وجود ندارد.




  • جزئیات
  • امتیاز و نظرات
  • متن پاورپوینت

امتیاز

درحال ارسال
امتیاز کاربر [0 رای]

نقد و بررسی ها

هیچ نظری برای این پاورپوینت نوشته نشده است.

اولین کسی باشید که نظری می نویسد “Operating system chapter 9”

Operating system chapter 9

اسلاید 1: 1Uniprocessor SchedulingChapter 9

اسلاید 2: 2Aim of SchedulingAssign processes to be executed by the processor(s)Response timeThroughputProcessor efficiency

اسلاید 3: 3

اسلاید 4: 4

اسلاید 5: 5

اسلاید 6: 6Long-Term SchedulingDetermines which programs are admitted to the system for processingControls the degree of multiprogrammingMore processes, smaller percentage of time each process is executed

اسلاید 7: 7Medium-Term SchedulingPart of the swapping functionBased on the need to manage the degree of multiprogramming

اسلاید 8: 8Short-Term SchedulingKnown as the dispatcherExecutes most frequentlyInvoked when an event occursClock interruptsI/O interruptsOperating system callsSignals

اسلاید 9: 9Short-Tem Scheduling CriteriaUser-orientedResponse TimeElapsed time between the submission of a request until there is output.System-orientedEffective and efficient utilization of the processor

اسلاید 10: 10Short-Term Scheduling CriteriaPerformance-relatedQuantitativeMeasurable such as response time and throughput

اسلاید 11: 11

اسلاید 12: 12

اسلاید 13: 13

اسلاید 14: 14PrioritiesScheduler will always choose a process of higher priority over one of lower priorityHave multiple ready queues to represent each level of priorityLower-priority may suffer starvationAllow a process to change its priority based on its age or execution history

اسلاید 15: 15

اسلاید 16: 16Decision ModeNonpreemptiveOnce a process is in the running state, it will continue until it terminates or blocks itself for I/OPreemptiveCurrently running process may be interrupted and moved to the Ready state by the operating systemAllows for better service since any one process cannot monopolize the processor for very long

اسلاید 17: 17Process Scheduling Example

اسلاید 18: 18First-Come-First-Served (FCFS)Each process joins the Ready queueWhen the current process ceases to execute, the oldest process in the Ready queue is selected

اسلاید 19: 19First-Come-First-Served (FCFS)A short process may have to wait a very long time before it can executeFavors CPU-bound processesI/O processes have to wait until CPU-bound process completes

اسلاید 20: 20Round-RobinUses preemption based on a clockAn amount of time is determined that allows each process to use the processor for that length of time

اسلاید 21: 21Round-RobinClock interrupt is generated at periodic intervalsWhen an interrupt occurs, the currently running process is placed in the read queueNext ready job is selectedKnown as time slicing

اسلاید 22: 22

اسلاید 23: 23

اسلاید 24: 24Shortest Process NextNonpreemptive policyProcess with shortest expected processing time is selected nextShort process jumps ahead of longer processes

اسلاید 25: 25Shortest Process NextPredictability of longer processes is reducedIf estimated time for process not correct, the operating system may abort itPossibility of starvation for longer processes

اسلاید 26: 26

اسلاید 27: 27

اسلاید 28: 28Shortest Remaining TimePreemptive version of shortest process next policyMust estimate processing time

اسلاید 29: 29Highest Response Ratio Next (HRRN)Choose next process with the greatest ratiotime spent waiting + expected service timeexpected service time

اسلاید 30: 30FeedbackPenalize jobs that have been running longerDon’t know remaining time process needs to execute

اسلاید 31: 31

اسلاید 32: 32

اسلاید 33: 33

اسلاید 34: 34

اسلاید 35: 35

اسلاید 36: 36

اسلاید 37: 37

اسلاید 38: 38

اسلاید 39: 39

اسلاید 40: 40Fair-Share SchedulingUser’s application runs as a collection of processes (threads)User is concerned about the performance of the applicationNeed to make scheduling decisions based on process sets

اسلاید 41: 41

اسلاید 42: 42Traditional UNIX SchedulingMultilevel feedback using round robin within each of the priority queuesIf a running process does not block or complete within 1 second, it is preemptedPriorities are recomputed once per secondBase priority divides all processes into fixed bands of priority levels

اسلاید 43: 43BandsDecreasing order of prioritySwapperBlock I/O device controlFile manipulationCharacter I/O device controlUser processes

اسلاید 44: 44

32,000 تومان

خرید پاورپوینت توسط کلیه کارت‌های شتاب امکان‌پذیر است و بلافاصله پس از خرید، لینک دانلود پاورپوینت در اختیار شما قرار خواهد گرفت.

در صورت عدم رضایت سفارش برگشت و وجه به حساب شما برگشت داده خواهد شد.

در صورت بروز هر گونه مشکل به شماره 09353405883 در ایتا پیام دهید یا با ای دی poshtibani_ppt_ir در تلگرام ارتباط بگیرید.

افزودن به سبد خرید