Systems and/or methods for policy-based access to data in memory tiers
    2.
    发明授权
    Systems and/or methods for policy-based access to data in memory tiers 有权
    用于内存层数据的基于策略的访问的系统和/或方法

    公开(公告)号:US09465752B2

    公开(公告)日:2016-10-11

    申请号:US14569026

    申请日:2014-12-12

    发明人: Manish Devgan

    摘要: Certain example embodiments provide efficient policy-based access to data stored in memory tiers, including volatile local in-process (L1) cache memory of an application and at least one managed (e.g., non-volatile) in-memory (L2) cache. Operations include receiving an access request for access to a data element in L2; detecting whether a copy of the data element is in L1; if so, copying the data element and the access policy from L2 to L1 and providing the user with access to the copy of data element from L1 if the access policy allows access to the user; and if not, determining, by referring to a copy of the access policy stored in L1, whether the user is allowed to access the data element, and, if the user is allowed to access the data element, providing the user with access to the copy of the data element from the L1 cache memory.

    摘要翻译: 某些示例性实施例提供对存储在存储器层中的数据的有效的基于策略的访问,包括应用的易失性本地进程(L1)高速缓存存储器和至少一个被管理(例如,非易失性)存储器(L2)高速缓存。 操作包括在L2中接收访问数据元素的访问请求; 检测数据元素的副本是否在L1中; 如果是,则将数据元素和访问策略从L2复制到L1,并且如果访问策略允许访问用户,则向用户提供对来自L1的数据元素的副本的访问; 如果不是,则通过参考存储在L1中的访问策略的副本来确定是否允许用户访问数据元素,并且如果允许用户访问数据元素,则向用户提供对 数据元素从L1高速缓存存储器复制。

    Systems and/or methods for leveraging in-memory storage in connection with the shuffle phase of MapReduce

    公开(公告)号:US10990288B2

    公开(公告)日:2021-04-27

    申请号:US14449517

    申请日:2014-08-01

    IPC分类号: G06F3/06

    摘要: Certain example embodiments relate to a computer system for performing a map reduce sequence. Nodes therein include at least one processor and memory and are divided into at least mapper and reducer nodes. Each mapper node executes a map function on input to generate intermediate output elements. Each said intermediate output element includes a first key-value pair. Each element key includes associated map and reduce task identifiers. Each element value includes substantive data, organized as another key-value pair. The intermediate output elements are stored to memory. Each reducer node: retrieves at least intermediate output element values from the memory of a given mapper node, using specified map and reduce task identifiers; stores the retrieved element values to its memory; executes a reduce function on the retrieved element values, in order; and outputs a result from the reduce function for the map reduce sequence. Disk operations advantageously are reduced or eliminated.