CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11:30 - 12:30 AM.

Slides:



Advertisements
Similar presentations
Operating Systems Components of OS
Advertisements

Categories of I/O Devices
Slide 3-1 Copyright © 2004 Pearson Education, Inc. Operating Systems: A Modern Perspective, Chapter 3 3 Operating System Organization.
Damian BrowneLuis PabonPedro Tovar The operation of a computer in executing a program consists of a sequence of Instruction Cycles, with one machine.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
Introduction to Operating Systems CS-2301 B-term Introduction to Operating Systems CS-2301, System Programming for Non-majors (Slides include materials.
Chapter 1: Introduction
Chapter 16 Control Unit Operation No HW problems on this chapter. It is important to understand this material on the architecture of computer control units,
CS364 CH17 Micro-programmed Control
Chapter 15 IA 64 Architecture Review Predication Predication Registers Speculation Control Data Software Pipelining Prolog, Kernel, & Epilog phases Automatic.
CSE451 Processes Spring 2001 Gary Kimura Lecture #4 April 2, 2001.
Introduction Operating Systems’ Concepts and Structure Lecture 1 ~ Spring, 2008 ~ Spring, 2008TUCN. Operating Systems. Lecture 1.
Slide 3-1 Copyright © 2004 Pearson Education, Inc. Operating Systems: A Modern Perspective, Chapter 3 Operating System Organization.
Lead Black Slide. © 2001 Business & Information Systems 2/e2 Chapter 3 Information System Fundamentals.
CS 470/570:Introduction to Parallel and Distributed Computing.
Computer Organization
Part VII: Special Topics Introduction to Business 3e 18 Copyright © 2004 South-Western. All rights reserved. Using Information Technology.
1 COMPSCI 110 Operating Systems Who - Introductions How - Policies and Administrative Details Why - Objectives and Expectations What - Our Topic: Operating.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 1: Introduction What is an Operating System? Mainframe Systems Desktop Systems.
© 2001 Business & Information Systems 2/e1 Chapter 3 Information System Fundamentals.
Lead Black Slide Powered by DeSiaMore1. 2 Chapter 3 Information System Fundamentals.
Implementing Processes and Process Management Brian Bershad.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
1 COMPSCI 110 Operating Systems Who - Introductions How - Policies and Administrative Details Why - Objectives and Expectations What - Our Topic: Operating.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
Week 5 Lecture Distributed Database Management Systems Samuel ConnSamuel Conn, Asst Professor Suggestions for using the Lecture Slides.
Lecture 3 Process Concepts. What is a Process? A process is the dynamic execution context of an executing program. Several processes may run concurrently,
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 7 OS System Structure.
Database Architectures Database System Architectures Considerations – Data storage: Where do the data and DBMS reside? – Processing: Where.
Slide 3-1 Copyright © 2004 Pearson Education, Inc. Operating Systems: A Modern Perspective, Chapter 3.
General Concepts of Computer Organization Overview of Microcomputer.
DISTRIBUTED COMPUTING. Computing? Computing is usually defined as the activity of using and improving computer technology, computer hardware and software.
1 COMPSCI 110 Operating Systems Who - Introductions How - Policies and Administrative Details Why - Objectives and Expectations What - Our Topic: Operating.
Computer Science/Ch.3 Data Manipulation 3-1 Chapter 3 Data Manipulation.
Unit 9: Distributing Computing & Networking Kaplan University 1.
1 Advanced Operating Systems - Fall 2009 Lecture 2 – January 12, 2009 Dan C. Marinescu Office: HEC 439 B.
Computer and Operating Systems
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
Basic Elements of Processor ALU Registers Internal data pahs External data paths Control Unit.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
Chapter 2 Data Manipulation © 2007 Pearson Addison-Wesley. All rights reserved.
Chapter 2 Data Manipulation © 2007 Pearson Addison-Wesley. All rights reserved.
Lecture Exam 1 Study Guide Albert Kalim. Chapter 1: Computer Basics 1. Explain why it’s essential to learn about computers today. 2. Discuss several ways.
COT 4600 Operating Systems Fall 2010 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 3:30-4:30 PM.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
CPIT Program Execution. Today, general-purpose computers use a set of instructions called a program to process data. A computer executes the.
CSCI/CMPE 4334 Operating Systems Review: Exam 1 1.
1 Chapter 2: Operating-System Structures Services Interface provided to users & programmers –System calls (programmer access) –User level access to system.
1 Module 3: Processes Reading: Chapter Next Module: –Inter-process Communication –Process Scheduling –Reading: Chapter 4.5, 6.1 – 6.3.
Introduction to Operating Systems Concepts
COMPSCI 110 Operating Systems
COMPSCI 110 Operating Systems
Lecture Topics: 11/1 Processes Process Management
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
CGS 3763 Operating Systems Concepts Spring 2013
Processes Hank Levy 1.
Processes and Process Management
Operating Systems: A Modern Perspective, Chapter 3
Processes Hank Levy 1.
CGS 3763 Operating Systems Concepts Spring 2013
Presentation transcript:

CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM

Last time:  Networking concepts Today:  Solutions to HW1  Student questions for week 4  More network concepts  Client-server systems  Remote procedure call Next time  Shared memory systems  Pipes Reading assignments  Chapters 3 and 4 of the textbook  Chapters 3 and 4 textbook slides Lecture 14 – Friday, February 8, Lecture 13

Solutions to HW1 1.2 What are the main differences between an OS for a mainframe and one for a PC? Mainframe: a. more sophisticated resource management policies; b. additional functionality, e.g., it has to support accounting; c. enhanced security. 1.3 What are the four steps involved in the execution of an instruction on a stored-program computer? Instruction fetch from the address pointed at by the PC (Program Counter) into the IR (Instruction Register). Instruction decode. Instruction execution. Write back the results Lecture 133

Solutions to HW1 3 Several users share a system in multiprogramming and time-sharing environments and this can result in security problems: (a) List two such problems; (b) Can we ensure the same level of security in a time-shared system as in a dedicated machine. Explain your answer. a. Security and privacy; unpredictable execution time. b. Probably not, since any protection scheme devised by humans can inevitably be broken by a human, and the more complex the scheme, the more difficult it is to feel confident of its correct implementation. Lecture 134

Solutions to HW What resources must be managed carefully in the following settings: (a) Mainframe of minicomputer systems; (b) Workstations connected to servers; (c) Handheld computers.  Mainframes: memory, CPU, primary and secondary storage, network.  Workstations: memory,CPU, network  Handheld computers: power consumption, memory resources, display, RF (Radio Frequency) subsystem for wireless communication Under what circumstances would a user be better off using a time-sharing system rather than a PC or a single-user system?  (a) When the amount of computing resources (CPU cycles, primary and secondary storage) is considerable.  (b) When the problems requires a collaborative effort of several users. Lecture 135

HW1 solutions 1.21 How are network computers different from traditional PCs? Describe some usage scenarios in which it is advantageous to use network computers.  A network computer has limited resources and relies on systems accessible via the Internet for data storage and for computing; its price is low. The OS of a network computer supports a small number of functions. Chromebook is an example of a network computer see  samsung samsung   Typical usage scenario: Web access, access. Lecture 136

Student questions Jan 30 th Wednesday:  More on the fork() or exec() commands.  Better explanation of pipelining and what it is.  Where does the PCB come into play?  Explain further the concept of an interrupt. What is an interrupt vector?  What determines which process has more priority over another process?  What is the purpose of the program counter? Why do we need to know this? Lecture 137

Student questions Feb 1st Friday:  What is the main difference between independent and cooperating within a system?  RISC/CISC Architecture: what exactly are these two architectures? What is an example of CISC machine and where are they used? What is the advantage or disadvantage of these versus the standard RISC?  Further explain branch execution.  Explain in greater detail of a process creation and what it is used for?  What is a Producer-Consumer Problem? What is a flag/condition code, where does it come in place?  What are the major differences between layered and modular systems? Lecture 138

Peer-to-peer communication Lecture 139

Local and wide area networks Lecture 1310

Encapsulation/ de-capsulation Lecture 1311

IPV4 and IPv6 datagrams Lecture 1312

Multiplexing, de-multiplexing Lecture 1313