CSCI 6307 Foundation of Systems – Exercise (3)

Slides:



Advertisements
Similar presentations
Cache Memory Exercises. Questions I Given: –memory is little-endian and byte addressable; memory size; –number of cache blocks, size of cache block –An.
Advertisements

Tutorial 4 Scheduling. Why do we need scheduling? To manage processes according to requirements of a system, like: –User responsiveness or –Throughput.
Scheduling Criteria CPU utilization – keep the CPU as busy as possible (from 0% to 100%) Throughput – # of processes that complete their execution per.
G53OPS Operating Systems Graham Kendall Q Exam.
Topic : Process Management Lecture By: Rupinder Kaur Lecturer IT, SRS Govt. Polytechnic College for Girls,Ludhiana.
CS 149: Operating Systems February 3 Class Meeting
Operating System CS105. Objectives Role of an operating system Manages resources – Memory – CPU – Secondary storage – I/O devices Memory CPU Hard Disk.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 17 Scheduling III.
Chapter 10 Operating Systems.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 16 Scheduling II.
CPU Scheduling Algorithms
Exercise (5).
How caches take advantage of Temporal locality
Memory Hierarchies Exercises [ ] Describe the general characteristics of a program that would exhibit very little spatial or temporal locality with.
CDA 3103 Computer Organization Review Instructor: Hao Zheng Dept. Comp. Sci & Eng. USF.
CPU-Scheduling Whenever the CPU becomes idle, the operating system must select one of the processes in the ready queue to be executed. The short term scheduler.
Chapter 6 CPU SCHEDULING.
Scheduling Chap 2. Scheduling Introduction to Scheduling (1) Bursts of CPU usage alternate with periods of I/O wait –a CPU-bound process –an I/O bound.
CSCI 4333 Database Design and Implementation – Exercise (3) Xiang Lian The University of Texas – Pan American Edinburg, TX
Scheduling Strategies Operating Systems Spring 2004 Class #10.
Exercise (4). Exercise Assume the following jobs are executed with one processor, with the jobs arriving in the order listed in the table. – Suppose a.
CSCI 6307 Foundation of Systems – Exercise (2) Xiang Lian The University of Texas – Pan American Edinburg, TX
Scheduling. Alternating Sequence of CPU And I/O Bursts.
CPU Scheduling Basic Concepts. Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor.
CSCI 4333 Database Design and Implementation – Exercise (5) Xiang Lian The University of Texas – Pan American Edinburg, TX
Scanf n, a, b /* I-O wait */ for (i=1; i
Operating Systems CMPSC 473 CPU Scheduling September 07, Lecture 5 Instructor: Bhuvan Urgaonkar.
CS340d: Operating Systems
CSCI 3328 Object Oriented Programming in C# Chapter 8: LINQ and Generic Collections – Exercises 1 Xiang Lian The University of Texas – Pan American Edinburg,
Lecture Topics: 11/15 CPU scheduling: –Scheduling goals and algorithms.
Operating Systems CMPSC 473 Processes (contd.) September 01, Lecture 4 Instructor: Bhuvan Urgaonkar.
CSCI 6307 Foundation of Systems Review: Final Exam Xiang Lian The University of Texas – Pan American Edinburg, TX 78539
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 5: CPU Scheduling.
CSCI 6307 Foundation of Systems – Exercise (4) Xiang Lian The University of Texas – Pan American Edinburg, TX
CPU Scheduling Operating Systems CS 550. Last Time Deadlock Detection and Recovery Methods to handle deadlock – Ignore it! – Detect and Recover – Avoidance.
Lecturer 5: Process Scheduling Process Scheduling  Criteria & Objectives Types of Scheduling  Long term  Medium term  Short term CPU Scheduling Algorithms.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria.
CSCI 4333 Database Design and Implementation – Exercise (5)
UNIT–II: Process Management
Copyright ©: Nahrstedt, Angrave, Abdelzaher
Tutorial Nine Cache CompSci Semester One 2016.
CS2100 Computer Organization
Copyright ©: Nahrstedt, Angrave, Abdelzaher
CPU scheduling 6. Schedulers, CPU Scheduling 6.1. Schedulers
Scheduling (Priority Based)
CPSC 457 Operating Systems
CPU Scheduling.
Lecture 23: Process Scheduling for Interactive Systems
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
Chapter 5: CPU Scheduling
Introduction What is an operating system bootstrap
Operating System Concepts
CSCI 3328 Object Oriented Programming in C# Review: Exam I
Module IV Memory Organization.
TDC 311 Process Scheduling.
CSCI 4333 Database Design and Implementation – Exercise (5)
CSCI 6307 Foundation of Systems – Exercise (1)
Chapter 10 Operating Systems.
Exercise Ms.Reema alOraini
Chapter 5: CPU Scheduling
CSCI 6315 Applied Database Systems – Exercise (6)
Process Scheduling Decide which process should run and for how long
CPU SCHEDULING CPU SCHEDULING.
Chapter 6: Scheduling Algorithms Dr. Amjad Ali
CPU Scheduling.
Chapter 5: CPU Scheduling
CSCI 6307 Foundation of Systems – Exercise (5)
CSCI 4333 Database Design and Implementation – Exercise (1)
Presentation transcript:

CSCI 6307 Foundation of Systems – Exercise (3) Xiang Lian The University of Texas – Pan American Edinburg, TX 78539 lianx@utpa.edu

Direct-Mapped Cache Assume that we have a list of 16-bit memory address references: 6, 214, 175, 214, 6 Given a direct-mapped cache with 16 one-word blocks (initially empty), Please identify the binary address, the tag, and the index of the address references above Please also list if each address reference is a hit or a miss

Direct-Mapped Cache (cont'd) 16-bit memory address references: 6, 214, 175, 214, 6 a direct-mapped cache with 16 one-word blocks (initially empty) Address Reference Binary Tag Index Hit or Miss 6 214 175

Synchronization What is the function of a semaphore? What are the operations that can be applied to a semaphore? What is a condition variable? What are the operations that can be applied to a condition?

Write a Program Suppose processes p0 and p1 can access the same bank account (shared variable balance). Process p0 add "amount" to the account balance, whereas process p1 withdraw "amount" from the bank account. Please write a code fragment for processes p0 and p1 using the semaphore.

Process Scheduling Suppose that there are five processes in a system, their service time and arrival time are given below: Draw the Gantt chart and compute average waiting time for the following methods. Here the waiting time of a process includes all the times it is in the ready list. Assume the context switching time is negligible. 1. First-Come-First-Served 2. Shortest-Job-Next (non-preemptive) 3. Shortest-Remaining-Job-Next (i.e., preemptive SJN) 4. Round-Robin with time quantum of 2 5. Round-Robin with time quantum of 4 Process Arrival time Service time P1 7 P2 20 P3 5 P4 10 P5 8 4