home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.scheme
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!spool.mu.edu!umn.edu!csus.edu!netcom.com!thinman
- From: thinman@netcom.com (Technically Sweet)
- Subject: Re: Using memory mapping to implement continuations
- Message-ID: <1992Dec17.182503.26941@netcom.com>
- Organization: International Foundation for Internal Freedom
- References: <4051@mitech.com> <FEELEY.92Dec14215701@zohar.ai.mit.edu><4067@mitech.com><199 2Dec15.201735.21731@netcom.com><GJR.92Dec15214517@klosters.ai.mit.edu><1992Dec16.190713.20460@netcom.com> <MIKE.92Dec16130919@mystix.cs.uoregon.edu>
- Date: Thu, 17 Dec 1992 18:25:03 GMT
- Lines: 13
-
-
- Memory mapping is not necessarily slow. Some Unix implementations are.
- Under DOS you can change the stack segment register with a few
- instructions overhead; at 64k per stack you quickly run out of RAM.
- SUNos 4.2 (??) has a revamped multi-processor thread system
- which is apparently very fast; there's no reason you can't
- make the relevant page tables writeable by the user process.
-
- --
-
- Lance Norskog
-
- Data is not information is not knowledge is not wisdom.
-