专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明申请

US20110040951A1 DEDUPLICATED DATA PROCESSING RATE CONTROL 有权
标题翻译：重复数据处理速率控制
公开(公告)号：US20110040951A1
公开(公告)日：2011-02-17
申请号：US12539085
申请日：2009-08-11
申请人： Shay H. AKIRAV , Ron ASHER , Yariv BACHAR , Lior KLIPPER , Oded SONIN
发明人： Shay H. AKIRAV , Ron ASHER , Yariv BACHAR , Lior KLIPPER , Oded SONIN
IPC分类号： G06F15/76 , G06F9/30
CPC分类号： G06F17/30159 , G06F3/0641 , G06F17/30162 , H04L47/10
摘要： Various embodiments for deduplicated data processing rate control using at least one processor device in a computing environment are provided. A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times. The rate control mechanism is adapted to limit a data flow rate based on a penalty acquired during a last processing of one of the plurality of chunks in a retroactive manner, and further adapted to operate on at least one vector representation of at least one limit specification to accommodate a variety of available dimensions corresponding to the at least one limit specification.
摘要翻译：提供了在计算环境中使用至少一个处理器设备的重复数据处理速率控制的各种实施例。多个工作者被配置用于并行处理多个块中的重复数据删除的数据实体。使用速率控制机制来调节重复数据删除的数据处理速率。速率控制机制包括债务/信用算法，其指定处理重复数据删除的数据实体的多个工作者中的哪一个必须等待多个计算的所需睡眠时间中的每一个。速率控制机制适于基于在追溯方式的多个块中的一个块的最后一个处理期间获取的惩罚来限制数据流速，并且还适于对至少一个限制规范的至少一个向量表示进行操作以适应与至少一个限制规格对应的各种可用尺寸。

12. 发明申请

US20120215748A1 DEDUPLICATED DATA PROCESSING RATE CONTROL 有权
标题翻译：重复数据处理速率控制
公开(公告)号：US20120215748A1
公开(公告)日：2012-08-23
申请号：US13458772
申请日：2012-04-27
申请人： Shay H. AKIRAV , Ron ASHER , Yariv BACHAR , Lior KLIPPER , Oded SONIN
发明人： Shay H. AKIRAV , Ron ASHER , Yariv BACHAR , Lior KLIPPER , Oded SONIN
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30159 , G06F3/0641 , G06F17/30162 , H04L47/10
摘要： A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times. The rate control mechanism is adapted to limit a data flow rate based on a penalty acquired during a last processing of one of the plurality of chunks in a retroactive manner, and further adapted to operate on at least one vector representation of at least one limit specification to accommodate a variety of available dimensions corresponding to the at least one limit specification.
摘要翻译：多个工作者被配置用于并行处理多个块中的重复数据删除的数据实体。使用速率控制机制来调节重复数据删除的数据处理速率。速率控制机制包括债务/信用算法，其指定处理重复数据删除的数据实体的多个工作者中的哪一个必须等待多个计算的所需睡眠时间中的每一个。速率控制机制适于基于在追溯方式的多个块中的一个块的最后一个处理期间获取的惩罚来限制数据流速，并且还适于对至少一个限制规范的至少一个向量表示进行操作以适应与至少一个限制规格对应的各种可用尺寸。

13. 发明申请

US20110273982A1 DEDUPLICATED DATA PROCESSING CONGESTION CONTROL 有权
标题翻译：重复数据处理控制
公开(公告)号：US20110273982A1
公开(公告)日：2011-11-10
申请号：US12773136
申请日：2010-05-04
申请人： Shay H. AKIRAV , Yariv BACHAR , Asaf LEVY , Ehud MEIRI
发明人： Shay H. AKIRAV , Yariv BACHAR , Asaf LEVY , Ehud MEIRI
IPC分类号： H04L12/56
CPC分类号： H04L47/122 , G06F17/30943 , H04L67/1095 , H04L67/1097
摘要： Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a single congestion metric is determined from a sampling of a plurality of combined deduplicated data processing congestion statistics in a number of active deduplicated data processes. The congestion limit is calculated from a comparison of the single congestion metric to a congestion target setpoint, the congestion target setpoint being a virtual dimension setpoint and the congestion limit being a manipulated variable. The number of active deduplicated data processes is compared to the congestion limit. If the number of active deduplicated data processes is less than the congestion limit, a new deduplicated data process is spawned.
摘要翻译：提供了在计算环境中用于重复数据删除的数据处理拥塞控制的各种实施例。在一个这样的实施例中，从多个主动去重复数据处理的多个组合的重复数据删除的数据处理拥塞统计的采样中确定单个拥塞度量。从单个拥塞度量与拥塞目标设定点的比较计算拥塞限制，拥挤目标设定点是虚拟维度设定点，拥挤限制是操纵变量。将活动重复数据消除的数据流程的数量与拥塞限制进行比较。如果活动重复数据删除的数据流程数量小于拥塞限制，则会产生一个新的重复数据删除数据流程。

14. 发明申请

US20130325804A1 REPLICA IDENTIFICATION AND COLLISION AVOIDANCE IN FILE SYSTEM REPLICATION 有权
标题翻译：文件系统复制中的REPLICA识别和冲突避免
公开(公告)号：US20130325804A1
公开(公告)日：2013-12-05
申请号：US13489386
申请日：2012-06-05
申请人： Yariv BACHAR , Aviv CARO , Asaf LEVY , Oded SONIN
发明人： Yariv BACHAR , Aviv CARO , Asaf LEVY , Oded SONIN
IPC分类号： G06F17/30
CPC分类号： G06F17/30218 , G06F17/30117 , G06F17/3012 , G06F17/30215
摘要： A unique file-system node identification (ID) is created for each newly created node in a file system repository by combining a grid identification (ID), a repository identification (ID), and a node identification (ID) to form the unique file-system node ID. The unique file-system node ID is associated with a unique association identification (ID) for creating an association for linking the node from a source repository to a target repository when performing a replication operation between a repository and another repository. The different replication instances of the node in the file system repository are distinguished by the unique association ID assigned to each of the replication instances.
摘要翻译：通过组合网格标识（ID），存储库标识（ID）和节点标识（ID）以形成唯一文件，为文件系统存储库中的每个新创建的节点创建唯一的文件系统节点标识（ID）系统节点ID。独特的文件系统节点ID与唯一的关联标识（ID）相关联，用于在执行存储库和另一个存储库之间的复制操作时创建用于将节点从源存储库链接到目标存储库的关联。文件系统存储库中节点的不同复制实例通过分配给每个复制实例的唯一关联ID进行区分。

15. 发明申请

US20130326537A1 DEPENDENCY MANAGEMENT IN TASK SCHEDULING 有权
公开(公告)号：US20130326537A1
公开(公告)日：2013-12-05
申请号：US13489374
申请日：2012-06-05
申请人： Ron EDELSTEIN , Yariv BACHAR , Oded SONIN
发明人： Ron EDELSTEIN , Yariv BACHAR , Oded SONIN
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F9/44 , G06F9/46 , G06F9/52 , G06F9/546
摘要： A task is marked as dependent upon a preceding task. The task that is attempted to be taken for execution from a head of a pending task queue that is marked is deferred. The deferred task is removed from the pending task queue and placed in a deferred task queue. The deferred task is reinserted back into the pending task queue for execution upon determining that the preceding tasks are completed.

16. 发明申请

US20130325808A1 PRESERVING PAST STATES OF FILE SYSTEM NODES 有权
标题翻译：保存文件系统编号的过去状态
公开(公告)号：US20130325808A1
公开(公告)日：2013-12-05
申请号：US13489392
申请日：2012-06-05
申请人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
发明人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
IPC分类号： G06F17/30
CPC分类号： G06F17/30324 , G06F17/30088 , G06F17/3023 , G06F17/30339 , G06F17/30952
摘要： A selective tuple versioning is used on a files system for preserving past states of file system nodes by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system.
摘要翻译：在文件系统中使用选择性元组版本控制来通过向文件系统表中的节点添加位图来保留文件系统节点的过去状态，以保持文件系统中节点的过去状态。

17. 发明申请

US20130073532A1 COORDINATION OF EVENT LOGGING OPERATIONS AND LOG MANAGEMENT 有权
标题翻译：活动登记业务协调和日志管理
公开(公告)号：US20130073532A1
公开(公告)日：2013-03-21
申请号：US13239326
申请日：2011-09-21
申请人： Yariv BACHAR , Ron EDELSTEIN , Ehud MEIRI
发明人： Yariv BACHAR , Ron EDELSTEIN , Ehud MEIRI
IPC分类号： G06F17/30
CPC分类号： G06F11/1461 , G06F7/32 , G06F9/52 , G06F11/3476 , G06F17/30008 , G06F17/30067 , G06F17/30286 , G06F2201/825
摘要： A plurality of log processes are synchronized. Each is independently performed in parallel with one another, into a single set of log files. A line buffering mechanism of an operating system (OS) of the computing environment forecloses interleaving of the log processes. Log management operations are concurrently performed by a single process protected by a file-system lock of the OS. The log management operations include at least one of a log compression, log retention, and log rotation operation.
摘要翻译：多个日志进程同步。每个都是独立执行的，彼此并行，成一组日志文件。计算环境的操作系统（OS）的行缓冲机制抵消了日志进程的交错。日志管理操作由被操作系统的文件系统锁定保护的单个进程同时执行。日志管理操作包括日志压缩，日志保持和日志旋转操作中的至少一个。

18. 发明申请

US20120233620A1 SELECTIVE CONSTANT COMPLEXITY DISMISSAL IN TASK SCHEDULING 审中-公开
标题翻译：在任务调度中选择性的常量复杂性
公开(公告)号：US20120233620A1
公开(公告)日：2012-09-13
申请号：US13478196
申请日：2012-05-23
申请人： Yariv BACHAR , Ilai HARSGOR-HENDIN , Ehud MEIRI , Oded SONIN
发明人： Yariv BACHAR , Ilai HARSGOR-HENDIN , Ehud MEIRI , Oded SONIN
IPC分类号： G06F9/46
CPC分类号： G06F9/4881 , G06F2209/486
摘要： A strictly increasing function is implemented to generate a plurality of unique creation stamps, each of the plurality of unique creation stamps increasing over time pursuant to the strictly increasing function. A new task to be placed with the plurality of tasks is labeled with a new unique creation stamp of the plurality of unique creation stamps. The one of the list of dismissal rules holds a minimal valid creation (MVC) stamp, which is updated when a dismissal action for the one of the list of dismissal rules is executed. The dismissal action acts to dismiss a selection of tasks over time due to continuous dispatch.
摘要翻译：执行严格增加的功能以产生多个独特的创建邮票，所述多个独特的创建邮票中的每一个随着时间的推移随着严格增加的功能而增加。用多个任务放置的新任务用多个独特的创建标记的新的唯一创建印记标记。解雇规则清单中的一个包含最小有效的创建（MVC）邮票，当执行解雇规则列表中的一个撤销操作时，该邮票将被更新。由于连续派遣，解雇行动会随着时间推移解除选择任务。

19. 发明申请

US20130325806A1 PRESERVING A STATE USING SNAPSHOTS WITH SELECTIVE TUPLE VERSIONING 有权
标题翻译：使用选择性的TUPLE VERSIONING保护状态
公开(公告)号：US20130325806A1
公开(公告)日：2013-12-05
申请号：US13489365
申请日：2012-06-05
申请人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
发明人： Yariv BACHAR , Aviv KUVENT , Asaf LEVY
IPC分类号： G06F17/30
CPC分类号： G06F17/30174 , G06F17/30088
摘要： Selective tuple versioning is used on a file system providing file system snapshots using selective tuple versioning for maintaining the state of the file system.
摘要翻译：选择性元组版本控制用于使用选择性元组版本控制来提供文件系统快照的文件系统，以维护文件系统的状态。

20. 发明申请

US20120311598A1 RESOURCE ALLOCATION FOR A PLURALITY OF RESOURCES FOR A DUAL ACTIVITY SYSTEM 失效
标题翻译：资源分配用于双重活动系统的资源多样性
公开(公告)号：US20120311598A1
公开(公告)日：2012-12-06
申请号：US13151075
申请日：2011-06-01
申请人： Yariv BACHAR , Ron EDELSTEIN , Oded SONIN
发明人： Yariv BACHAR , Ron EDELSTEIN , Oded SONIN
IPC分类号： G06F9/50
CPC分类号： G06F9/50 , G06F9/5083 , G06F2209/504 , Y02D10/22
摘要： Exemplary method, system, and computer program product embodiments for resource allocation of a plurality of resources for a dual activity system by a processor device, are provided. In one embodiment, by way of example only, each of the activities may be started at a static quota. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. In response to the rejection of the resource request for the alternative one of the at least one of the dual activities, a resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary.
摘要翻译：提供了用于由处理器设备为双重活动系统的多个资源的资源分配的示例性方法，系统和计算机程序产品实施例。在一个实施例中，仅作为示例，每个活动可以以静态配额开始。对于针对至少一个双重活动的资源请求，资源边界可以被增加，直到双重活动中的至少一个的另一个活动的资源请求被拒绝为止。为了响应对双重活动中的至少一个的替代方案的资源请求的拒绝，可以减少双重活动中的至少一个的资源边界，并且可以开始减小模式之后的等待直到当前的资源使用量小于和等于资源边界的减少。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式