会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 22. 发明申请
    • DISTRIBUTED SHARED MEMORY
    • 分布式共享内存
    • US20120272014A1
    • 2012-10-25
    • US13539566
    • 2012-07-02
    • Lior ARONOVICHRon ASHER
    • Lior ARONOVICHRon ASHER
    • G06F12/14
    • G06F12/145G06F9/524G06F12/08G06F12/0815G06F2212/657
    • Systems and methods for implementing a distributed shared memory (DSM) in a computer cluster in which an unreliable underlying message passing technology is used, such that the DSM efficiently maintains coherency and reliability. DSM agents residing on different nodes of the cluster process access permission requests of local and remote users on specified data segments via handling procedures, which provide for recovering of lost ownership of a data segment while ensuring exclusive ownership of a data segment among the DSM agents detecting and resolving a no-owner messaging deadlock, pruning of obsolete messages, and recovery of the latest contents of a data segment whose ownership has been lost.
    • 在其中使用不可靠的底层消息传递技术的计算机集群中实现分布式共享存储器(DSM)的系统和方法,使得DSM有效地保持一致性和可靠性。 驻留在集群过程的不同节点上的DSM代理通过处理过程访问指定数据段上的本地和远程用户的许可请求,这些处理程序提供了恢复数据段的所有权丢失,同时确保DSM代理检测中的数据段的独占所有权 解决不拥有所有者的消息传递僵局,修剪过时消息,以及恢复所有权已丢失的数据段的最新内容。
    • 24. 发明申请
    • INCREMENTAL MODIFICATION OF AN ERROR DETECTION CODE BACKGROUND OF THE INVENTION
    • 错误检测码的增量修改背景技术
    • US20130179759A1
    • 2013-07-11
    • US13348453
    • 2012-01-11
    • Lior ARONOVICHMichael HIRSCHShmuel Thomas KleinYair TOAFF
    • Lior ARONOVICHMichael HIRSCHShmuel Thomas KleinYair TOAFF
    • H03M13/09G06F11/10
    • G01R31/3167G06F11/1004H03M13/093
    • Exemplary method, system, and computer program product embodiments for an incremental modification of an error detection code operation are provided. In one embodiment, by way of example only, for a data block requiring a first error detection code (EDC) value to be calculated and verified and is undergoing modification for at least one randomly positioned sub-blocks that becomes available and modified in independent time intervals, a second EDC value is calculated for each of the randomly positioned sub-blocks. An incremental effect of the second EDC value is applied for calculating the first EDC value and for recalculating the first EDC value upon replacing at least one of the randomly positioned sub-blocks. The resource consumption is proportional to the size of at least one of the randomly positioned sub-blocks that are added and modified. Additional system and computer program product embodiments are disclosed and provide related advantages.
    • 提供了用于错误检测码操作的增量修改的示例性方法,系统和计算机程序产品实施例。 在一个实施例中,仅作为示例,对于需要计算和验证第一错误检测码(EDC)值的数据块,并且对于在独立时间变得可用和修改的至少一个随机定位的子块正在进行修改 间隔,为每个随机定位的子块计算第二EDC值。 应用第二EDC值的增量效应来计算第一EDC值,并且在替换随机定位的子块中的至少一个时重新计算第一EDC值。 资源消耗与添加和修改的随机定位的子块中的至少一个的大小成比例。 公开了附加的系统和计算机程序产品实施例并提供相关的优点。
    • 29. 发明申请
    • READ-AHEAD PROCESSING IN NETWORKED CLIENT-SERVER ARCHITECTURE
    • 网络客户端 - 服务器架构中的READ-AHEAD处理
    • US20120239749A1
    • 2012-09-20
    • US13488157
    • 2012-06-04
    • Lior ARONOVICHKonstantin MUSHKINOded SONIN
    • Lior ARONOVICHKonstantin MUSHKINOded SONIN
    • G06F15/167G06F15/16
    • G06F12/0862G06F3/067G06F12/0802G06F2212/163H04L67/42
    • Read messages are grouped by a plurality of unique sequence identifications (IDs), where each of the sequence IDs corresponds to a specific read sequence, consisting of all read and read-ahead requests related to a specific storage segment that is being read sequentially by a thread of execution in a client application. The storage system uses the sequence id value in order to identify and filter read-ahead messages that are obsolete when received by the storage system, as the client application has already moved to read a different storage segment. Basically, a message is discarded when its sequence id value is less recent than the most recent value already seen by the storage system. The sequence IDs are used by the storage system to determine corresponding read-ahead data to be loaded into a read-ahead cache.
    • 读取消息由多个唯一的序列标识(ID)分组,其中序列ID中的每一个对应于特定的读取序列,其包括与由特定存储段顺序读取的特定存储段相关的所有读取和预读请求 在客户端应用程序中执行的线程。 存储系统使用序列ID值,以便识别和过滤存储系统接收到的过期的预读消息,因为客户端应用程序已经移动到读取不同的存储段。 基本上,当其序列ID值比存储系统已经看到的最新值更新时,消息被丢弃。 序列ID由存储系统使用以确定要加载到预读高速缓存中的相应的预读数据。