1. A Filesystem for Lots Of Little Files (LOL FS) Allison Regier and Karen Hollingsworth University of Notre Dame

2. Both of us use many small files in our research projects. The Problem y1 x1 r1 y2 x2 r2 24 byte files composed of approximately 24 ascii characters: Files that are 200 to 1000 bytes each, of ascii text: AAGTCACTCG…

3. Lots of little files require lots of overhead space and time! The Problem Amount of Data Total Disk Space Used Time Single File1,000,000 Bytes = 977 KB 984 KB< 1 second 100,000 Small Files 1,000,000 Bytes = 977 KB 394 MB1106 seconds

4. We use a single large file behind-the-scenes for many small files of data. The Solution Name size flags filedata Name size flags filedata Name … 20 4 1 variable Number of bytes for each field

5.  Assumes files will be written once and not modified  Achieves excellent space performance!  Needs improvements in time performance Characteristics our file system The Solution

6. Writing 10,000 files, 10 bytes each Initial Results TimeSpace Linux12.383 seconds 40280 kilobytes LOL FS315.128 seconds 348 kilobytes

7. The Road Ahead  Improve the time performance of our filesystem  Fix memory errors that occur during large-scale testing  Perform more tests to compare our filesystem to a traditional file system Future Work