320 likes | 333 Views
This paper discusses the need for operating system support for space allocation in grid storage systems and presents a model of space allocation along with three implementations: a user-level library, loopback devices, and AllocFS kernel filesystem.
E N D
Operating System Supportfor Space Allocationin Grid Storage Systems Douglas Thain University of Notre Dame IEEE Grid Computing, Sep 2006
Bad News: Many large distributed systems fall to pieces under heavy load!
Example: Grid3 (OSG) Robert Gardner, et al. (102 authors) The Grid3 Production Grid Principles and Practice IEEE HPDC 2004 The Grid2003 Project has deployed a multi-virtual organization, application-driven grid laboratory that has sustained for several months the production-level services required by… ATLAS, CMS, SDSS, LIGO…
Grid2003: The Details The good news: • 27 sites with 2800 CPUs • 40985 CPU-days provided over 6 months • 10 applications with 1300 simultaneous jobs The bad news on ATLAS jobs: • 40-70 percent utilization • 30 percent of jobs would fail. • 90 percent of failures were site problems • Most site failures were due to disk space!
task task task Job task task task task in task task task task task out task task task x 1,000,000 A Thought Experiment CPU CPU CPU CPU shared disk CPU CPU CPU CPU in out out CPU CPU CPU CPU out CPU CPU CPU CPU 1 - Only a problem when load > capacity. 2 – Grids are employed by users with infinite needs!
Need Space Allocation • Grid storage managers: • SRB - Storage Resource Broker at SDSC. • SRM – Storage Resource Manager at LBNL. • NeST – Networked Storage at UW-Madison. • IBP – Internet Backplane Protocol at UTK. • But, do not have any help from the OS. • A runaway logfile can invalidate the careful accounting of the grid storage mgr.
Outline • Grids Need OS Support for Allocation • A Model of Space Allocation • Three Implementations • User-Level Library • Loopback Devices • AllocFS: Kernel Filesystem • Application to a Cluster
alice betty A Model of Space Allocation root size:1000 GB used: 0 GB size:1000 GB used: 700 GB size:1000 GB used: 100 GB size: 100 GB used: 100 GB size: 100 GB used: 10 GB size: 100 GB used: 0 GB jobs home Three commands: mkalloc (dir) (size) lsalloc (dir) rm –rf (dir) size: 10 GB used: 5 GB size: 10 GB used: 0 GB j1 j2 data core size: 100 GB used: 0 GB size: 500 GB used: 0 GB
No Built-In Allocation Policy • In order to make an allocation: • Must have permission to mkdir. • New allocation must fit in available space. • Need something more complex? • Check remote database re global quota? • Delete allocation after a certain time? • Send email when allocation is full? • Use a storage manager at a higher level. • SRB, SRM, NeST, IBP, etc...
size: 5 GB used: 0 GB task1 task2 size: 5 GB used: 0 GB No Built-In Allocation Policy need 10 GB grid storage manager check database, charge credit card, consult human... ok, use jobs/j5 mkalloc /jobs/j5 10GB size: 100 GB used: 20 GB size: 100 GB used: 10 GB jobs setacl /jobs/j5 alice write ordinary file access size: 10 GB used: 0 GB size: 10 GB used: 5 GB j4 j5 size: 10 GB used: 0 GB (writeable by alice)
Outline • Grids Need OS Support for Allocation • A Model of Space Allocation • Three Implementations • User-Level Library • Loopback Devices • AllocFS: Kernel Filesystem • Application to a Cluster
file Appl Appl LibAlloc LibAlloc 2 - stat/write User Level Library root size:1000 GB used: 0 GB jobs size: 100 GB used: 5 GB size: 100 GB used: 0 GB 3 - unlock/write 1 - lock/read 1 - lock/read size: 10 GB used: 2 GB size: 10 GB used: 0 GB j1 j2 3 - write/unlock file 2 - stat/write
User Level Library • Some details about locking: see paper. • Applicability • Must modify apps or servers to employ. • Fails if non-enabled apps interfere. • But, can employ anywhere without privileges. • Performance • Optimization: Cache locks until idle 2 sec. • At best, writes double in latency. • At worst, shared directories ping-pong locks. • Recovery • fixalloc: traverses the directory structure and recomputes current allocations.
jobs size: 100 GB Loopback Filesystems root size:1000 GB dd if=/dev/zero of=/jobs.fs 100GB losetup /dev/loopN /jobs.fs mke2fs /dev/loopN mount /dev/loopN /jobs j1 j2 size: 10 GB file
Loopback Filesystems • Applicability • Works with any standard application. • Must be root to deploy and manage allocations. • Limited to approx 10-100 allocations. • Performance • Ordinary reads and writes: no overhead. • Allocations: Must touch every block to reserve! • Massively increases I/O traffic to disk. • Recovery • Must scan hierarchy, fsck and mount every allocation. • Disastrous for large file systems!
2 3 6 4 5 7 AllocFS: Kernel-Level Filesystem Inode Table root jobs j1 j2 file file 1 – To update allocation state, update fields in incore-inode. 2 – To create/delete an allocation, update the parent’s allocation state, which is already cached for other reasons.
AllocFS: Kernel-Level Filesystem • Applicability • Works with any ordinary application. • Must load module and be root to install. • Binary compatible with existing EXT2 filesystem. • Once loaded, ordinary users may employ. • Performance • No measurable overhead on I/O. • Creating an allocation: touch two inodes. • Deleting an allocation: same as deleting directory. • Recovery • fixalloc: traverses the directory structure and recomputes current allocations.
Allocation Performance • Loopback Filesystem • 1 second per 25 MB of allocation. (40 sec/GB) • Must touch every single block. • Big increase in unnecessary I/O traffic! • Allocation Library • 227 usec regardless of size. • Several synchronous disk ops. • Kernel Level Filesystem • 32 usec regardless of size. • Touch one inode.
Outline • Grids Need OS Support for Allocation • A Model of Space Allocation • Three Implementations • User-Level Library • Loopback Devices • AllocFS: Kernel Filesystem • Application to a Cluster
task task Job task in task task task task out task A Physical Experiment CPU CPU CPU CPU shared disk CPU CPU CPU CPU in out out CPU CPU CPU CPU out CPU CPU CPU CPU Only space for 10. Vary load: # of simultaneous jobs. Three configurations: 1 – No allocations. 2 – Backoff when failures detected. 3 – Heuristic: don’t start job unless space > threshhold. 4 – Allocate space for each job.
Summary • Grids require space allocations in order to become robust under heavy loads. • Explicit operating system support for allocations is needed in order to make them manageable and efficient. • User level approximations are possible, but have overheads in perf and mgmt. • AllocFS provides allocations compatible with EXT2 with no measurable overhead.
Library Implementation • http://www.cctools.org/chirp • Solaris, Linux, Mac, Windows • Start server with –Q 100GB
Kernel Implementation • http://www.cctools.org/allocfs • Works with Linux 2.4.21. • Install over existing EXT2 FS. • (And, uninstall without loss.) % mkalloc /mnt/alloctest/adir 25M mkalloc: /mnt/alloctest/adir allocated 25600 blocks. % lsalloc -r /mnt/alloctest USED TOTAL PCT PATH 25.01M 87.14M 28% /mnt/alloctest 10.00M 25.00M 39% /mnt/alloctest/adir
A Final Thought [Some think] traditional OS issues are either solved problems or minor problems. We believe that building such vast distributed systems upon the fragile infrastructure provided by today’s operating systems is analogous to building castles on sand. The Persistent Relevance of the Local Operating System to Global Applications Jay Lepreau, Bryan Ford, and Mike Hibler SIGOPS European Workshop, September 1996
For More Information: • Cooperative Computing Lab: • http://www.cse.nd.edu/~ccl • Douglas Thain • dthain@cse.nd.edu • Related Talks: • “Grid Deployment of Bioinformatics Apps...” • Session 4A Friday • “Cacheable Decentralized Groups...” • Session 5B Friday
Existing Tools Not Suitable for the Grid • User and Group Quotas • Don’t always correspond to allocation needs! • User might want one alloc per job. • Or, many users may want to share an alloc. • Disk Partitions • Very expensive to create, change, manage. • Not hierarchical: only root can manage. • ZFS Allocations • Cheap to create, change, manage. • Not hierarchical: only root can manage.