公开(公告)号：US10140312B2

公开(公告)日：2018-11-27

申请号：US15081647

申请日：2016-03-25

Applicant: Amazon Technologies, Inc.

Inventor： Jacob A. Strauss ,  Mark Allen Fogleman ,  Edward William Naim ,  Jacob David Luszcz ,  Michael Robert Frasca ,  Daniel Nussbaum ,  Peter Jones ,  Xiaobin Wu ,  John McClain ,  Neal John Charbonneau ,  Wayne William Duso

IPC: G06F17/30

Abstract: A low latency metadata subsystem for file systems in low latency (LL) mode in a distributed file storage service (DFSS). An LL server (LLS) may receive metadata requests from an access node of the DFSS. For read operations, the LLS may check a local cache of metadata and, for cache hits, retrieve the metadata from the cache. For cache misses, the metadata may be fetched from the storage subsystem of the DFSS and cached. For write operations, the LLS may write entries into a journal for the file system and notify the access node after the journal entries are committed to the journal; the journal entries are asynchronously committed in the storage subsystem. The access node may communicate with the storage subsystem to perform data reads and writes for the LL file system.

公开(公告)号：US09495478B2

公开(公告)日：2016-11-15

申请号：US14231095

申请日：2014-03-31

Applicant: Amazon Technologies, Inc.

Inventor： Joshua Samuel Hendrickson ,  Matti Juhani Oikarinen ,  Alex Haugland ,  Pradeep Vincent ,  Matteo Frigo ,  Xiaobin Wu

IPC: G06F17/30

CPC classification number: G06F17/30958 ,  G06F17/30097

Abstract: A directed acyclic graph (DAG) is generated to represent a namespace of a directory. In response to a request to create a new object with a specified name, a hash value bit sequence is computed for the name. A plurality of levels of the DAG are navigated using successive subsequences of the bit sequence to identify a candidate node for storing a new entry corresponding to the specified name. If the candidate node meets a split criterion, the new entry and at least a selected subset of entries of the candidate node's list of entries are distributed among a plurality of DAG nodes, including at least one new DAG node, using respective bit sequences obtained by applying the hash function for each distributed entry.

Abstract translation: 生成有向无环图（DAG）来表示目录的命名空间。 响应于创建具有指定名称的新对象的请求，为该名称计算哈希值比特序列。 使用比特序列的连续子序列导航多个DAG级别，以识别用于存储与指定名称相对应的新条目的候选节点。 如果候选节点满足分割标准，则候选节点的条目列表的新条目和至少一个选定的条目子集在包括至少一个新的DAG节点的多个DAG节点之间分配，使用由 对每个分布式条目应用散列函数。