home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.arch
- Path: sparky!uunet!caen!sdd.hp.com!elroy.jpl.nasa.gov!david
- From: david@elroy.jpl.nasa.gov (David Robinson)
- Subject: Re: Scheduling in Shared Memory Multiprocessor Systems
- Message-ID: <1992Jul24.183213.9699@elroy.jpl.nasa.gov>
- Organization: Image Analysis Systems Group, JPL
- References: <1992Jul15.040528.16289@access.usask.ca> <GLEW.92Jul23215649@pdx007.intel.com>
- Date: Fri, 24 Jul 1992 18:32:13 GMT
- Lines: 14
-
- In article <GLEW.92Jul23215649@pdx007.intel.com> glew@pdx007.intel.com (Andy Glew) writes:
- >Gould PN machines used a simple affinity algorithm:
- > The run queue was divided into 32 priorities (each a single chain)
- > - the classic BSD run queue.
- Isn't this an artifact of the Vax architecture having 32 hardware
- queues and instructions to manipulate them? Have most BSD vendors
- kept this structure or gone with something radically different?
-
- -David
- --
- David Robinson david@elroy.jpl.nasa.gov
- Disclaimer: No one listens to me anyway! '92 GS500E DoD #480
- "An addiction is a drag" - Dennis Hopper '90 EX250R Ninja
- "A tisket, a tasket, a condom or a casket" - Dr. Carl Bell
-