Linux: Distributed Storage Subsystem

“Evgeniy Polyakov, listed as the connector and w1 subsystem
maintainer, announced the first release of his distributed storage
subsystem, ‘which allows [you] to form storage on top of remote and
local nodes, which in turn can be exported to another storage as a
node to form tree-like storages.’ He describes the features of this
new block device: ‘zero additional allocations in the common fast
path not counting network allocations; zero-copy sending if
supported by device using sendpage(); ability to use any
implemented algorithm (linear algo implemented); pluggable mapping
algorithms; failover recovery in case of broken link; ability to
suspend remote node for maintenance without breaking dataflow to
another nodes (if supported by algorithm and block layer) and
without turning down main node; initial autoconfiguration (ability
to request remote node size and use that dynamic data during array
setup time); non-blocking network data processing; support for any
kind of network media (not limited to tcp or inet protocols); no
need for any special tools for data processing (like special
userspace applications) except for configuration; userspace and
kernelspace targets…'”

Complete
Story