Re: [9fans] vfork and paging

[forsyth@vitanuova.com]

[-- Attachment #1: Type: text/plain, Size: 541 bytes --]

the bits required aren't there in the hardware page tables, but you
can either emulate them or do copy on reference.  if you use a paging
algorithm with local policy instead of the global one used by
berkeley, you can also prevent some pathetic effects under load, and
remove complex data structures and code (or not require them in the
first place).  this was well studied during the late 1960s and early
1970s.  the BSD approach is poor.  unfortunately, people mimic it.
i can only assume that one or more textbooks wrote it up.


[-- Attachment #2: Type: message/rfc822, Size: 1967 bytes --]

To: 9fans@cse.psu.edu
Subject: Re: [9fans] authorization schemes (was CORBA)
Date: Mon, 1 Oct 2001 09:49:55 GMT
Message-ID: <3BB3722D.2D77B4BE@null.net>

Boyd Roberts wrote:
> vfork()?  was the v for vomit?

According to some of the Berkeleyites, there was a flaw in
the VAX-11/750 memory management unit (microcode?) such
that they were unable to use copy-on-write.  When I
mentioned this to the AT&T UNIX System V developers, they
said it seemed to work fine for them..