公开(公告)号：US20140109101A1

公开(公告)日：2014-04-17

申请号：US14141089

申请日：2013-12-26

Applicant: NetApp, Inc.

Inventor： Prashanth Radhakrishnan ,  Kiran Srinivasan

IPC: G06F9/48 ,  G06F12/08

CPC classification number: G06F9/4881 ,  G06F9/5033 ,  G06F12/0806 ,  G06F12/0811 ,  G06F12/084 ,  G06F2209/483 ,  G06F2209/484

Abstract: A novel technique for improving throughput in a multi-core system in which data is processed according to a producer-consumer relationship by eliminating latencies caused by compulsory cache misses. The producer and consumer entities run as multiple slices of execution. Each such slice has an associated execution context that comprises of the code and data that particular slice would access. The execution contexts of the producer and consumer slices are small enough to fit in the processor caches simultaneously. When a producer entity scheduled on a first core completed production of data elements as constrained by the size of cache memories, a consumer entity is scheduled on that same core to consume the produced data elements. Meanwhile, a second slice of the producer entity is moved to another core and a second slice of a consumer entity is scheduled to consume elements produced by the second slice of the producer.

Abstract translation: 一种用于提高多核系统中吞吐量的新技术，其中通过消除由强制高速缓存未命中引起的延迟，根据生产者 - 消费者关系处理数据。 生产者和消费者实体作为多个执行片段运行。 每个这样的片具有相关联的执行上下文，其包括特定切片将访问的代码和数据。 生产者和消费者片段的执行上下文足够小以同时适应处理器高速缓存。 当调度在第一核心上的生产者实体完成数据元素的生产受到高速缓冲存储器大小的约束时，消费者实体被调度在同一个核心上以消耗生成的数据元素。 同时，生成器实体的第二片段被移动到另一个核心，消费者实体的第二片段被调度为消耗由生成器的第二片段产生的元素。

公开(公告)号：US20150370486A1

公开(公告)日：2015-12-24

申请号：US14585084

申请日：2014-12-29

Applicant: NetApp, Inc.

Inventor： Lakshmi Narayanan Bairavasundaram ,  Garth Goodson ,  Vipul Mathur ,  Shankar Pasupathy ,  Gokul Soundararajan ,  Kiran Srinivasan ,  Kaladhar Vorungati

IPC: G06F3/06 ,  H04L29/08 ,  G06F9/455

CPC classification number: G06F3/067 ,  G06F3/0611 ,  G06F3/0653 ,  G06F9/45558 ,  G06F12/109 ,  G06F2009/45583 ,  G06F2009/45595 ,  H04L67/1097

Abstract: The techniques introduced here provide for efficient management of storage resources in a modern, dynamic data center through the use of virtual storage appliances. Virtual storage appliances perform storage operations and execute in or as a virtual machine on a hypervisor. A storage management system monitors a storage system to determine whether the storage system is satisfying a service level objective for an application. The storage management system then manages (e.g., instantiates, shuts down, or reconfigures) a virtual storage appliance on a physical server. The virtual storage appliance uses resources of the physical server to meet the storage related needs of the application that the storage system cannot provide. This automatic and dynamic management of virtual storage appliances by the storage management system allows storage systems to quickly react to changing storage needs of applications without requiring expensive excess storage capacity.

Abstract translation: 这里介绍的技术通过使用虚拟存储设备来提供现代动态数据中心中的存储资源的有效管理。 虚拟存储设备执行存储操作，并在虚拟机管理程序中或作为虚拟机执行。 存储管理系统监视存储系统以确定存储系统是否满足应用的服务级目标。 存储管理系统然后管理（例如，实例化，关闭或重新配置）物理服务器上的虚拟存储设备。 虚拟存储设备使用物理服务器的资源来满足存储系统无法提供的应用程序的存储相关需求。 存储管理系统对虚拟存储设备的自动和动态管理允许存储系统快速响应应用中不断变化的存储需求，而不需要昂贵的超额存储容量。

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