1 last time (1) consistency via careful ordering avoid writing pointers to bad data can scan entire filesystem for allocated but unused stuff consistency via redo logging write intended operations to log before performing them write whether committed or not — uncommitted means nothing done on failure, redo operations in log if committed” 2 last time (2) handle data loss via redundancy mirroring — just make two copies erasure coding — store extra data that allows recovery if K of N parts lost multiple versions via copy-on-write snapshots filesystem maintains array of versions different versions use one copy of common data modify one version: copy+modify parts that are changed extra indirection to minimize what’s needs copying (e.g. split inode array) 3 mechanism: copy-on-write changing file makes new copy of filesystem common parts shared between versions snapshots filesystem snapshots idea: filesystem keeps old versions of files around accidental deletion? old version stil there eventually discard some old versions can access snapshot of files at prior time 4 snapshots filesystem snapshots idea: filesystem keeps old versions of files around accidental deletion? old version stil there eventually discard some old versions can access snapshot of files at prior time mechanism: copy-on-write changing file makes new copy of filesystem common parts shared between versions 4 challenge:unchangedupdate: new FFS/xv6/ext2 parts data of blocks file shared design has+ new big indirect array of blocks inodes + new inode don’t want to write new copy new inode ofbothentire old+new inode inode array valid inode and copy-on-write indirect blocks file data inode … … … 5 challenge:unchanged FFS/xv6/ext2 parts of file shared design has big array of inodes don’t want to write new copy of entire inode array inode and copy-on-write indirect blocks file data update: new data blocks old + new indirect blocks inode + new inode new inode both old+new inode valid … … … 5 challenge:update: new FFS/xv6/ext2 data blocks design has+ new big indirect array of blocks inodes + new inode don’t want to write new copy ofbothentire old+new inode inode array valid inode and copy-on-write indirect blocks file data unchanged parts of file shared old inode new inode … … … 5 unchangedupdate: new parts data of blocks file shared + new indirect blocks + new inode both old+new inode valid inode and copy-on-write indirect blocks file data challenge: FFS/xv6/ext2 design old has big array of inodes inode don’t want to write new copy new inode of entire inode array … … … 5 indirect blocks root inode updateunchangedmultiple one snapshots? parts inode? of inodearray of array root inodes createshared new between root versions inode … + pointers extra indirection for inode array arrays of inodes split into pieces old inode … 6 updateunchangedmultiple one snapshots? parts inode? of inodearray of array root inodes createshared new between root versions inode + pointers extra indirection for inode array arrays of inodes indirect blocks split into pieces root inode old inode … … 6 unchangedmultiple snapshots? parts of inodearray of array root inodes shared between versions extra indirection for inode array arrays of inodes indirect blocks split into pieces root inode old inode update one inode? create new root inode … + pointers … 6 updatemultiple one snapshots? inode? array of root inodes create new root inode + pointers extra indirection for inode array arrays of inodes indirect blocks split into pieces root inode old inode unchanged parts of inode array shared between versions … … 6 updateunchanged one parts inode? of inode array createshared new between root versions inode + pointers extra indirection for inode array arrays of inodes indirect blocks split into pieces root inode old inode multiple snapshots? array of root inodes … … 6 copy-on-write indirection file update = replace with new version array of versions of entire filesystem only copy modified parts keep reference counts, like for paging assignment lots of pointers — only change pointers where modifications happen 7 snapshots in practice ZFS supports this (if turned on) example: .zfs/snapshots/11.11.18-06 pseudo-directory contains contents of files at 11 November 2018 6AM 8 mounting filesystems Unix-like system root filesystem appears as / other filesystems appear as directory e.g. lab machines: my home dir is in filesystem at /net/zf15 directories that are filesystems look like normal directories /net/zf15/.. is /net (even though in different filesystems) 9 mounts on a dept. machine /dev/sda1 on / type ext4 (rw,errors=remount−ro) proc on /proc type proc (rw,noexec,nosuid,nodev) ... udev on /dev type devtmpfs (rw,mode=0755) devpts on /dev/pts type devpts (rw,noexec,nosuid,gid=5,mode=0620) tmpfs on /run type tmpfs (rw,noexec,nosuid,size=10%,mode=0755) ... /dev/sda3 on /localtmp type ext4 (rw) ... zfs1:/zf2 on /net/zf2 type nfs (rw,hard,intr,proto=udp,nfsvers=3, noacl,sloppy,addr=128.143.136.9) zfs3:/zf19 on /net/zf19 type nfs (rw,hard,intr,proto=udp,nfsvers=3, noacl,sloppy,addr=128.143.67.236) zfs4:/sw on /net/sw type nfs (rw,hard,intr,proto=udp,nfsvers=3, noacl,sloppy,addr=128.143.136.9) zfs3:/zf14 on /net/zf14 type nfs (rw,hard,intr,proto=udp,nfsvers=3, noacl,sloppy,addr=128.143.67.236) ... 10 kernel FS abstractions Linux: virtual file system API object-oriented, based on FFS-style filesystem to implement a filesystem, create object types for: superblock (represents “header”) inode (represents file) dentry (represents cached directory entry) file (represents open file) common code handles directory traversal and caches directory traversals common code handles file descriptors, etc. 11 distributed systems multiple machines working together to perform a single task called a distributed system 12 some distibuted systems models server … client client client client client/server 1 2 N-1 N node node node 1 6 7 node 2 node peer-to-peer 5 node node 3 4 13 client(s): “sometimes on” server(s): “always on” sends requests to server(s) responds to client requests never initiaties contact needs to know with a client how to contact server client/server model GET /index.html client server index.html’s contents are … 14 server(s): “always on” responds to client requests never initiaties contact with a client client/server model GET /index.html client server index.html’s contents are … client(s): “sometimes on” sends requests to server(s) needs to know how to contact server 14 client/server model GET /index.html client server index.html’s contents are … client(s): “sometimes on” server(s): “always on” sends requests to server(s) responds to client requests never initiaties contact needs to know with a client how to contact server 14 layers of servers? ad server web web application client server server web server is also application server’s client database server 15 example: Wikipedia architecture image by Timo Tijhof, via https://commons.wikimedia.org/wiki/File:Wikipedia_webrequest_flow_2015-10.png 16 example: Wikipedia architecture (zoom) image by Timo Tijhof, via https://commons.wikimedia.org/wiki/File:Wikipedia_webrequest_flow_2015-10.png 17 peer-to-peer no always-on server everyone knows about hopefully, no one bottleneck — “scalability” any machine can contact any other machine every machine plays an approx. equal role? set of machines may change over time 18 why distributed? multiple machine owners collaborating delegation of responsiblity to other entity put (part of) service “in the cloud” combine many cheap machines to replace expensive machine easier to add incrementally redundancy — one machine can fail and system still works? 19 network knowsqueuequeue how of of messages to messages get message to B fromnot sendingyet received program by waitingreceiving to be program sent mailbox model mailbox abstraction: send/receive messages machine B: “Hello” B: “Hello” machine the network A Send(B, “Hello”) Recv() = “Hello” B 20 queuequeue of of messages messages fromnot sendingyet received program by waitingreceiving to be program sent mailbox model mailbox abstraction: send/receive messages machine B: “Hello” B: “Hello” machine the network A Send(B, “Hello”) Recv() = “Hello” B network knows how to get message to B 20 network knowsqueue how of to messages get message to B not yet received by receiving program mailbox model mailbox abstraction: send/receive messages machine B: “Hello” B: “Hello” machine the network A Send(B, “Hello”) Recv() = “Hello” B queue of messages from sending program waiting to be sent 20 network knowsqueue how of messages to get message to B from sending program waiting to be sent mailbox model mailbox abstraction: send/receive messages machine B: “Hello” B: “Hello” machine the network A Send(B, “Hello”) Recv() = “Hello” B queue of messages not yet received by receiving program 20 can build this with mailbox idea send a ‘return address’ need to track related messages common abstraction that does this: the connection what about servers? client/server model: server wants to reply to clients might want to send/receive multiple messages 21 what about servers? client/server model: server wants to reply to clients might want to send/receive multiple messages can build this with mailbox idea send a ‘return address’ need to track related messages common abstraction that does this: the connection 21 extension: conections connections: two-way channel for messages extra operations: connect, accept Conn = Connect(B) B: open connection to A? Conn = Accept() A: connection to B OK! machine Send(Conn, “2 + 2 = ?”) machine