Data Structure Consistency Using Atomic Operations in Storage Devices

Devulapalli, A.; Dalessandro, D.; Wyckoff, P.

doi:10.1109/snapi.2008.14

Cited by 11 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a standards-compliant implementation, this project focuses on iSCSI transport compatibility rather than direct use by local software components. They have also explored atomic primitives in the context of attribute operations [25].…”

Section: Enterprise Storagementioning

confidence: 99%

Object storage semantics for replicated concurrent-writer file systems

Carns

Ross

Lang

2010

2010 IEEE International Conference on Cluster Computing Workshops and Posters (CLUSTER WORKSHOPS)

View full text Add to dashboard Cite

Abstract-High-performance I/O is a key requirement for many of today's critical computational science applications, and parallel file systems are being driven to progressively larger scales to keep pace with demand. One cost-effective way to meet this demand is through the deployment of commodity storage hardware in conjunction with file systems that provide software resiliency. This requires a re-evaluation of the core components of parallel file system architecture, however. In addition to interacting with resilient protocols, parallel file systems must also take into account unique HPC workloads that include bursty, highly concurrent access to large shared files. Such workloads are traditionally a challenge for software replication algorithms, in part because the underlying storage does not provide convenient semantic building blocks. In this work we isolate a common component of many parallel file systems, the object storage abstraction layer, and propose the introduction of semantic properties that will enable it to better serve as the building block for resilient HPC storage architectures. The properties that we have identified are atomicity, explicit versioning, and commutativity. We outline how these properties can be used to simplify software replication protocols for highly concurrent workloads. We also demonstrate that these properties can be implemented portably while still maintaining high performance on both commodity and enterprise-class storage platforms.

show abstract

Section: Enterprise Storagementioning

confidence: 99%

Object storage semantics for replicated concurrent-writer file systems

Carns

Ross

Lang

2010

2010 IEEE International Conference on Cluster Computing Workshops and Posters (CLUSTER WORKSHOPS)

View full text Add to dashboard Cite

show abstract

“…Devulapalli et al [24] propose extensions to the OSD standard that would allow for atomic primitives on object-based storage devices, such as compare-andswap, but do not extend the atomic interfaces through the file system to applications.…”

Section: Coordination Using Active Storagementioning

confidence: 99%

Interfaces for coordinated access in the file system

Lang

Latham

Ross

et al. 2009

2009 IEEE International Conference on Cluster Computing and Workshops

View full text Add to dashboard Cite

Distributed applications routinely used the file system for coordination of access, and often rely on POSIX consistency semantics or file system lock support for coordination. In this paper we discuss the types of coordination many distributed applications perform, the coordination model they are restricted to using with locks, and introduce an alternative coordination model in the file system. We use extended attribute support in the file system to provide atomic operations on serialization variables, and demonstrate the usefulness of this approach for a number of coordination patterns common to distributed applications.

show abstract

“…Therefore, we will assume inside the remainder of the paper that the presented strategies work in an environment that uses object-based storage. Unlike conventional block-based hard drives, object-based storage devices (OSDs) manage disk block allocation internally, exposing an interface that allows others to read and write to variably-sized, arbitrarily-named objects [Azagury et al 2003] [Devulapalli et al 2008]. …”

Section: Introductionmentioning

confidence: 99%

Random Slicing

et al. 2014

View full text Add to dashboard Cite

Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details. The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This paper presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations, drastically reducing the required amount of randomness while delivering a perfect load distribution.

show abstract

Data Structure Consistency Using Atomic Operations in Storage Devices

Cited by 11 publications

References 16 publications

Object storage semantics for replicated concurrent-writer file systems

Object storage semantics for replicated concurrent-writer file systems

Interfaces for coordinated access in the file system

Random Slicing

Contact Info

Product

Resources

About