OPERATING SYSTEMS 1 - HARDWARE PIETER HARTEL 1. Hardware 2.

Slides:



Advertisements
Similar presentations
OPERATING SYSTEMS 11 - DISK PIETER HARTEL 1. Hardware Intended for humans, local devices and communication (challenge?) Hardware support for interrupts.
Advertisements

Machine cycle.
Buffer Overflow Prabhaker Mateti Wright State University.
C Programming Day 1 based upon Practical C Programming by Steve Oualline CS550 Operating Systems.
OPERATING SYSTEMS 8 – VIRTUAL MEMORY PIETER HARTEL 1.
Informationsteknologi Thursday, September 6, 2007Computer Systems/Operating Systems - Class 21 Today’s class Finish computer system overview Review of.
Stack buffer overflow.
1 Homework Reading –PAL, pp , Machine Projects –Finish mp2warmup Questions? –Start mp2 as soon as possible Labs –Continue labs with your.
What does this program do ? #include int main(int argc, char* argv[]) { int i; printf("%d arguments\n", argc); for(i = 0; i < argc; i++) printf(" %d: %s\n",
CS-502 Fall 2006Processes in Unix, Linux, & Windows 1 Processes in Unix, Linux, and Windows CS502 Operating Systems.
Operating Systems Béat Hirsbrunner Main Reference: William Stallings, Operating Systems: Internals and Design Principles, 6 th Edition, Prentice Hall 2009.
Unix & Windows Processes 1 CS502 Spring 2006 Unix/Windows Processes.
Processes in Unix, Linux, and Windows CS-502 Fall Processes in Unix, Linux, and Windows CS502 Operating Systems (Slides include materials from Operating.
Programa “Números ASCII” Ing. Arturo Díaz Vargas Departamento de Sistemas División de Ciencias Básicas e Ingeniería UNIVERSIDAD AUTONOMA METROPOLITANA.
Command line arguments. – main can take two arguments conventionally called argc and argv. – Information regarding command line arguments are passed to.
OPERATING SYSTEMS 9 – SCHEDULING PIETER HARTEL 1.
GNU gcov (1/4) [from Wikipedia] gcov is a source code coverage analysis and statement- by-statement profiling tool. gcov generates exact counts of the.
OPERATING SYSTEMS 12 - FILES PIETER HARTEL 1. Files  Properties  Long term existence of data  Sharable between processes  Access control  Operations.
Lecture 0 CIS 208 C Language Lab Wed. January 12, 2005.
Processes and Threads CS550 Operating Systems. Processes and Threads These exist only at execution time They have fast state changes -> in memory and.
Central Processing Unit. MAJOR COMPONENTS OF CPU.
Computer Organization and Architecture Tutorial 1 Kenneth Lee.
CSE - Shiraz University1 Computer Architecture by: Behrooz Nasihatkon Computer Science & Engineering Department Shiraz University.
CS-1030 Dr. Mark L. Hornick 1 Java Review Interactive.
CS 153 Design of Operating Systems Spring 2015 Lecture 5: Processes and Threads.
Introduction Systems Programming Overview  Systems programming is the programming activity to create software used by other programmers and users. System.
Module 1 Parallel Programming And Threads Parallel Programming And Threads.
Genesis: From Raw Hardware to Processes Andy Wang Operating Systems COP 4610 / CGS 5765.
Department of Electronic & Electrical Engineering Introduction to C - The Development cycle. Why C? The development cycle. Using Visual Studio ? A simple.
Arrays, Strings, and Memory. Command Line Arguments #include int main(int argc, char *argv[]) { int i; printf("Arg# Contents\n"); for (i = 0; i < argc;
OPERATING SYSTEMS 3 - PROCESSES PIETER HARTEL 1. Principle of concurrency - giving a process the illusion that it owns the whole machine  A process has:
CS 140 Lecture Notes: Virtual MachinesSlide 1 Process Abstraction Instruction Set Registers MMU I/O Devices Physical Memory Virtual Memory System Calls.
1 Computer Architecture. 2 Basic Elements Processor Main Memory –volatile –referred to as real memory or primary memory I/O modules –secondary memory.
Unix System Overview ( Programmer’s Perspective) Chien-Chung Shen CIS/UD
Memory Management 백 일 우
Buffer Overflow By Collin Donaldson.
Process Tables; Threads
Chapter 1: A Tour of Computer Systems
CS6401- OPERATING SYSTEMS L T P C
Protection of System Resources
Command line arguments
Command Line Arguments
Understand argc and argv
Operating Systems 9 – scheduling
Homework Reading Machine Projects Labs PAL, pp ,
CSE 303 Concepts and Tools for Software Development
CS 537 Section 1 Programming in Unix and C
Program Execution in Linux
Architecture Background
CS 140 Lecture Notes: Virtual Machines
Command Line Arguments
Yung-Hsiang Lu Purdue University
COSC121: Computer Systems
Operating Systems 15 - security
Genesis: From Raw Hardware to Processes
Process Tables; Threads
GNU gcov (1/4) [from Wikipedia]
Assembly Language Programming II: C Compiler Calling Sequences
CS 140 Lecture Notes: Virtual Machines
Operating Systems 7 - memory
What does an Operating System Do?
Command Line Parameters
Lecture 2 SCOPE – Local and Global variables
System Calls David Ferry CSCI 3500 – Operating Systems
GNU gcov (1/4) [from Wikipedia]
Processes in Unix and Windows
CSE 451: Operating Systems Autumn 2004 Module 4 Processes
Outline Chapter 3: Processes Chapter 4: Threads So far - Next -
CS 140 Lecture Notes: Virtual Machines
How Memory Leaks Work with Memory Diagram
Presentation transcript:

OPERATING SYSTEMS 1 - HARDWARE PIETER HARTEL 1

Hardware 2

Interrupts  Why?  Sources? 3

Instruction and interrupt processing  Cost of interrupt processing? 4

Interrupt stack  Why a stack? 5

Memory hierarchy  Why? 6

Cache – principle of locality 7

MMU 8

Multiprocessor (why?) 9

First Linux example: What kind of machine is this?  Output?  gcc Uname.c ./a.out  man -k system  more /usr/include/sys/utsname.h  lscpu 10 /* Uname.c */ #include int main(int argc, char * argv[]) { struct utsname u; if(uname(&u) == 0) { printf("%s %s %s %s\n“ u.nodename, u.sysname, u.release, u.machine); } return 0; }

Summary  Hardware resources  CPU & Instruction cycle  Interrupts & stack  Memory hierarchy & caches  Single & Multi processors  Principle of locality  How to manage these resources? 11