Hi,
Doing some research on filesystems again. Back in the day, the Newton from Apple had something called soups. As far as I've read it was a data interchange format where each program had it's own soup and then it was possible to create a soup which was a union of other soups. When a program ended the system would automatically detach the soup of the program and the resource would automatically be shown as unavailable from all other soups using it. Soups seem to have been implemented simply as a list of resources which in turn could have other lists of resources. It sound a bit like directories in some sense.
This is what I've managed to dig out. Even though I think it could be implemented quite easily i'd like to have more detailed information about it. Does anyone know more about this or know a good resource? Searching google there was not much I could find...
Soups
Soups
Fudge - Simplicity, clarity and speed.
http://github.com/Jezze/fudge/
http://github.com/Jezze/fudge/
Re: Soups
Through wikipedia I found this: http://www.canicula.com/newton/prog/soups.htm
It seems very good. Will read it.
It seems very good. Will read it.
Fudge - Simplicity, clarity and speed.
http://github.com/Jezze/fudge/
http://github.com/Jezze/fudge/
Re: Soups
Looks very interesting. Would be pretty useful on modern platforms with so many external storage devices.
d3: virtualizing kernel in progress
https://github.com/WizardOfHaas/d3/
https://github.com/WizardOfHaas/d3/