🚀 go-pugleaf

In article <2850@sdcsvax.UCSD.EDU> bagwill@decuac.DEC.COM (Bob Bagwill) writes:
>  With large address spaces and virtual memory, who
>needs files?  Why not define all storage as extended memory structures
>that may be loaded as needed.

That's approximately the approach I'm taking with the OS I'm writing
for the 80386, which supports both segmentation and paging.  My project
is to build a prototype implementation of the proposed MIL-STD-1838a,
aka. CAISa (Common APSE (Ada Programmer Support Environment) Interface
Set, revision a.  This system doesn't really have a "file system;"
instead, it has an entity-relationship-attribute data base with
strongly-typed components.  I'm mapping the components directly to
386 segments in virtual memory, and letting the underlying paging
system move them back and forth between RAM and disk.  User programs
will access data in ways that are half-way between file access and
manipulating memory-resident data structures.  BTW, the whole thing
is being written in Ada.

There don't seem to be very many people out there doing anything with
the 386's ability to do demand paging.  I'd love to share experiences
and even code (my stuff is all public domain, and MITRE is good at
keeping proprietary data secure).

              -- Bob