RadFS is a modification of HDFS that aims to improve random access performance through caching and pooling of file handles. It implements all interactions with DataNodes as stateless positioned reads. This reduces server load and allows connections and threads to be reused. Benchmark results show RadFS provides faster random reads than HDFS, though caching adds overhead and the checksum implementation requires two reads per operation. Further work is needed to optimize checksumming and implement pipelining for improved streaming performance.

1. RadFS Random Access DFS

4. DFS Anatomy – seek + read()

6. RadFS Overview

11. Random Reads – 2kb (avg in ms)

13. Sequence File Binary Search 5000 searches, avg ms per search

15. Streaming – 1GB 1b reads, time in seconds

16. Streaming 1GB 2k reads, time in seconds

17. Going forward – modular reader