Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

Interrupts are an important part of a computer architecture. Each computer design has its own interrupt mechanism, but several functions are common. The interrupt must transfer control to the appropriate interrupt service routine. The straightforward method for handling this transfer would be to invoke a generic routine to examine the interrupt information. The routine, in turn, would call the interrupt-specific handler. However, interrupts must be handled quickly. Since only a predefined number of interrupts is possible, a table of pointers to interrupt routines can be used instead to provide the necessary speed. The interrupt routine is called indirectly through the table, with no intermediate routine needed. Generally, the table of pointers is stored in low memory (the first hundred or so locations). These locations hold the addresses of the interrupt service routines for the various devices
If you want to change selection, open document below and click on "Move attachment"


  • owner: miller - (no access) - Abraham Silberschatz_ Peter B Galvin_ Greg Gagne -Operating system concepts-Wiley (2012).pdf, p32
  • owner: hughleat - (no access) - Abraham-Silberschatz-Operating-System-Concepts---9th2012.12.pdf, p32


statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on



Do you want to join discussion? Click here to log in or create user.