COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00 – 6:00 PM.

Slides:



Advertisements
Similar presentations
RAID- Redundant Array of Inexpensive Drives. Purpose Provide faster data access and larger storage Provide data redundancy.
Advertisements

Lecture Objectives: 1)Explain the limitations of flash memory. 2)Define wear leveling. 3)Define the term IO Transaction 4)Define the terms synchronous.
COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 6:00-7:15 PM.
Using Computers CS French Chapter 1.
1 Lecture 2: Review of Computer Organization Operating System Spring 2007.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Starting Out with Programming Logic & Design First Edition by Tony Gaddis.
Copyright © 2012 Pearson Education, Inc. Chapter 1: Introduction to Computers and Programming.
Computer ArchitectureFall 2008 © November 12, 2007 Nael Abu-Ghazaleh Lecture 24 Disk IO.
I/O Systems and Storage Systems May 22, 2000 Instructor: Gary Kimura.
Introduction to Computers Essential Understanding of Computers and Computer Operations.
Unit 3—Part A Computer Memory
Secondary Storage Unit 013: Systems Architecture Workbook: Secondary Storage 1G.
Chapter 3 – Computer Hardware Computer Components – Hardware (cont.) Lecture 3.
Copyright © 2012 Pearson Education, Inc. Chapter 1: Introduction to Computers and Programming.
COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00 – 6:00 PM.
Why Program? Computer – programmable machine designed to follow instructions Program – instructions in computer memory to make it do something Programmer.
Chapter Introduction to Computers and Programming 1.
COT 5611 Operating Systems Design Principles Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 1:00-2:00 PM.
Page 19/4/2015 CSE 30341: Operating Systems Principles Raid storage  Raid – 0: Striping  Good I/O performance if spread across disks (equivalent to n.
CGS 3863 Operating Systems Spring 2013 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 11:30 AM – 1 PM.
Today’s Agenda: Computer Basics Review Hardware: The physical components of a computer, any internal or external computer part that you can touch. Software:
Topics Introduction Hardware and Software How Computers Store Data
Disk Access. DISK STRUCTURE Sector: Smallest unit of data transfer from/to disk; 512B 2/4/8 adjacent sectors transferred together: Blocks Read/write heads.
Lecture 9 of Advanced Databases Storage and File Structure (Part II) Instructor: Mr.Ahmed Al Astal.
Copyright © 2012 Pearson Education, Inc. Chapter 1: Introduction to Computers and Programming.
Chapter 1: Introduction to Computers and Programming.
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 1: Introduction to Computers and Programming.
Computers Inside and Out
COT 4600 Operating Systems Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 3:00-4:00 PM.
2.0 Computer System.
Copyright © 2012 Pearson Education, Inc. Publishing as Pearson Addison-Wesley C H A P T E R 1 Introduction to Computers and Programming.
Three fundamental concepts in computer security: Reference Monitors: An access control concept that refers to an abstract machine that mediates all accesses.
Intro to Computers Computer Apps 1.
Computer Hardware Sources: Discovering Computers Information & Software technology.
Computer Basic Vocabulary
COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00 – 6:00 PM.
The concept of RAID in Databases By Junaid Ali Siddiqui.
1 Objectives Discuss reasons for taking this course on computers Outline the scope of this course Define the computer Differentiate between hardware and.
Lecture 1: Review of Computer Organization
A.Abhari CPS1251 Topic 1: Introduction to Computers Computer Hardware Computer components Connecting Computers Computer Software Operating System (OS)
Computer Programming (1) Code & No.: CS 102 CREDIT HOURS: 5 UNIT Lecture 3.0 hours/week Lab: 2.0 hour/on every week a. This course introduces the students.
COT 4600 Operating Systems Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 3:00-4:00 PM.
Operating Systems COT 4600 – Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: W, F 3:00-4:00 PM.
Memory The term memory is referred to computer’s main memory, or RAM (Random Access Memory). RAM is the location where data and programs are stored (temporarily),
Introduction To Computers
COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00 – 6:00 PM.
Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 1: Introduction to Computers and Programming.
Introduction To Computer Programming – 1A Computer Parts, Words, and Definition Herriman High School.
COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00 – 6:00 PM.
STORAGE DEVICES Towards the end of this unit you will be able to identify the type of storage devices and their storage capacity.
APPENDIX A Hardware and Software Basics
I/O SYSTEMS MANAGEMENT Krishna Kumar Ahirwar ( )
Topics Introduction Hardware and Software How Computers Store Data
Choosing the best storage method
STORAGE DEVICES Towards the end of this unit you will be able to identify the type of storage devices and their storage capacity.
COP 4600 Operating Systems Fall 2010
COT 5611 Operating Systems Design Principles Spring 2014
COT 5611 Operating Systems Design Principles Spring 2012
COT 4600 Operating Systems Fall 2010
STORAGE DEVICES Towards the end of this unit you will be able to identify the type of storage devices and their storage capacity.
Computer Based Technology:
CGS 3763 Operating Systems Concepts Spring 2013
Topics Introduction Hardware and Software How Computers Store Data
CGS 3763 Operating Systems Concepts Spring 2013
UNIT IV RAID.
COT 4600 Operating Systems Fall 2010
COT 4600 Operating Systems Fall 2010
COT 5611 Operating Systems Design Principles Spring 2010
CGS 3763 Operating Systems Concepts Spring 2013
Presentation transcript:

COT 4600 Operating Systems Spring 2011 Dan C. Marinescu Office: HEC 304 Office hours: Tu-Th 5:00 – 6:00 PM

Last time: Complexity of Computer Systems Iteration Names and The Basic Abstractions Today: Discussion of “Hints for Computer Systems Design” by Butler Lampson. Basic Abstractions  Memory.  Interpreters.  Communication links. Next time  Naming; Use by: value/name; Binding and indirection Generic naming model Practical design of naming scheme; Contexts, Name overloading Lecture 6 – Tuesday, February 1, Lecture 6

3 Names and the three basic abstractions Memory  stores named objects  write(name, value) value  READ(name)  file system: /dcm/classes/Fall09/Lectures/Lecture5.ppt Interpreters  manipulates named objects  machine instructions ADD R1,R2  modules  Variables call sort(table) Communication Links  connect named objects  HTTP protocol used by the Web and file systems Host: boticelli.cs.ucf.edu put /dcm/classes/Spring11/Lectures/Lecture6.ppt get /dcm/classes/Spring11/Lectures/Lecture6.ppt 3

Lecture 6 4 4

5 Memory Hardware memory:  Devices RAM (Random Access Memory) chip Flash memory  non-volatile memory that can be erased and reprogrammed Magnetic tape Magnetic Disk CD and DVD  Systems RAID File systems DBMS (Data Base management Systems) 5

Lecture 6 6 6

7 7

8 RAID 3 and 4 Raid 3  Striped set with dedicated parity or bit interleaved parity or byte level parity. Raid 4  improves reliability, it adds error correction 8

Lecture 69 RAID 5 and 6 Raid 5  striped disks with parity combines three or more disks to protect data against loss of any one disk.  The storage capacity of the array is reduced by one disk Raid 6  striped disks with dual parity combines four or more disks to protect against loss of any two disks.  Makes larger RAID groups more practical.  Large-capacity drives lengthen the time needed to recover from the failure of a single drive. Single parity RAID levels are vulnerable to data loss until the failed drive is rebuilt: the larger the drive, the longer the rebuild will take. Dual parity gives time to rebuild the array without the data being at risk if a (single) additional drive fails before the rebuild is complete. 9

Lecture 610 Figure 2.3 from textbook

Lecture 611 Interpreters The active elements of a computer system Diverse  Hardware  Processor, Disk Controller, Display controller  Software  script language: Javascropt, Pearl, Python text processing systems: Latex, Tex, Word browser : Safari, Google Chrome,Thunderbird All share three major abstractions/components:  Instruction reference  tells the system where to find the next instruction  Repertoire  the set of actions (instructions) the interpreter is able to perform  Environment reference  tells the interpreter where to find the its environment, the state in which it should be to execute the next instruction 11

Lecture 612 An abstract interpreter The three elements allow us to describe the functioning of an interpreter regardless of its physical realization. Interrupt  mechanism allowing an interpreter to deal with the transfer of control. Once an instruction is executed the control is passed to an interrupt handler which may change the environment for the next instruction. More than a single interpreter may be present. 12

Lecture 613 Figure 2.5 from the textbook

Lecture 614 Figure 2.6 from the textbook

Lecture 615 Figure 2.7 from the textbook