CS1550: Quiz #1 Quiz #1.

Slides:



Advertisements
Similar presentations
CAS3SH3 Midterm Review. The midterm 50 min, Friday, Feb 27 th Materials through CPU scheduling closed book, closed note Types of questions: True & False,
Advertisements

Mutual Exclusion.
1 Christmas special - Overview Assignment 9: hints  Scheduling Assignment 8: solution  Deadlocks.
Threads, Events, and Scheduling Andy Wang COP 5611 Advanced Operating Systems.
IT Systems Multiprocessor System EN230-1 Justin Champion C208 –
CS444/CS544 Operating Systems Synchronization 2/21/2006 Prof. Searleman
CS533 Concepts of Operating Systems Class 5 Integrated Task and Stack Management.
User Level Interprocess Communication for Shared Memory Multiprocessor by Bershad, B.N. Anderson, A.E., Lazowska, E.D., and Levy, H.M.
Threads 1 CS502 Spring 2006 Threads CS-502 Spring 2006.
Chapter 2.3 : Interprocess Communication
Operating Systems Lecture # 3. Recap Hardware Operating System Application System Call Trap Hardware Trap Processor.
1 Chapter 4 Threads Threads: Resource ownership and execution.
CS 3013 & CS 502 Summer 2006 Threads1 CS-3013 & CS-502 Summer 2006.
The Zen of Threads When you can snatch the lock from the object, grasshopper, then you are ready to spawn the thread... Lecture 18, Nov 03.
CS 153 Design of Operating Systems Spring 2015 Lecture 10: Scheduling.
1 Race Conditions/Mutual Exclusion Segment of code of a process where a shared resource is accessed (changing global variables, writing files etc) is called.
1 CSCI 6900: Design, Implementation, and Verification of Concurrent Software Eileen Kraemer August 19 th, 2010 The University of Georgia.
Chapter 51 Threads Chapter 5. 2 Process Characteristics  Concept of Process has two facets.  A Process is: A Unit of resource ownership:  a virtual.
Process Description and Control. Process concepts n Definitions – replaces task, job – program in execution – entity that can be assigned to and executed.
CS 153 Design of Operating Systems Spring 2015 Lecture 11: Scheduling & Deadlock.
E X C E E D I N G E X P E C T A T I O N S Time Mgt Linux System Administration Dr. Hoganson Kennesaw State University OS Time Management Time management.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Mutual Exclusion.
Ihr Logo Operating Systems Internals & Design Principles Fifth Edition William Stallings Chapter 2 (Part II) Operating System Overview.
The Amiga Operating System: Past and Present Aaron Hensley Kayla Zinn Brad Campbell Gregory Mathurin Josh Benson.
Deadlocks Silberschatz Ch. 7 and Priority Inversion Problems.
OBJECTIVE: To learn about the various system calls. To perform the various CPU scheduling algorithms. To understand the concept of memory management schemes.
CS399 New Beginnings Jonathan Walpole. 2 Concurrent Programming & Synchronization Primitives.
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-5 Process Synchronization Department of Computer Science and Software.
Silberschatz and Galvin  Chapter 3:Processes Processes –State of a process, process control block, –Scheduling of processes  Long term scheduler,
CSE 153 Design of Operating Systems Winter 2015 Midterm Review.
What is an Operating System? Various systems and their pros and cons –E.g. multi-tasking vs. Batch OS definitions –Resource allocator –Control program.
4.1 Introduction to Threads Overview Multithreading Models Thread Libraries Threading Issues Operating System Examples Windows XP Threads Linux Threads.
1 Why Threads are a Bad Idea (for most purposes) based on a presentation by John Ousterhout Sun Microsystems Laboratories Threads!
1 Threads in Java Jingdi Wang. 2 Introduction A thread is a single sequence of execution within a program Multithreading involves multiple threads of.
Tutorial 3: Homework 2 and Project 2
CS203 Programming with Data Structures Introduction to Threads and Synchronization California State University, Los Angeles.
CPU Scheduling Scheduling processes (or kernel-level threads) onto the cpu is one of the most important OS functions. The cpu is an expensive resource.
Java Thread Programming
Multi-processor Scheduling
Background on the need for Synchronization
Practice Chapter Four.
Chapter 4 – Introduction to Operating System Concepts
Chapter 4: Multithreaded Programming
April 6, 2001 Gary Kimura Lecture #6 April 6, 2001
Section 10: Last section! Final review.
Threads, Events, and Scheduling
Essbase Data Integrity
Mid Term review CSC345.
Midterm review: closed book multiple choice chapters 1 to 9
Lecture 22 Syed Mansoor Sarwar
Sarah Diesburg Operating Systems CS 3430
Thread Implementation Issues
Lecture 2 Part 2 Process Synchronization
CPU scheduling decisions may take place when a process:
Threads Chapter 4.
Threads, Events, and Scheduling
2P13 Week 3.
Major Topics in Operating Systems
Operating System Introduction.
Threads, Events, and Scheduling
Threads vs. Processes Hank Levy 1.
CS510 Operating System Foundations
CS333 Intro to Operating Systems
Last section! Project 4 + EC due tomorrow Today: Project 4 questions
Linux Process State Scheduling information Identifiers
CSE 153 Design of Operating Systems Winter 2019
CMSC 202 Threads.
Sarah Diesburg Operating Systems CS 3430
Synchronization and liveness
CS Introduction to Operating Systems
Presentation transcript:

CS1550: Quiz #1 Quiz #1

Questions (True = A, False = B) 01) The operating system must provide GUI (graphical user interface) functions. No, just look at the old DOS and the old Unix systems. 02) Kernel threads allow for faster context switches than user-level threads. Credit for everyone. Yes and no: ambiguous question. User-level threads have faster context switches if they are inside the same process. If they are in different processes, kernel-level threads have faster context switches 03) Deadlock is possible in a batch system. No, deadlocks require more than one process to be running at a time, and in batch systems only one process runs 04) Synchronization (with semaphores, locks, etc.) is needed when we have multiple processes, even if the processes cannot communicate. No, if the processes are completely isolated, there is no shared resources and therefore no need to synchronize. 05) Credit for everyone 06) Credit for everyone 07) Deadlocks waste processor time. No, the processes just sit there, so it is as if there were no processes 08) Whenever there is deadlock there is starvation. Yes, deadlocks mean 2 or more processes are blocked for ever. They cannot run, therefore they are in a starvation situation 09) Whenever there is starvation there is a deadlock. No, there could be starvation due to livelocks or due to a lower priority job never getting a chance to run (never being chosen by the scheduler) 11/24/2018 Quiz #1