Chapter -5 QUALITY OF SERVICE (QOS) PLATFORM DESIGN FOR REAL TIME MULTIMEDIA APPLICATIONS
|
|
- Rosamond Carr
- 5 years ago
- Views:
Transcription
1 Chapter -5 QUALITY OF SERVICE (QOS) PLATFORM DESIGN FOR REAL TIME MULTIMEDIA APPLICATIONS
2 Chapter 5 QUALITY OF SERVICE (QOS) PLATFORM DESIGN FOR REAL TIME MULTIMEDIA APPLICATIONS 5.1 Introduction For successful real time data transmission we have developed a layered architecture as a QoS platform and in our proposed architecture, Power and Delay Optimized AODV (PDO AODV) protocol has been designed in the network layer of Mobile Adhoc Network with the improved mechanism of optimizing delay and residual battery power during packet processing and forwarding in a conventional AODV protocol. In the proposed work, a new L-HCCA scheme has been proposed which works for channel access instead of Polling the stations for group applications (in HCCA) is explained in detail in next section and it is based on LLQ scheduling algorithm which performs better when supplies realtime group information to the PDO AODV (Power and Delay Based Optimized Adhoc On Demand Distance Vector Routing ) Protocol.We have given great importance to the existence of diversified packet types in our target network. So, it is necessary to filter delay sensitive packets from their generic counterparts such as beset effort packets for further processing. Selection of real time packets from the common traffic flow has been incorporated using a flow control module. Components of the proposed platform perform the functionalities of delay, power and jitter management in the channel during real-time data transmission. Specifically video file transfer has been taken during simulation in NetSim Ver The Proposed Design In our proposed architecture, Power and Delay Optimized AODV (PDO AODV) protocol has been designed in the network layer of Mobile Adhoc Network. It employs an improved mechanism for optimizing delay and residual battery power during packet processing and forwarding using a conventional AODV protocol. Fig.5.1 shows the flow diagram of our proposed Protocol in Network Layer.Fig.5.2 describes the flow chart of checking congested nodes. 79
3 Fig.5.1: Flow diagram of Proposed Architecture 80
4 Fig.5.2: Flowchart to check congested node Fig.5.3 shows the basic block diagram of the proposed QoS platform discussed above. Basically the proposed Optimized PDO AODV Protocol functions are having communicational co-ordination with new and improved proposed MAC Channel access mechanism at the Data link layer. The QoS flow is controlled and monitored by Prioritized QoS Flow Control Mechanism at the confluence of both the layers. Again an enhanced real time task scheduler is used which is an extensive proposal based on EDF (Earliest Deadline First). This real time scheduler which intelligently schedules the real time tasks efficiently manages all the events such that every real time tasks are completed within their required deadline. This helps to maintain the QoS in the platform by reducing congestion and minimizing end-to-end delay for real time applications. 81
5 Fig.5.3: Block Diagram of QoS Platform Architecture The IP (Internet Protocol) Controller controls the overall functionality of the Network layer with PDO AODV protocol management and MAC Controller orders the L- HCCA Channel Access Mechanism as per functionality explained in Fig.4.The following section briefly explains about components used at the relay nodes as part of our proposed QoS platform Routing Strategy In our proposed QoS framework, the Routing logic is implemented in the PDO AODV protocol. According to the protocol, the core routing engine at every station has three sub modules as described above and each of them execute smart routine during the transmission. Objective of our framework which is to transmit multimedia data transmission successfully, is achieved by using an intelligence based path finding and packet forwarding through suitable nodes so that the real time packets transmit with highest priority and with QoS satisfaction. Fig.6 shows the functional diagram at relay node for Quality of service Provision. 82
6 5.2.2 Admission control Policy This module checks availability of required resources during start of the communication at source. After the required resources are reserved for a particular real time flow, the transmission starts as per the QoS requirement. When the transmission time ends, the allocated resources are released. As we have designed the frame work for multimedia data flow, our application is delay and jitter sensitive. Our admission control policy works as per proposed algorithm in PDO AODV protocol for uniformity of jitter interval and minimized latency. Fig.5.4 Relay node modules in our QoS Framework QoS Checking After resources are allocated, these modules checks the QoS satisfaction for the connection, by matching the validity of reservations made during channel creation. These QoS parameters are based on bandwidth, processing time, rate of processing, deadline and bounded delay Resource Reservation This module is responsible for physical assignment of required resources reserved for the connection. At the relay nodes this module has facility of re-negotiation and regeneration of resources to sustain the QoS connection. Resource Renegotiation/ Regeneration - According to change of QoS demand of the channel due to congestion or overloaded condition this module has provision of regeneration of QoS resources. Flow Control Policy - Internally the frame transfer policy using the required mechanism is used 83
7 in this module and depending on the QoS channel if few frames could not be acknowledged properly then they will b re transmitted Comparison with AQA AODV An improved QoS approach for reducing end to end delay in time sensitive data transmission has been presented in [123] known as AQA-AODV in which route formation takes place as per requirement of the application. An improved link and path based bandwidth calculation has been done here that provides information to the sender node regarding the state of the network, so that the required transmission rate may be changed by the source. Paper [124] presents ILP (Integer Linear Programming) based QoS architecture for optimization of MANET routing in term of QoS satisfaction in delay and bandwidth. Using such architecture they are not only able to reduce total energy consumption in the network but also there is prolonged network life time and better computational performance. We have compared our QoS Cross layer platform with the above two approaches and the comparison results are presented in the simulation section. 5.3 Improved Real Time Task Scheduler The Rate Monotonic Algorithm (RMA) is used as an improved mechanism to assign fixed priorities to real time applications with an intention to improve the possibility of parallel schedulable tasks. Simultaneous execution of real-time tasks without missing deadline of any task is possible by checking the schedulable status of a group of tasks at a time. According to this algorithm the priority of every task is assigned according to its time period, with an intention to provide higher priority to short time period tasks.[125 ].If the period of task t1 is shorter than the period of task t2, then as per RMA s rule, t1 has higher priority than t2. This criteria is checked for all the group members of the real-time applications in a group. So far, RMA is considered to be the finest fixed priority based algorithm [125 ]. 84
8 Fig. 5.5: Real Time Scheduling using RMA Sometimes after getting maximum CPU utilization, few processes do not achieve their deadlines. In such cases, altering priority levels works successfully depending on other prioritized deadline based real-time tasks in the group. The Real-time packet scheduling module controls multiple real time tasks generated in the same time period with different deadlines using event-driven scheduling method. In event driven scheduling, which is a preemptive type, a higher priority real time task can preempt a low priority task and can be executed to achieve its deadline. The QoS Flow Control Mechanism This Module controls and monitors proper flow of Qos parameters in the channel. Tasks such as Admission control Policy, QoS checking, Resource Reservation and Flow Control are the main function of this module which is described in the next section. 5.4 Real Time Task Scheduling Issues Minimization of Latency-During the period when any real time transmission or any real time application takes place, the system should response very quickly and serves it as quickly as possible. So, event latency refers to the amount of time elapses from the time when an event occurs to when it is serviced. Fig.4.6 shows the event latency and the performance of real time systems are affected by two types of latency, such as interrupt latency and dispatch latency. 85
9 Fig.5.6 Event Latency i. Interrupt latency As Fig 5.7 shows, it is the period of time from the interrupt arrives for real time processing in prioritized way to the time it is actually serviced. Fig.5.7 Interrupt Latency ii. Dispatch latency It is the amount of time required for the real time scheduler to stop one process and start another. 86
10 Fig.5.8: Dispatch Latency Dispatch latency can be minimized by allowing the real time transmission with dynamically preferred access to the processors of the nodes by utilizing preemptive kernels at the MANET nodes. As the figure above shows, the conflict phase has two constituents. First one is the preemption of any process running in the kernel, and second one is releasing the resources from low priority jobs such as normal packet transmission and assigns them to the real time multimedia data transmission. 5.5 Rate Monotonic Scheduling (RMS) Priority to the processes are assigned according to the inverse of the period of the real time applications. In this case the priority remains static. If the period is short in comparison to another application, then its priority will be higher, and another application with longer period will have lower priority. Suppose P1 and P2 are two real time applications transmitting over the internet. P1 with period 20 and deadline 50 nano seconds. P2 has period 35 and deadline 100 nano seconds. As per Rate Monotonic scheduling P1 will be assigned a higher priority than P2. 87
11 Fig.5.9: Real time process prioritization in Rate Monotonic Scheduling In fig. 5.9 above, the system remains idle from 75 to 100 nanoseconds of time, but the deadline of both applications are achieved without missing deadline. Fig.5.10 Missed deadlines with RMS As shown in Fig.5.10, Deadline for each process requires that it completes the processors burst by the start of its next period. If the task is scheduled in such a way that P2 has higher priority than P1, then as the figure below shows there will be missing deadlines. 5.6 Proposed RR-DSR Scheduling Algorithm In order to facilitate the successful transmission of real time applications in MANET, we have proposed an improved algorithm for real time scheduling called RR- 88
12 DSR (Round-Robin with Deadline based Shortest Remaining Time), which fastens the real time data processing by the processors at the relay nodes when multiple real time packets to be forwarded or processed at the nodes. As shown in Fig. 5.8, this proposal is based on round robin and SRTF (Shortest Remaining Time First) scheduling algorithm. Our proposed algorithm can be explained with help of an example. Suppose there are four realtime applications p1, p2, p3 and p4 with deadlines p1(25), p2(28), p3(35) and p4(33). They are assigned a time slice of 2 nano second in round robin method initially. Fig.5.11 System Structure of Proposed RR-DSR Algorithm In order to facilitate the successful transmission of real time applications in MANET, we have proposed an improved algorithm for real time scheduling called RR- DSR (Round-Robin with Deadline based Shortest Remaining Time), which fastens the real time data processing by the processors at the relay nodes when multiple real time packets to be forwarded or processed at the nodes. As shown in Fig. 5.12, this proposal is based on round robin and SRTF (Shortest Remaining Time First) scheduling algorithm. Our proposed algorithm can be explained with help of an example. Suppose there are four real time applications p1, p2, p3 and p4 with deadlines p1(25), p2(28), p3(35) and p4(33). They are assigned a time slice of 2 nano second in round robin method initially. 89
13 Fig.5.12: Proposed RR-DSR Scheduling (Part 1) After 24 units of time, as shown in fig 5.13 there will be again priority checking based on shortest remaining deadline time. According to the algorithm, the new sequence of application processing will be p1(1),p2(3),p4(4) and p3(5), and all the applications can achieve their transmission within deadline. Fig.5.13: Proposed RR-DSR Scheduling (Part 2) 5.7 QoS Provision in Proposed Approach Over heterogeneous networks with multiple technologies, the objective of QoS satisfaction is to provide prioritized service with dedicated bandwidth, jitter and latency control as demanded by specified applications and minimization of data drop rate by avoiding starvation of other low prioritized tasks in other flows. QoS represents a specific client-oriented requirement serviced as a guarantee to the users. Therefore, in telecommunication service QoS offers better service to certain traffic over varieties of network. Our QoS framework satisfies the following criteria for real-time applications. 90
14 1) Throughput: Our QoS platform satisfies maximum throughput during online games, video file transmission with minor delay that does not affect the overall transmission and can be completed before the deadline. Online Games such as Popular Games Guild Wars and Counter Strike can be both played with 60 Kbps connection. 2) End-to-end delay: This delay is a major factor during online playing of games. The delay between any two commands issued by the player and the time whether it immediately executed on the screen matters during the game. For optimal performance, 50 ms or less in video games is permissible. This value again differs from game to game. 3) Jitter and Packet Loss Rate: Jitter is the delay variation between packets transmission during an application. Non-uniform jitter creates problem during an online game. Jitter problems causes irregular packet delivery, receiving packets late causing the playing of the game in a horrible state. If the packets are not received in time or received in wrong order, then the previous played information are lost 4) Delay: Delay in multimedia data transmission is due to processes involved in transfer of remote visualizations with video and image transformation techniques using some algorithms and the amount of data transfer. 5) Bandwidth: Speed of link or bandwidth plays important part during the transmission in the channel. A higher bandwidth ensures uniformity of jitter and better performance in multimedia applications. 91
15 Fig.5.14: Block diagram of our QoS Framework at source, relay node and destination Fig.5.14 describes the QoS framework at source, Relay nod and the destination node. Different modules of our designed QoS frame work perform important tasks to support end to end QoS satisfaction in a connection. These modules are designed as objects in the proposed framework during network setup. Functionalities performed by individual objects and connection between them is briefly discussed in the following section. 92
16 5.8 Components of the Proposed Framework 1) Routing Logic: In our proposed QoS framework, the Routing logic is implemented in the PDO AODV protocol. According to the protocol, the core routing engine at every station has three sub modules as described above and each of them execute smart routine during the transmission. Objective of our framework which is to transmit multimedia data transmission successfully, is achieved by using an intelligence based path finding and packet forwarding through suitable nodes so that the real time packets transmit with highest priority and with QoS satisfaction. 2) Admission control Policy: This module checks availability of required resources during start of the communication at source. After the required resources are reserved for a particular real time flow, the transmission starts as per the QoS requirement. When the transmission time ends, the allocated resources are released. As we have designed the frame work for multimedia data flow, our application is delay and jitter sensitive. Our admission control policy works as per proposed algorithm in PDO AODV protocol for uniformity of jitter interval and minimized latency. 3) QoS Checking: After resources are allocated, these modules checks the QoS satisfaction for the connection, by matching the validity of reservations made during channel creation. These QoS parameters are based on bandwidth, processing time, rate of processing, deadline and bounded delay. 4) Resource Reservation: This module is responsible for physical assignment of required resources reserved for the connection. At the relay nodes this module has facility of re-negotiation and regeneration of resources to sustain the QoS connection. 5) Resource Renegotiation/Regeneration: According to change of QoS demand of the channel due to congestion or overloaded condition this module has provision of regeneration of QoS resources. 6) Flow Control Policy: Internally the frame transfer policy using the required mechanism is used in this module and depending on the QoS channel if few frames could not be acknowledged properly then they will b re transmitted. 93
17 5.9 Comparison with other similar QoS Architecture In paper [123] a better QoS approach for reducing end to end delay in time sensitive data transmission has been presented known as AQA-AODV in which route formation takes place as per requirement of the application. An improved link and path based bandwidth calculation has been done here that provides information to the sender node regarding the state of the network, so that the required transmission rate may be changed by the source. Paper [124] presents ILP (Integer Linear Programming) based QoS architecture for optimization of MANET routing in term of QoS satisfaction in delay and bandwidth. Using such architecture they are not only able to reduce total energy consumption in the network but also there is prolonged network life time and better computational performance. We have compared our QoS Cross layer platform with the above two approaches and the comparison results are presented in the simulation section Simulation of Qos Platform with Real Time Scheduler Design NetSim is a discrete event simulator which has finite state machine modeling strategy and a useful simulation tool for designing of both wired and wireless networks with wide variety of network and research applications. It provides depth and flexibility of simulating various types of applications. This has facility of almost all supported standard protocols in MANET with source code in C language, assimilated animation with outlining and correcting error provision. Its MAC layer is demonstrated as per IEEE layering slotted CSMA / CA, unslotted CSMA / CA with Super frame transmission scheme and Beacon transmission utility. Table 5.1 shows the simulation parameters used. 94
18 Table 5.1: Simulation Parameters Parameter Name Parameter Value Channel Type Wireless Channel Radio Propagation Model Two Ray Ground Network Interface Type Wireless Phy Type of Traffic V B R Simulation Time 2 Minutes MAC Type Mac/802_11 Max Speed 50 m/s Network Size 1600 x 1600 Mobile Nodes 120 Packet Size 512 Kb Interface queue Type Queue/Droptail Protocol PDO AODV with QoS Simulator NETSIM The following section describes the simulation results with graphs and comparative analysis of our approach with other efficient approaches. We have simulated the network performance by sending a video file vid.mp4 of size 400MB using our proposed QoS architecture and again using the same file in a normal network without QoS, and presented the simulation results in the following section. Fig. 5.15: Jitter Analysis of two video files 95
19 We have transmitted two video files during our simulation. The simulation was carried out for 2 minutes. The graph in fig 5.15 reveals the fact that a video file transmitted using our proposed PDO AODV Protocol with QoS architecture send packets with uniform jitter. As the figure shows that different segments of the file are reached with equal latency one after the other so that there is no video streaming problem and the video data which is a real time application reaches successfully at its destination with all specified Quality of Service specification. Fig.5.16: Bandwidth Analysis of two video files. Fig 5.16 shows the comparison of bandwidth in which two video files were sent. Video file 1 was transmitted in our QoS platform which exhibits almost uniform bandwidth while transmission throughout the channel with minor deviation satisfying QoS criteria whereas video file 2 when transmitted without our platform in normal channel using AODV protocol reveals high deflection of bandwidth as shown in the graph in fig Fig.5.17: Delay comparison of video file transmission 96
20 Fig.5.17 shows the graphical analysis of a video file vid.mp4 when transmitted with and without our QoS architecture. We can observe that there is sufficient reduction in average delay of video file transmission in the conventional AODV concept that our proposed improved QoS architecture. Fig 5.18: Comparison of Avg. Power consumption Fig.5.18 is an output graph when a video file vid.mp4 was transmitted using both approaches. In the QoS approach with PDO AODV it shows comparatively less power consumption in comparison to the approach without using QoS architecture. Fig.5.19 Comparison of Network Life time As discussed above, we have compared our approach with two other important cross layer approaches similar with our approach, but they have used different technique for efficient multimedia transmission. Fig.5.19 shows that when network life time was 97
21 compared between the said three QoS methods, our approach has higher network life time than other two platforms. Fig 5.20: Comparison of Packet Delivery Ratio Similarly when compared for packet delivery ratio(pdr), Fig 5.20 clearly shows that our PDO AODV based QoS platform outperforms than the other two ILP based [124] and AQA-AODV based [123] QoS architectures Summary In this research paper we have presented a cross layer architecture for supporting quality of service provision in real-time application specifically for multimedia video data transmission. The issues of non-uniform jitter and video streaming problem due to delay at multiple stations have been discussed and eliminated up to a great extent by introducing intelligent and power efficient logic at the smart modules of network layer and data link layer as well as with effective communication between them. There is a also a guard module for controlling the QoS flow in the channel, which increases reliability of multimedia transmission over the network. Simulation result shows better performance of our QoS platform when compared with other similar approach. 98
Chapter -6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION
Chapter -6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION Chapter 6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION 6.1 Introduction Supporting Quality of Service
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
More informationOPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5
OPERATING SYSTEMS CS3502 Spring 2018 Processor Scheduling Chapter 5 Goals of Processor Scheduling Scheduling is the sharing of the CPU among the processes in the ready queue The critical activities are:
More informationCPU Scheduling. CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections )
CPU Scheduling CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections 6.7.2 6.8) 1 Contents Why Scheduling? Basic Concepts of Scheduling Scheduling Criteria A Basic Scheduling
More informationProperties of Processes
CPU Scheduling Properties of Processes CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait. CPU burst distribution: CPU Scheduler Selects from among the processes that
More informationCSE 4/521 Introduction to Operating Systems
CSE 4/521 Introduction to Operating Systems Lecture 9 CPU Scheduling II (Scheduling Algorithms, Thread Scheduling, Real-time CPU Scheduling) Summer 2018 Overview Objective: 1. To describe priority scheduling
More information1.1 CPU I/O Burst Cycle
PROCESS SCHEDULING ALGORITHMS As discussed earlier, in multiprogramming systems, there are many processes in the memory simultaneously. In these systems there may be one or more processors (CPUs) but the
More informationChapter 5: CPU Scheduling
Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm Evaluation Chapter 5: CPU Scheduling
More informationOperating System Concepts Ch. 5: Scheduling
Operating System Concepts Ch. 5: Scheduling Silberschatz, Galvin & Gagne Scheduling In a multi-programmed system, multiple processes may be loaded into memory at the same time. We need a procedure, or
More informationCPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)
CPU Scheduling Daniel Mosse (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process
More informationTDDD82 Secure Mobile Systems Lecture 6: Quality of Service
TDDD82 Secure Mobile Systems Lecture 6: Quality of Service Mikael Asplund Real-time Systems Laboratory Department of Computer and Information Science Linköping University Based on slides by Simin Nadjm-Tehrani
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
More informationSubject Name: OPERATING SYSTEMS. Subject Code: 10EC65. Prepared By: Kala H S and Remya R. Department: ECE. Date:
Subject Name: OPERATING SYSTEMS Subject Code: 10EC65 Prepared By: Kala H S and Remya R Department: ECE Date: Unit 7 SCHEDULING TOPICS TO BE COVERED Preliminaries Non-preemptive scheduling policies Preemptive
More informationCPU Scheduling Algorithms
CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating Systems Concepts with Java, by Silberschatz, Galvin, and Gagne (2007).
More informationMultimedia Systems 2011/2012
Multimedia Systems 2011/2012 System Architecture Prof. Dr. Paul Müller University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de Sitemap 2 Hardware
More informationLecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts. Scheduling Criteria Scheduling Algorithms
Operating System Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts Scheduling Criteria Scheduling Algorithms OS Process Review Multicore Programming Multithreading Models Thread Libraries Implicit
More informationCPU Scheduling: Part I ( 5, SGG) Operating Systems. Autumn CS4023
Operating Systems Autumn 2017-2018 Outline 1 CPU Scheduling: Part I ( 5, SGG) Outline CPU Scheduling: Part I ( 5, SGG) 1 CPU Scheduling: Part I ( 5, SGG) Basic Concepts Typical program behaviour CPU Scheduling:
More informationUniprocessor Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms. Three level scheduling
Uniprocessor Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Three level scheduling 2 1 Types of Scheduling 3 Long- and Medium-Term Schedulers Long-term scheduler Determines which programs
More informationChapter 20: Multimedia Systems
Chapter 20: Multimedia Systems, Silberschatz, Galvin and Gagne 2009 Chapter 20: Multimedia Systems What is Multimedia? Compression Requirements of Multimedia Kernels CPU Scheduling Disk Scheduling Network
More informationChapter 20: Multimedia Systems. Operating System Concepts 8 th Edition,
Chapter 20: Multimedia Systems, Silberschatz, Galvin and Gagne 2009 Chapter 20: Multimedia Systems What is Multimedia? Compression Requirements of Multimedia Kernels CPU Scheduling Disk Scheduling Network
More informationChapter 19: Real-Time Systems. Operating System Concepts 8 th Edition,
Chapter 19: Real-Time Systems, Silberschatz, Galvin and Gagne 2009 Chapter 19: Real-Time Systems System Characteristics Features of Real-Time Systems Implementing Real-Time Operating Systems Real-Time
More informationLECTURE 3:CPU SCHEDULING
LECTURE 3:CPU SCHEDULING 1 Outline Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time CPU Scheduling Operating Systems Examples Algorithm Evaluation 2 Objectives
More informationPractice Exercises 305
Practice Exercises 305 The FCFS algorithm is nonpreemptive; the RR algorithm is preemptive. The SJF and priority algorithms may be either preemptive or nonpreemptive. Multilevel queue algorithms allow
More informationScheduling. The Basics
The Basics refers to a set of policies and mechanisms to control the order of work to be performed by a computer system. Of all the resources in a computer system that are scheduled before use, the CPU
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 9 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 CPU Scheduling: Objectives CPU scheduling,
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java Thread Scheduling
More informationComputer Systems Assignment 4: Scheduling and I/O
Autumn Term 018 Distributed Computing Computer Systems Assignment : Scheduling and I/O Assigned on: October 19, 018 1 Scheduling The following table describes tasks to be scheduled. The table contains
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 10 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Chapter 6: CPU Scheduling Basic Concepts
More informationCPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University
Operating Systems (Fall/Winter 2018) CPU Scheduling Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review Motivation to use threads
More informationCHAPTER 4 CALL ADMISSION CONTROL BASED ON BANDWIDTH ALLOCATION (CACBA)
92 CHAPTER 4 CALL ADMISSION CONTROL BASED ON BANDWIDTH ALLOCATION (CACBA) 4.1 INTRODUCTION In our previous work, we have presented a cross-layer based routing protocol with a power saving technique (CBRP-PS)
More informationCPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science
CPU Scheduling Rab Nawaz Jadoon DCS COMSATS Institute of Information Technology Assistant Professor COMSATS, Lahore Pakistan Operating System Concepts Objectives To introduce CPU scheduling, which is the
More informationLecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter
Lecture Topics Today: Uniprocessor Scheduling (Stallings, chapter 9.1-9.3) Next: Advanced Scheduling (Stallings, chapter 10.1-10.4) 1 Announcements Self-Study Exercise #10 Project #8 (due 11/16) Project
More informationOVERHEADS ENHANCEMENT IN MUTIPLE PROCESSING SYSTEMS BY ANURAG REDDY GANKAT KARTHIK REDDY AKKATI
CMPE 655- MULTIPLE PROCESSOR SYSTEMS OVERHEADS ENHANCEMENT IN MUTIPLE PROCESSING SYSTEMS BY ANURAG REDDY GANKAT KARTHIK REDDY AKKATI What is MULTI PROCESSING?? Multiprocessing is the coordinated processing
More informationConcurrent activities in daily life. Real world exposed programs. Scheduling of programs. Tasks in engine system. Engine system
Real world exposed programs Programs written to interact with the real world, outside the computer Programs handle input and output of data in pace matching the real world processes Necessitates ability
More informationCS4514 Real Time Scheduling
CS4514 Real Time Scheduling Jose M. Garrido Fall 2015 Department of Computer Science 1 Periodic Tasks Typical real-time application has many tasks that need to be executed periodically Reading sensor data
More informationA Modified DRR-Based Non-real-time Service Scheduling Scheme in Wireless Metropolitan Networks
A Modified DRR-Based Non-real-time Service Scheduling Scheme in Wireless Metropolitan Networks Han-Sheng Chuang 1, Liang-Teh Lee 1 and Chen-Feng Wu 2 1 Department of Computer Science and Engineering, Tatung
More informationCPU Scheduling: Objectives
CPU Scheduling: Objectives CPU scheduling, the basis for multiprogrammed operating systems CPU-scheduling algorithms Evaluation criteria for selecting a CPU-scheduling algorithm for a particular system
More informationQuality of Service (QoS)
Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive
More informationChap 7, 8: Scheduling. Dongkun Shin, SKKU
Chap 7, 8: Scheduling 1 Introduction Multiprogramming Multiple processes in the system with one or more processors Increases processor utilization by organizing processes so that the processor always has
More information8th Slide Set Operating Systems
Prof. Dr. Christian Baun 8th Slide Set Operating Systems Frankfurt University of Applied Sciences SS2016 1/56 8th Slide Set Operating Systems Prof. Dr. Christian Baun Frankfurt University of Applied Sciences
More informationCS370: System Architecture & Software [Fall 2014] Dept. Of Computer Science, Colorado State University
Frequently asked questions from the previous class survey CS 370: SYSTEM ARCHITECTURE & SOFTWARE [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University OpenMP compiler directives
More informationSIMULATION FRAMEWORK MODELING
CHAPTER 5 SIMULATION FRAMEWORK MODELING 5.1 INTRODUCTION This chapter starts with the design and development of the universal mobile communication system network and implementation of the TCP congestion
More information8: Scheduling. Scheduling. Mark Handley
8: Scheduling Mark Handley Scheduling On a multiprocessing system, more than one process may be available to run. The task of deciding which process to run next is called scheduling, and is performed by
More informationCOSC243 Part 2: Operating Systems
COSC243 Part 2: Operating Systems Lecture 17: CPU Scheduling Zhiyi Huang Dept. of Computer Science, University of Otago Zhiyi Huang (Otago) COSC243 Lecture 17 1 / 30 Overview Last lecture: Cooperating
More informationPROCESS SCHEDULING II. CS124 Operating Systems Fall , Lecture 13
PROCESS SCHEDULING II CS124 Operating Systems Fall 2017-2018, Lecture 13 2 Real-Time Systems Increasingly common to have systems with real-time scheduling requirements Real-time systems are driven by specific
More informationOperating Systems. Process scheduling. Thomas Ropars.
1 Operating Systems Process scheduling Thomas Ropars thomas.ropars@univ-grenoble-alpes.fr 2018 References The content of these lectures is inspired by: The lecture notes of Renaud Lachaize. The lecture
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 4, April 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Reducing the Number
More informationUniprocessor Scheduling. Chapter 9
Uniprocessor Scheduling Chapter 9 1 Aim of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency 2 3 4 Long-Term Scheduling Determines which programs
More informationIntroduction to Real-Time Systems ECE 397-1
Introduction to Real-Time Systems ECE 97-1 Northwestern University Department of Computer Science Department of Electrical and Computer Engineering Teachers: Robert Dick Peter Dinda Office: L477 Tech 8,
More informationMultiprocessor and Real-Time Scheduling. Chapter 10
Multiprocessor and Real-Time Scheduling Chapter 10 1 Roadmap Multiprocessor Scheduling Real-Time Scheduling Linux Scheduling Unix SVR4 Scheduling Windows Scheduling Classifications of Multiprocessor Systems
More informationCS 326: Operating Systems. CPU Scheduling. Lecture 6
CS 326: Operating Systems CPU Scheduling Lecture 6 Today s Schedule Agenda? Context Switches and Interrupts Basic Scheduling Algorithms Scheduling with I/O Symmetric multiprocessing 2/7/18 CS 326: Operating
More informationCh 4 : CPU scheduling
Ch 4 : CPU scheduling It's the basis of multiprogramming operating systems. By switching the CPU among processes, the operating system can make the computer more productive In a single-processor system,
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne Histogram of CPU-burst Times 6.2 Silberschatz, Galvin and Gagne Alternating Sequence of CPU And I/O Bursts 6.3 Silberschatz, Galvin and Gagne CPU
More informationLecture 17: Threads and Scheduling. Thursday, 05 Nov 2009
CS211: Programming and Operating Systems Lecture 17: Threads and Scheduling Thursday, 05 Nov 2009 CS211 Lecture 17: Threads and Scheduling 1/22 Today 1 Introduction to threads Advantages of threads 2 User
More informationPerformance Evaluation of WiFiRe using OPNET
Performance Evaluation of WiFiRe using OPNET Under the guidance of: Prof. Sridhar Iyer and Prof. Varsha Apte Dept. of CSE (KReSIT) July 16, 2007 Goal Goal Building. Finding minimum slot length to support
More informationPROCESS SCHEDULING Operating Systems Design Euiseong Seo
PROCESS SCHEDULING 2017 Operating Systems Design Euiseong Seo (euiseong@skku.edu) Histogram of CPU Burst Cycles Alternating Sequence of CPU and IO Processor Scheduling Selects from among the processes
More informationScheduling of processes
Scheduling of processes Processor scheduling Schedule processes on the processor to meet system objectives System objectives: Assigned processes to be executed by the processor Response time Throughput
More informationUniprocessor Scheduling. Aim of Scheduling
Uniprocessor Scheduling Chapter 9 Aim of Scheduling Response time Throughput Processor efficiency Types of Scheduling Long-Term Scheduling Determines which programs are admitted to the system for processing
More informationUniprocessor Scheduling. Aim of Scheduling. Types of Scheduling. Long-Term Scheduling. Chapter 9. Response time Throughput Processor efficiency
Uniprocessor Scheduling Chapter 9 Aim of Scheduling Response time Throughput Processor efficiency Types of Scheduling Long-Term Scheduling Determines which programs are admitted to the system for processing
More informationCross Layer QoS Provisioning in Home Networks
Cross Layer QoS Provisioning in Home Networks Jiayuan Wang, Lukasz Brewka, Sarah Ruepp, Lars Dittmann Technical University of Denmark E-mail: jwan@fotonik.dtu.dk Abstract This paper introduces an innovative
More informationTasks. Task Implementation and management
Tasks Task Implementation and management Tasks Vocab Absolute time - real world time Relative time - time referenced to some event Interval - any slice of time characterized by start & end times Duration
More informationDepartment of Electrical and Computer Systems Engineering
Department of Electrical and Computer Systems Engineering Technical Report MECSE-6-2006 Medium Access Control (MAC) Schemes for Quality of Service (QoS) provision of Voice over Internet Protocol (VoIP)
More informationMultimedia-Systems. Operating Systems. Prof. Dr.-Ing. Ralf Steinmetz Prof. Dr. rer. nat. Max Mühlhäuser Prof. Dr.-Ing. Wolfgang Effelsberg
Multimedia-Systems Operating Systems Prof. Dr.-Ing. Ralf Steinmetz Prof. Dr. rer. nat. Max Mühlhäuser Prof. Dr.-Ing. Wolfgang Effelsberg WE: University of Mannheim, Dept. of Computer Science Praktische
More informationScheduling. Scheduling. Scheduling. Scheduling Criteria. Priorities. Scheduling
scheduling: share CPU among processes scheduling should: be fair all processes must be similarly affected no indefinite postponement aging as a possible solution adjust priorities based on waiting time
More informationLast Class: Processes
Last Class: Processes A process is the unit of execution. Processes are represented as Process Control Blocks in the OS PCBs contain process state, scheduling and memory management information, etc A process
More informationModeling a MAC Scheduler: Experiences with a DOCSIS Cable
Modeling a MAC Scheduler: Experiences with a DOCSIS Cable Network Simulation Model Jim Martin Department of Computer Science Clemson University jim.martin@cs.clemson.edu Phone: 864 656 4529 Fax: 864 656
More informationCHAPTER 2: PROCESS MANAGEMENT
1 CHAPTER 2: PROCESS MANAGEMENT Slides by: Ms. Shree Jaswal TOPICS TO BE COVERED Process description: Process, Process States, Process Control Block (PCB), Threads, Thread management. Process Scheduling:
More informationOperating Systems: Quiz2 December 15, Class: No. Name:
Operating Systems: Quiz2 December 15, 2006 Class: No. Name: Part I (30%) Multiple Choice Each of the following questions has only one correct answer. Fill the correct one in the blank in front of each
More informationFrequently asked questions from the previous class survey
CS 370: OPERATING SYSTEMS [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University L14.1 Frequently asked questions from the previous class survey Turnstiles: Queue for threads blocked
More informationCPU scheduling. Alternating sequence of CPU and I/O bursts. P a g e 31
CPU scheduling CPU scheduling is the basis of multiprogrammed operating systems. By switching the CPU among processes, the operating system can make the computer more productive. In a single-processor
More informationChapter 24 Congestion Control and Quality of Service 24.1
Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control
More informationProcesses. Overview. Processes. Process Creation. Process Creation fork() Processes. CPU scheduling. Pål Halvorsen 21/9-2005
INF060: Introduction to Operating Systems and Data Communication Operating Systems: Processes & CPU Pål Halvorsen /9-005 Overview Processes primitives for creation and termination states context switches
More informationChapter 9. Uniprocessor Scheduling
Operating System Chapter 9. Uniprocessor Scheduling Lynn Choi School of Electrical Engineering Scheduling Processor Scheduling Assign system resource (CPU time, IO device, etc.) to processes/threads to
More informationTitolo presentazione. Scheduling. sottotitolo A.Y Milano, XX mese 20XX ACSO Tutoring MSc Eng. Michele Zanella
Titolo presentazione Scheduling sottotitolo A.Y. 2017-18 Milano, XX mese 20XX ACSO Tutoring MSc Eng. Michele Zanella Process Scheduling Goals: Multiprogramming: having some process running at all times,
More informationOPERATING SYSTEMS. UNIT II Sections A, B & D. An operating system executes a variety of programs:
OPERATING SYSTEMS UNIT II Sections A, B & D PREPARED BY ANIL KUMAR PRATHIPATI, ASST. PROF., DEPARTMENT OF CSE. PROCESS CONCEPT An operating system executes a variety of programs: Batch system jobs Time-shared
More informationCPU Scheduling. Basic Concepts. Histogram of CPU-burst Times. Dispatcher. CPU Scheduler. Alternating Sequence of CPU and I/O Bursts
CS307 Basic Concepts Maximize CPU utilization obtained with multiprogramming CPU Scheduling CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait CPU burst distribution
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationLecture 2 Process Management
Lecture 2 Process Management Process Concept An operating system executes a variety of programs: Batch system jobs Time-shared systems user programs or tasks The terms job and process may be interchangeable
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationOverview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services
Overview 15-441 15-441 Computer Networking 15-641 Lecture 19 Queue Management and Quality of Service Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 What is QoS? Queuing discipline and scheduling
More informationCPU Scheduling. Schedulers. CPSC 313: Intro to Computer Systems. Intro to Scheduling. Schedulers in the OS
Schedulers in the OS Scheduling Structure of a Scheduler Scheduling = Selection + Dispatching Criteria for scheduling Scheduling Algorithms FIFO/FCFS SPF / SRTF Priority - Based Schedulers start long-term
More informationUniprocessor Scheduling
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall CPU- and I/O-bound processes
More informationPriority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies
CSCD 433/533 Priority Traffic Advanced Networks Spring 2016 Lecture 21 Congestion Control and Queuing Strategies 1 Topics Congestion Control and Resource Allocation Flows Types of Mechanisms Evaluation
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationCS3733: Operating Systems
CS3733: Operating Systems Topics: Process (CPU) Scheduling (SGG 5.1-5.3, 6.7 and web notes) Instructor: Dr. Dakai Zhu 1 Updates and Q&A Homework-02: late submission allowed until Friday!! Submit on Blackboard
More information3. Quality of Service
3. Quality of Service Usage Applications Learning & Teaching Design User Interfaces Services Content Process ing Security... Documents Synchronization Group Communi cations Systems Databases Programming
More information. 14 Byte for Acks. Due to this fact, the overhead is more relevant if the data contained in packets is sent to high rates:
QoS in IEEE 802.11 Issues Some issues are important for quality of service: the first one mentioned is the difference of performances expired by nodes based on their position in the network. Indeed, considering
More informationBasics (cont.) Characteristics of data communication technologies OSI-Model
48 Basics (cont.) Characteristics of data communication technologies OSI-Model Topologies Packet switching / Circuit switching Medium Access Control (MAC) mechanisms Coding Quality of Service (QoS) 49
More informationWhat s An OS? Cyclic Executive. Interrupts. Advantages Simple implementation Low overhead Very predictable
What s An OS? Provides environment for executing programs Process abstraction for multitasking/concurrency scheduling Hardware abstraction layer (device drivers) File systems Communication Do we need an
More informationA COMPARATIVE STUDY OF CPU SCHEDULING POLICIES IN OPERATING SYSTEMS
VSRD International Journal of Computer Science &Information Technology, Vol. IV Issue VII July 2014 / 119 e-issn : 2231-2471, p-issn : 2319-2224 VSRD International Journals : www.vsrdjournals.com REVIEW
More informationComparison of scheduling in RTLinux and QNX. Andreas Lindqvist, Tommy Persson,
Comparison of scheduling in RTLinux and QNX Andreas Lindqvist, andli299@student.liu.se Tommy Persson, tompe015@student.liu.se 19 November 2006 Abstract The purpose of this report was to learn more about
More informationChapter 5: CPU Scheduling
Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm Evaluation
More informationEmpirical Evaluation of Latency-Sensitive Application Performance in the Cloud
Empirical Evaluation of Latency-Sensitive Application Performance in the Cloud Sean Barker and Prashant Shenoy University of Massachusetts Amherst Department of Computer Science Cloud Computing! Cloud
More informationOperating Systems Design Fall 2010 Exam 1 Review. Paul Krzyzanowski
Operating Systems Design Fall 2010 Exam 1 Review Paul Krzyzanowski pxk@cs.rutgers.edu 1 Question 1 To a programmer, a system call looks just like a function call. Explain the difference in the underlying
More informationProcess Scheduling. Copyright : University of Illinois CS 241 Staff
Process Scheduling Copyright : University of Illinois CS 241 Staff 1 Process Scheduling Deciding which process/thread should occupy the resource (CPU, disk, etc) CPU I want to play Whose turn is it? Process
More informationSMD149 - Operating Systems
SMD149 - Operating Systems Roland Parviainen November 3, 2005 1 / 45 Outline Overview 2 / 45 Process (tasks) are necessary for concurrency Instance of a program in execution Next invocation of the program
More informationOperating Systems. Lecture Process Scheduling. Golestan University. Hossein Momeni
Operating Systems Lecture 2.2 - Process Scheduling Golestan University Hossein Momeni momeni@iust.ac.ir Scheduling What is scheduling? Goals Mechanisms Scheduling on batch systems Scheduling on interactive
More informationSo far. Next: scheduling next process from Wait to Run. 1/31/08 CSE 30341: Operating Systems Principles
So far. Firmware identifies hardware devices present OS bootstrap process: uses the list created by firmware and loads driver modules for each detected hardware. Initializes internal data structures (PCB,
More informationCHAPTER 4 CROSS LAYER INTERACTION
38 CHAPTER 4 CROSS LAYER INTERACTION The cross layer interaction techniques used in the lower layers of the protocol stack, solve the hidden and exposed terminal problems of wireless and ad hoc networks.
More information