Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.os.linux.hardware > #2714

Re: Operating System Design

From "Vince Coen" <VBCoen@gmail.com>
Newsgroups comp.os.linux.hardware
Subject Re: Operating System Design
Date 2015-01-29 22:29 +0000
Organization A noiseless patient Spider
Message-ID <1422570593@f1.n250.z2.fidonet.ftn> (permalink)
References <maeb7f$sn9$2@reader1.panix.com>

Show all headers | View raw


Hello ruben!

Lots of words to say that they IHR must be quick so minimum of code.
Likewise the routines themselves must also be fast to ensure that no data
is lost allowing for a secondary interrupt to occur etc.

Somewhere in my libary I have 2 books on OS design with one covering the
design and implementation of Minux (this one is worth reading) but the
other is a lot older and I used it when helping to develop VME for ICL in
the early 70's. Proved very helpfull in avioding various traps.
Must remember to dig it up and by memory written around 1969-1972.
Written and published in the USA.

Vince

Thursday January 29 2015 22:11, ruben safir wrote to All:

 > I'm wondering if anyone has a background in operating system design.
 > I'm taking a class is OS's and the text is

 > OPERATING
 > SYSTEM
 > CONCEPTS
 > ABRAHAM SILBERSCHATZ
 > 9th edition, and it says something that is puzzling me



 > "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. This array, or interrupt
 > vector, of addresses is then indexed by a unique device number, given
 > with the interrupt request, to provide the address of the interrupt
 > service routine for the interrupting device. Operating systems as
 > different as Windows and UNIX dispatch interrupts in this manner."


 > ***  Instead of what?  Just because you have a table of pointers to
 > routines doesn't change the need for a routine, a generic routine
 > perhaps, from accessing that table.


 > Ruben



Vince

Back to comp.os.linux.hardware | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

Operating System Design ruben safir <ruben@mrbrklyn.com> - 2015-01-29 17:11 -0500
  Re: Operating System Design "Vince Coen" <VBCoen@gmail.com> - 2015-01-29 22:29 +0000
  Re: Operating System Design Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2015-01-29 17:38 -0500
  Re: Operating System Design Joe Pfeiffer <pfeiffer@cs.nmsu.edu> - 2015-01-29 16:07 -0700
    Re: Operating System Design Joe Pfeiffer <pfeiffer@cs.nmsu.edu> - 2015-01-29 16:16 -0700
  Re: Operating System Design David Brown <david.brown@hesbynett.no> - 2015-01-30 09:00 +0100
    Re: Operating System Design ruben safir <ruben@mrbrklyn.com> - 2015-02-01 19:34 -0500

csiph-web