公开(公告)号：US20150212943A1

公开(公告)日：2015-07-30

申请号：US14164077

申请日：2014-01-24

Applicant: NetApp, Inc.

Inventor： Suli Yang ,  Kishore Kasi Udayashankar ,  Jingxin Feng ,  Swetha Kirshnan ,  Kiran Srinivasan

IPC: G06F12/08 ,  G06F17/30

CPC classification number: G06F12/0862 ,  G06F12/0866 ,  G06F12/12 ,  G06F17/30132 ,  G06F2212/1016 ,  G06F2212/314 ,  G06F2212/502 ,  G06F2212/602 ,  G06F2212/6024 ,  H04L67/2852

Abstract: A method, non-transitory computer readable medium, and device that prefetchs includes identifying a candidate data block from one of one or more immediate successor data blocks. The identified candidate data block has a historical access probability value from an initial accessed data block which is higher than a historical access probability value for each of the other immediate successor data blocks and is above a prefetch threshold value. The identifying is repeated until a next identified candidate data block has the historical access probability value below the prefetch threshold value. In the repeating, the identifying next immediate successor data blocks is from the previously identified candidate data block and the historical access probability value for each of the next immediate successor data blocks is determined from the originally accessed data block. The identified candidate data block with the historical access probability value above the prefetch threshold value is fetched.

Abstract translation: 一种方法，非暂时性计算机可读介质和预取装置包括从一个或多个立即后继数据块中的一个标识候选数据块。 所识别的候选数据块具有来自初始访问数据块的历史访问概率值，该访问概率值高于其他立即后继数据块中的每一个的历史访问概率值，并且高于预取阈值。 重复该识别，直到下一个所识别的候选数据块具有低于预取阈值的历史访问概率值。 在重复中，识别下一个直接后续数据块是从先前识别的候选数据块，并且从原始访问的数据块确定下一个立即后继数据块中的每一个的历史访问概率值。 获取具有高于预取阈值的历史访问概率值的所识别的候选数据块。

公开(公告)号：US09471497B2

公开(公告)日：2016-10-18

申请号：US14164077

申请日：2014-01-24

Applicant: NetApp, Inc.

Inventor： Suli Yang ,  Kishore Kasi Udayashankar ,  Jingxin Feng ,  Swetha Krishnan ,  Kiran Srinivasan

IPC: G06F12/00 ,  G06F12/08 ,  G06F17/30 ,  G06F12/12 ,  H04L29/08

CPC classification number: G06F12/0862 ,  G06F12/0866 ,  G06F12/12 ,  G06F17/30132 ,  G06F2212/1016 ,  G06F2212/314 ,  G06F2212/502 ,  G06F2212/602 ,  G06F2212/6024 ,  H04L67/2852

Abstract: A method, non-transitory computer readable medium, and device that prefetchs includes identifying a candidate data block from one of one or more immediate successor data blocks. The identified candidate data block has a historical access probability value from an initial accessed data block which is higher than a historical access probability value for each of the other immediate successor data blocks and is above a prefetch threshold value. The identifying is repeated until a next identified candidate data block has the historical access probability value below the prefetch threshold value. In the repeating, the identifying next immediate successor data blocks is from the previously identified candidate data block and the historical access probability value for each of the next immediate successor data blocks is determined from the originally accessed data block. The identified candidate data block with the historical access probability value above the prefetch threshold value is fetched.

Abstract translation: 一种方法，非暂时性计算机可读介质和预取装置包括从一个或多个立即后继数据块中的一个标识候选数据块。 所识别的候选数据块具有来自初始访问数据块的历史访问概率值，该访问概率值高于其他立即后继数据块中的每一个的历史访问概率值，并且高于预取阈值。 重复该识别，直到下一个所识别的候选数据块具有低于预取阈值的历史访问概率值。 在重复中，识别下一个直接后续数据块是从先前识别的候选数据块，并且从原始访问的数据块确定下一个立即后继数据块中的每一个的历史访问概率值。 获取具有高于预取阈值的历史访问概率值的所识别的候选数据块。

公开(公告)号：US20160179581A1

公开(公告)日：2016-06-23

申请号：US14576719

申请日：2014-12-19

Applicant: NetApp, Inc.

Inventor： Gokul Soundararajan ,  Jingxin Feng ,  Xing Lin

IPC: G06F9/50 ,  G06F17/30

CPC classification number: G06F9/5033

Abstract: Systems, devices, and methods are described for performing content-aware task assignment. A resource manager in a distributed computing system can identify tasks associated with a file. Each task can involve processing multiple data blocks of the file (e.g., in parallel with other processing by other tasks). The resource manager can provide block identifiers for the blocks to each of multiple computing nodes. Each computing node can store a respective subset of the blocks in a respective cache storage medium. Each subset of blocks stored at a node can be identified from the block identifiers. The resource manager can assign the task to a selected one of the computing nodes. The task can be assigned based on the selected computing node having larger subset of the blocks than one or more other computing nodes in the distributed computing system. In some embodiments, computing nodes can de-duplicate cached data using block identifiers.

Abstract translation: 描述了用于执行内容感知任务分配的系统，设备和方法。 分布式计算系统中的资源管理器可以识别与文件相关的任务。 每个任务可以涉及处理文件的多个数据块（例如，与其他任务的其他处理并行）。 资源管理器可以为多个计算节点中的每一个提供块的块标识符。 每个计算节点可以将各个块的相应子集存储在相应的高速缓存存储介质中。 可以从块标识符识别存储在节点处的块的每个子集。 资源管理器可以将任务分配给所选择的一个计算节点。 可以基于所选择的具有比分布式计算系统中的一个或多个其他计算节点更大子块子集的计算节点来分配该任务。 在一些实施例中，计算节点可以使用块标识符来重新缓存数据。

公开(公告)号：US20160275089A1

公开(公告)日：2016-09-22

申请号：US14660817

申请日：2015-03-17

Applicant: NetApp, Inc.

Inventor： Gokul Soundararajan ,  Jingxin Feng ,  Sethuraman Subbiah

IPC: G06F17/30

Abstract: A method, non-transitory computer readable medium, and system node computing device that generates a snapshot identifier and returns the snapshot identifier in response to a received request to create a snapshot of a No SQL database. When an entry in a transaction table has a first transaction value corresponding to a transaction that has been committed and a second transaction value that is not assigned or corresponds to another transaction that has not been committed, is determined. The snapshot identifier is inserted into the entry when the entry is determined to have the first transaction value corresponding to the transaction that has been committed and the second transaction value that is not assigned or corresponds to the another transaction that has not been committed.

Abstract translation: 一种方法，非暂时计算机可读介质和系统节点计算设备，其生成快照标识符并响应于接收到的请求而返回快照标识符以创建No SQL数据库的快照。 当事务表中的条目具有对应于已经提交的事务的第一事务值和未分配或对应于尚未提交的另一事务的第二事务值时。 当条目被确定为具有与已经提交的事务相对应的第一事务值和未被分配的第二事务值或者对应于尚未被提交的另一个事务时，该快照标识符被插入该条目中。

公开(公告)号：US20160275085A1

公开(公告)日：2016-09-22

申请号：US14660816

申请日：2015-03-17

Applicant: NetApp, Inc.

Inventor： Gokul Soundararajan ,  Jingxin Feng ,  Sethuraman Subbiah

IPC: G06F17/30

CPC classification number: G06F16/122

Abstract: A method, non-transitory computer readable medium, and system node computing device that facilitate a NoSQL datastore with integrated management. In some embodiments, this technology provides a fast, highly available, and application integrated NoSQL database that can be established in a data storage network such that various data management policies are automatically implemented. This technology enables application administrators to more effectively leverage NoSQL databases by storing data in tables located on storage nodes in groups and zones that have associated SLCs, as previously established upon creation of the tables or an associated entity group or database. Accordingly, management of the data is relatively integrated and data tiering can be more efficiently implemented. This technology also provides a highly scalable infrastructure that can add capacity having predictable and established service levels dynamically and that optimizes the storage of data on types of media having different characteristics in order to provide cost-effective storage.

Abstract translation: 一种方法，非暂时性的计算机可读介质和系统节点计算设备，可通过集成管理促进NoSQL数据存储。 在一些实施例中，该技术提供可以在数据存储网络中建立的快速，高可用性和应用集成的NoSQL数据库，从而自动实现各种数据管理策略。 该技术使应用程序管理员能够更有效地利用NoSQL数据库，方法是将数据存储在存储节点上的表和存储关联SLC的区域中，如先前在创建表或关联的实体组或数据库时所创建的。 因此，数据的管理相对集成，并且可以更有效地实现数据分层。 该技术还提供了高度可扩展的基础设施，可以动态地增加具有可预测和建立的服务水平的容量，并且优化在具有不同特征的介质类型上的数据的存储，以便提供具有成本效益的存储。