TERMINATE-AND-STAY-RESIDENT TSR IS A SOFTWARE PROGRAM THAT REMAINS IN MEMORY UNTIL IT IS NEEDED, AND THEN PERFORMS SOME FUNCTION. AN GOOD EXAMPLE OF A.

Slides:



Advertisements
Similar presentations
Computer-System Structures Er.Harsimran Singh
Advertisements

Part IV: Memory Management
Dynamic Memory Allocation (also see pointers lectures) -L. Grewe.
Figure 2.8 Compiler phases Compiling. Figure 2.9 Object module Linking.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 2: Computer-System Structures Computer System Operation I/O Structure Storage.
© Copyright 2004 Dr. Phillip A. Laplante 1 Memory  Memory access  Memory technologies  Memory organization.
EET 450 Chapter 2 – How hardware and Software Work Together.
8.7 Memory management Program E Program D System memory DOS INT 21, function 48H: Allocate Memory Specification: allocates a number of memory paragraphs.
1 Computer System Overview OS-1 Course AA
Advanced OS Chapter 3p2 Sections 3.4 / 3.5. Interrupts These enable software to respond to signals from hardware. The set of instructions to be executed.
A look at interrupts What are interrupts and why are they needed.
Assembly Language for Intel-Based Computers Chapter 16: Expert MS-DOS Programming (c) Pearson Education, All rights reserved. You may modify.
Introduction to Interrupts
Structure of DOS application programs. Contents: 1. PSP 2..COM and.EXE 3. TSR: Terminate and Stay Resident Programs.
Operating System Concepts
1 Malicious Logic CSSE 490 Computer Security Mark Ardis, Rose-Hulman Institute March 25, 2004.
Software Development and Software Loading in Embedded Systems.
What do operating systems do? manage processes manage memory and computer resources provide security features execute user programs make solving user.
Anti Virus Techniques Jordan & Ryan Use of Checksum The Binary for key files is added up to a number especially in the boot files When these files are.
General System Architecture and I/O.  I/O devices and the CPU can execute concurrently.  Each device controller is in charge of a particular device.
Introduction Part 1 The Microprocessor Based Systems  Memory and I/O System  Microprocessor.
Instructor: Yuzhuang Hu Memory Hierarchy.
Lecture 13 L.Mohammad R.Alkafagee1.  The concept of a logical address space that is bound to a separate physical address space is central to proper memory.
DAT2343 Accessing Services Through Interrupts © Alan T. Pinck / Algonquin College; 2003.
Most modern operating systems incorporate these five components.
Silberschatz, Galvin, and Gagne  Applied Operating System Concepts Module 2: Computer-System Structures Computer System Operation I/O Structure.
1 CSE Department MAITSandeep Tayal Computer-System Structures Computer System Operation I/O Structure Storage Structure Storage Hierarchy Hardware Protection.
Khaled A. Al-Utaibi  Interrupt-Driven I/O  Hardware Interrupts  Responding to Hardware Interrupts  INTR and NMI  Computing the.
Recall: Three I/O Methods Synchronous: Wait for I/O operation to complete. Asynchronous: Post I/O request and switch to other work. DMA (Direct Memory.
Chapter 4 Storage Management (Memory Management).
Chapter 2: Computer-System Structures 2.1 Computer System Operation 2.5 Hardware Protection 2.6 Network Structure.
Lecture 3 Process Concepts. What is a Process? A process is the dynamic execution context of an executing program. Several processes may run concurrently,
6 Memory Management and Processor Management Management of Resources Measure of Effectiveness – On most modern computers, the operating system serves.
Microsoft Disk Operating System Wellson Fung Mike McLaughlin Brian Singer Steve Tran.
The Functions of Operating Systems Desktop PC Operating Systems.
Operating Systems Lecture November 2015© Copyright Virtual University of Pakistan 2 Agenda for Today Review of previous lecture Hardware (I/O, memory,
Operating System Structure A key concept of operating systems is multiprogramming. –Goal of multiprogramming is to efficiently utilize all of the computing.
We will focus on operating system concepts What does it do? How is it implemented? Apply to Windows, Linux, Unix, Solaris, Mac OS X. Will discuss differences.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 2 Computer-System Structures Slide 1 Chapter 2 Computer-System Structures.
Concurrency, Processes, and System calls Benefits and issues of concurrency The basic concept of process System calls.
Silberschatz, Galvin and Gagne  Applied Operating System Concepts Chapter 2: Computer-System Structures Computer System Architecture and Operation.
Chapter 7 Input/Output Interface and Interruption System Principles of Microcomputers 2016年1月12日 2016年1月12日 2016年1月12日 2016年1月12日 2016年1月12日 2016年1月12日.
Chapter 2 Process Management. 2 Objectives After finish this chapter, you will understand: the concept of a process. the process life cycle. process states.
OS part I, , Part I Computer System Structures Department of Computer Engineering, PSUWannarat Suntiamorntut.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 31 Memory Management.
Lecture 5 Rootkits Hoglund/Butler (Chapters 1-3).
Software Applications and Utilities. Software Applications Programs that allow the computer to be used to solve a problems for a particular task. This.
Copyright © Curt Hill More on Operating Systems Continuation of Introduction.
Memory management The main purpose of a computer system is to execute programs. These programs, together with the data they access, must be in main memory.
Main Memory CSSE 332 Operating Systems Rose-Hulman Institute of Technology.
Chapter 2: Computer-System Structures(Hardware)
Chapter 2: Computer-System Structures
CS501 Advanced Computer Architecture
Protection of System Resources
Chapter 1: Introduction
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 2: Computer-System Structures Computer System Operation I/O Structure Storage.
Week 5 Computers are like Old Testament gods; lots of rules and no mercy. Joseph Campbell.
Computer-System Architecture
Module 2: Computer-System Structures
Main Memory Background Swapping Contiguous Allocation Paging
Accessing Services Through Interrupts
Operating Systems Lecture 3.
Module 2: Computer-System Structures
Chapter 2: Computer-System Structures
Chapter 2: Computer-System Structures
Module 2: Computer-System Structures
Module 2: Computer-System Structures
OPERATING SYSTEMS MEMORY MANAGEMENT BY DR.V.R.ELANGOVAN.
CS-401 Computer Architecture & Assembly Language Programming
Clock Algorithm Example
Presentation transcript:

TERMINATE-AND-STAY-RESIDENT TSR IS A SOFTWARE PROGRAM THAT REMAINS IN MEMORY UNTIL IT IS NEEDED, AND THEN PERFORMS SOME FUNCTION. AN GOOD EXAMPLE OF A TSR IS A VIRUS SCANNER, WHICH MUST REMAIN LOADED IN MEMORY TO HELP PROTECT YOUR COMPUTER FROM COMPUTER VIRUSES.

TSR THE TYPICAL METHOD OF UTILIZING AN INTERRUPT VECTOR INVOLVES READING ITS PRESENT VALUE (THE ADDRESS), STORING IT WITHIN THE MEMORY SPACE OF THE TSR, AND INSTALLING A POINTER TO ITS OWN CODE. THE STORED ADDRESS IS CALLED BEFORE OR AFTER THE TSR HAS RECEIVED THE INTERRUPT AND HAS FINISHED ITS PROCESSING.

TSR( TERMINATE BUT STAY RESIDENT) TSR PROGRAM IS DIVIDED INTO THREE MAIN PARTS EXAMPLE : REAL TIME CLOCK, SCREENSAVER DATA AREA RESIDENT ROUTINE INITIALIZATION ROUTINE