> * Fast and scalable multithreaded userspace server. Being inThat's interesting :-) That sounds great, but what do you mean by 'novel'? Don't other modern network filesystems use asynchronous requests and replies in some form? It seems like the obvious thing. By transactions, do you mean an atomic set of writes/changes? Or do you trace read dependencies too? This is extremely cool, and obviously the right thing to do. No sane network filesystem would be without it, one naively hopes :-) How is it different from NFSv4 leases and SMB oplocks? Or are they the same basic idea? With all those asynchronous requests, are your writeback caches fully coherent? Example. Client A reads file X (data: x0), then writes X (new data: x1), then reads Y (data: y0), then writes Y (data: y1). Client B reads Y then reads X. Is it guaranteed that client B cannot ever get data y1 and x0? A fully coherent system (meaning behaves like a local filesystem) does guarantee that. If cache requests for file X and file Y are independent, this is not guaranteed. -- Jamie --
| H. Peter Anvin | Re: [RFC 00/15] x86_64: Optimize percpu accesses |
| Greg Kroah-Hartman | [PATCH 008/196] Chinese: add translation of volatile-considered-harmful.txt |
| Greg KH | Re: Dual-Licensing Linux Kernel with GPL V2 and GPL V3 |
| Alex Chiang | [PATCH 1/4] Remove path attribute from sgi_hotplug |
git: | |
| Jarek Poplawski | [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | Re: [GIT]: Networking |
| Eric Dumazet | Re: [PATCH 3/3] Convert the UDP hash lock to RCU |
