Scribd
Upload
127 views7 pages

Department of Computer Science and Engineering: Interrupt-Driven I/O

The document discusses interrupt-driven I/O and priority interrupts. It describes how interrupt-driven I/O works more efficiently than programmed I/O by allowing the CPU to perform other tasks while waiting for I/O instead of repeatedly polling the I/O device. When the I/O device is ready, it generates an interrupt to the CPU. There are different methods for implementing priority interrupts, including daisy chain priority interrupts where devices are prioritized based on their physical location, and parallel priority interrupts where hardware determines the highest priority interrupt. The CPU checks for interrupts at the end of each instruction cycle and will save its context and service the interrupt if one has occurred.

Uploaded by

nandhithaa.a.cse.2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
127 views7 pages

Department of Computer Science and Engineering: Interrupt-Driven I/O

The document discusses interrupt-driven I/O and priority interrupts. It describes how interrupt-driven I/O works more efficiently than programmed I/O by allowing the CPU to perform other tasks while waiting for I/O instead of repeatedly polling the I/O device. When the I/O device is ready, it generates an interrupt to the CPU. There are different methods for implementing priority interrupts, including daisy chain priority interrupts where devices are prioritized based on their physical location, and parallel priority interrupts where hardware determines the highest priority interrupt. The CPU checks for interrupts at the end of each instruction cycle and will save its context and service the interrupt if one has occurred.

Uploaded by

nandhithaa.a.cse.2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

SNS COLLEGE OF TECHNOLOGY, COIMBATORE –35

(An Autonomous Institution)


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Interrupt-driven I/O
 Polling takes valuable CPU time
 Open communication only when some data has to be passed -> Interrupt.
 I/O interface, instead of the CPU, monitors the I/O device
 When the interface determines that the I/O device is ready for data transfer, it
generates an Interrupt Request to the CPU
 Upon detecting an interrupt, CPU stops momentarily the task it is doing, branches
to the service routine to process the data transfer, and then returns to the task it
was performing
The problem with programmed I/O is that the processor has to wait a long time for
the I/O module of concern to be ready for either reception or transmission of data.
The processor, while waiting, must repeatedly interrogate the status of the I/O
module. As a result, the level of the performance of the entire system is severely
degraded. An alternative is for the processor to issue an I/O command to a module
and then go on to do some other useful work. The I/O module will then interrupt the
processor to request service when it is ready to exchange data with processor. The
processor then executes the data transfer, and then resumes its former processing. The
interrupt can be initiated either by software or by hardware.

Interrupt Driven I/O basic operation


 CPU issues read command
 I/O module gets data from peripheral whilst CPU does other work
 I/O module interrupts CPU
 CPU requests data
 I/O module transfers data
Interrupt Processing from CPU viewpoint
 Issue read command
 Do other work
 Check for interrupt at end of each instruction cycle
 If interrupted:-
o Save context (registers)
o Process interrupt
o Fetch data & store

S.VASUKI
SNS COLLEGE OF TECHNOLOGY, COIMBATORE –35
(An Autonomous Institution)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Fig: Simple Interrupt Processing

Priority Interrupt
 Determines which interrupt is to be served first when two or more requests are
made simultaneously
 Also determines which interrupts are permitted to interrupt the computer while
another is being serviced
 Higher priority interrupts can make requests while servicing a lower priority
interrupt

Priority Interrupt by Software (Polling)


 Priority is established by the order of polling the devices (interrupt sources), that
is identify the highest-priority source by software means
 One common branch address is used for all interrupts
 Program polls the interrupt sources in sequence
 The highest-priority source is tested first
 Flexible since it is established by software
 Low cost since it needs a very little hardware
 Very slow

S.VASUKI
Priority Interrupt by Hardware
 Require a priority interrupt manager which accepts all the interrupt requests to
determine the highest priority request
 Fast since identification of the highest priority interrupt request is identified by
the hardware
 Fast since each interrupt source has its own interrupt vector to access directly to
its own service routine

1. Daisy Chain Priority (Serial)

Fig: Daisy Chain priority Interrupt

 Interrupt Request from any device


 CPU responds by INTACK
 Any device receives signal(INTACK) at PI puts the VAD on the bus
 Among interrupt requesting devices the only device which is physically
closest to CPU gets INTACK and it blocks INTACK to propagate to the
next device

Fig: One stage of Daisy chain priority arrangement

3
2. Parallel Priority

Fig: Parallel priority interrupts hardware

 IEN: Set or Clear by instructions ION or IOF


 IST: Represents an unmasked interrupt has occurred. INTACK enables
tristate Bus Buffer to load VAD generated by the Priority Logic
 Interrupt Register:
o Each bit is associated with an Interrupt Request from different
Interrupt Source - different priority level
o Each bit can be cleared by a program instruction
 Mask Register:
o Mask Register is associated with Interrupt Register
o Each bit can be set or cleared by an Instruction

Priority Encoder
 Determines the highest priority interrupt when more than one interrupts take place

Fig: Priority Encoder Truth Table

Interrupt Cycle
At the end of each Instruction cycle

 CPU checks IEN and IST


4
 If IEN and IST = 1, CPU -> Interrupt Cycle
o SP SP – 1; Decrement stack pointer
o M[SP] PC; Push PC into stack
o INTACK 1; Enable interrupt acknowledge
o PC VAD; Transfer vector address to PC
o IEN 0; Disable further interrupts
o Go To Fetch to execute the first instruction in the interrupt service routine

5
6
COMPUTER ORGANIZATION AND ARCHITECTURE / SELVAKUMAR N / CSE / SNSCT

You might also like