A Case for Optimistic Coordination in HPC Storage Systems
|Title||A Case for Optimistic Coordination in HPC Storage Systems|
|Publication Type||Conference Paper|
|Year of Publication||2012|
|Authors||Carns, PH, Harms, K, Kimpe, D, Wozniak, JM, Ross, RB, Ward, L, Curry, M, Klundt, R, Danielson, G, Karakoyunlu, C, Chandy, JA, Settlemyer, B, Gropp, WD|
|Conference Location||Salt Lake City, UT|
High-performance computing (HPC) storage systems rely on access coordination to ensure that concurrent updates do not produce incoherent results. HPC storage systems typically employ pessimistic distributed locking to provide this functionality in cases where applications cannot perform their own coordination. This approach, however, introduces significant performance overhead and complicates fault handling.
In this work we evaluate the viability of optimistic conditional storage operations as an alternative to distributed locking in HPC storage systems. We investigate design strategies and compare the two approaches in a prototype object storage system using a parallel read/modify/write benchmark. Our prototype illustrates that conditional operations can be easily integrated into distributed object storage systems and can outperform standard coordination primitives for simple update workloads. Our experiments show that conditional updates can achieve over two orders of magnitude higher performance than pessimistic locking for some parallel read/modify/write workloads.