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

1. 发明申请

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.

2. 发明申请

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.
摘要翻译：提供了用于由处理器设备为双重活动系统的多个资源的资源分配的示例性方法，系统和计算机程序产品实施例。在一个实施例中，仅作为示例，每个活动可以以静态配额开始。对于针对至少一个双重活动的资源请求，资源边界可以被增加，直到双重活动中的至少一个的另一个活动的资源请求被拒绝为止。为了响应对双重活动中的至少一个的替代方案的资源请求的拒绝，可以减少双重活动中的至少一个的资源边界，并且可以开始减小模式之后的等待直到当前的资源使用量小于和等于资源边界的减少。

3. 发明申请

US20130325803A1 USER INITIATED REPLICATION IN A SYNCHRONIZED OBJECT REPLICATION SYSTEM 有权
标题翻译：用户在同步对象复制系统中进行重启
公开(公告)号：US20130325803A1
公开(公告)日：2013-12-05
申请号：US13489383
申请日：2012-06-05
申请人： Shay AKIRAV , Yariv BACHAR , Ron EDELSTEIN , Asaf LEVY , Oded SONIN
发明人： Shay AKIRAV , Yariv BACHAR , Ron EDELSTEIN , Asaf LEVY , Oded SONIN
IPC分类号： G06F17/30
CPC分类号： G06F17/30581 , G06F11/1451 , G06F11/1464 , G06F17/30327 , G06F17/30575 , G06F17/30578
摘要： A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. The snapshot replication job is added to the end of a replication queue to await execution for the synchronized object replication. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. The unsynchronized objects in the target destination are synchronized based upon the comparison of the state of the selected objects in the snapshot with the current state of the target destination at the time of execution of the snapshot replication job.
摘要翻译：响应于用户启动的复制，创建源存储库中所选对象的快照。快照被指定为快照复制作业。快照复制作业将添加到复制队列的末尾以等待执行同步的对象复制。通过在快照复制作业执行时比较快照中所选对象的状态与目标目标的当前状态来检测目标目标中的未同步对象。基于在快照复制作业执行时将快照中所选择的对象的状态与目标目标的当前状态进行比较，目标目标中的不同步对象被同步。

4. 发明申请

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）邮票，当执行解雇规则列表中的一个撤销操作时，该邮票将被更新。由于连续派遣，解雇行动会随着时间推移解除选择任务。

5. 发明申请

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.
摘要翻译：提供了在计算环境中使用至少一个处理器设备的重复数据处理速率控制的各种实施例。多个工作者被配置用于并行处理多个块中的重复数据删除的数据实体。使用速率控制机制来调节重复数据删除的数据处理速率。速率控制机制包括债务/信用算法，其指定处理重复数据删除的数据实体的多个工作者中的哪一个必须等待多个计算的所需睡眠时间中的每一个。速率控制机制适于基于在追溯方式的多个块中的一个块的最后一个处理期间获取的惩罚来限制数据流速，并且还适于对至少一个限制规范的至少一个向量表示进行操作以适应与至少一个限制规格对应的各种可用尺寸。

6. 发明申请

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进行区分。

7. 发明申请

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.
摘要翻译：多个工作者被配置用于并行处理多个块中的重复数据删除的数据实体。使用速率控制机制来调节重复数据删除的数据处理速率。速率控制机制包括债务/信用算法，其指定处理重复数据删除的数据实体的多个工作者中的哪一个必须等待多个计算的所需睡眠时间中的每一个。速率控制机制适于基于在追溯方式的多个块中的一个块的最后一个处理期间获取的惩罚来限制数据流速，并且还适于对至少一个限制规范的至少一个向量表示进行操作以适应与至少一个限制规格对应的各种可用尺寸。

8. 发明申请

US20120047507A1 SELECTIVE CONSTANT COMPLEXITY DISMISSAL IN TASK SCHEDULING 有权
标题翻译：在任务调度中选择性的常量复杂性
公开(公告)号：US20120047507A1
公开(公告)日：2012-02-23
申请号：US12859467
申请日：2010-08-19
申请人： 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
摘要： Various embodiments for selective constant complexity dismissal in task scheduling of a plurality of tasks are provided. 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）邮票，当执行解雇规则列表中的一个撤销操作时，该邮票将被更新。由于连续派遣，解雇行动会随着时间推移解除选择任务。

9. 发明申请

US20120239749A1 READ-AHEAD PROCESSING IN NETWORKED CLIENT-SERVER ARCHITECTURE 有权
标题翻译：网络客户端 - 服务器架构中的READ-AHEAD处理
公开(公告)号：US20120239749A1
公开(公告)日：2012-09-20
申请号：US13488157
申请日：2012-06-04
申请人： Lior ARONOVICH , Konstantin MUSHKIN , Oded SONIN
发明人： Lior ARONOVICH , Konstantin MUSHKIN , Oded SONIN
IPC分类号： G06F15/167 , G06F15/16
CPC分类号： G06F12/0862 , G06F3/067 , G06F12/0802 , G06F2212/163 , H04L67/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由存储系统使用以确定要加载到预读高速缓存中的相应的预读数据。

10. 发明申请

US20120144123A1 READ-AHEAD PROCESSING IN NETWORKED CLIENT-SERVER ARCHITECTURE 审中-公开
标题翻译：网络客户端 - 服务器架构中的READ-AHEAD处理
公开(公告)号：US20120144123A1
公开(公告)日：2012-06-07
申请号：US12958196
申请日：2010-12-01
申请人： Lior ARONOVICH , Konstantin MUSHKIN , Oded SONIN
发明人： Lior ARONOVICH , Konstantin MUSHKIN , Oded SONIN
IPC分类号： G06F12/08
CPC分类号： G06F12/0862 , G06F3/067 , G06F12/0802 , G06F2212/163 , H04L67/42
摘要： Various embodiments for read-ahead processing in a networked client-server architecture by a processor device are provided. 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由存储系统使用以确定要加载到预读高速缓存中的相应的预读数据。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式