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

1. 发明申请

US20070214142A1 System and method for providing transaction support across a plurality of data structures 审中-公开
标题翻译：用于跨多个数据结构提供事务支持的系统和方法
公开(公告)号：US20070214142A1
公开(公告)日：2007-09-13
申请号：US11373041
申请日：2006-03-10
申请人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
发明人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
IPC分类号： G06F17/30
CPC分类号： G06Q30/02
摘要： A system and method for providing transaction support across a plurality of data structures is disclosed. Generally, a transaction status directory indicating a transaction is in a prepare state is created. It is determined whether a first data structure is able to perform a first set of operations to complete the transaction. The first data structure is locked in response to determining the first data structure is able to perform the first set of instructions and instructions are sent to the first data structure to perform the set of operations. The first data structure is modified and a log of each modification of the first data structure is kept in case modification needs to be undone. It is then determined if a second data structure is able to perform a second set of operations to complete the transaction. In one embodiment, the second data structure is locked and instructions are sent to the second data structure to perform the set of operations. The second data structure is modified and a log of each modification of the second data structure is kept in case modification needs to be undone. The transaction status directory is then modified to indicate the transaction is in a commit phase, the log of modifications to the first and second data structures are deleted, and the locks of the first and second data structures are released.
摘要翻译：公开了一种用于跨多个数据结构提供事务支持的系统和方法。通常，创建指示事务处于准备状态的事务状态目录。确定第一数据结构是否能够执行第一组操作以完成交易。响应于确定第一数据结构能够执行第一组指令而将第一数据结构锁定，并且指令被发送到第一数据结构以执行该组操作。修改第一个数据结构，并保留第一个数据结构的每个修改的日志，以防修改需要撤消。然后确定第二数据结构是否能够执行第二组操作以完成交易。在一个实施例中，第二数据结构被锁定，并且指令被发送到第二数据结构以执行该组操作。修改第二个数据结构，并保留第二个数据结构的每个修改的日志，以防修改需要撤消。然后修改事务状态目录以指示事务处于提交阶段，删除对第一和第二数据结构的修改日志，并释放第一和第二数据结构的锁。

2. 发明申请

US20070214161A1 System and method for resource lock acquisition and reclamation in a network file system environment 有权
标题翻译：网络文件系统环境下资源锁获取和回收的系统和方法
公开(公告)号：US20070214161A1
公开(公告)日：2007-09-13
申请号：US11372878
申请日：2006-03-10
申请人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
发明人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
IPC分类号： G06F7/00
CPC分类号： G06Q30/02 , G06F9/466 , G06F9/526 , G06F17/30171
摘要： A system and method for acquiring, releasing, and reclaiming a lock of a data structure in a network file system (“NFS”) is disclosed. Generally, a text file is created in a management library of the data structure. The name of the text file comprises an identifier of the lock, an identifier of a process attempting to acquire the lock, and an identifier of a machine on which the process attempting to acquire the lock is running. The identifier of the process attempting to acquire the lock and the identifier of the machine on which the process attempting to acquire the lock is running is saved in the contents of the text file and a hard line is created pointing to the text file. Finally, a number of links pointing to the text file is determined and a lock of the data structure is granted based on the number of links pointing to the text file.
摘要翻译：公开了一种用于获取，释放和回收网络文件系统（“NFS”）中的数据结构的锁的系统和方法。通常，在数据结构的管理库中创建文本文件。文本文件的名称包括锁的标识符，尝试获取锁的进程的标识符以及尝试获取锁的进程正在其上运行的机器的标识符。尝试获取锁的进程的标识符和尝试获取锁的进程正在运行的机器的标识符被保存在文本文件的内容中，并且创建指向文本文件的硬线。最后，确定指向文本文件的多个链接，并且基于指向文本文件的链接的数量来授予数据结构的锁定。

3. 发明申请

US20070214457A1 System and method for automated recovery of data in a batch processing system 审中-公开
标题翻译：在批处理系统中自动恢复数据的系统和方法
公开(公告)号：US20070214457A1
公开(公告)日：2007-09-13
申请号：US11372709
申请日：2006-03-10
申请人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
发明人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
IPC分类号： G06F9/46
CPC分类号： G06F11/1438 , G06F11/076 , G06F16/1774
摘要： A system and method for automatic recovery of a unit of work in a batch processing system is disclosed. Generally, a unit of work is placed in a todo queue to store the unit of work for processing. Access to the unit of work is provided to a data structure for processing and the unit of work is moved from the todo queue to an in-progress queue. An error is detected in the processing of the unit of work and a retry count of the unit of work is compared to a maximum retry count of the unit of work. Finally, the unit of work is moved to the todo queue for re-processing or to a failed queue for further analysis based on the comparison of the retry count to the maximum retry count.
摘要翻译：公开了一种用于在批处理系统中自动恢复工作单元的系统和方法。一般来说，一个工作单位放置在一个待排队列中，以存储要处理的工作单元。对工作单元的访问被提供给用于处理的数据结构，并且将工作单元从工作队列移动到正在进行的队列。在工作单元的处理中检测到错误，并将工作单元的重试次数与工作单元的最大重试次数进行比较。最后，根据重试计数与最大重试次数的比较，将工作单元移动到待处理队列进行重新处理或进入故障队列进行进一步分析。

4. 发明申请

US20070214381A1 System and method for automated recovery after an error in a batch processing system caused by malformatted or unsupported data 有权
标题翻译：由于格式不正确或不受支持的数据导致批量处理系统发生错误后的自动恢复系统和方法
公开(公告)号：US20070214381A1
公开(公告)日：2007-09-13
申请号：US11373040
申请日：2006-03-10
申请人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
发明人： Prabhakar Goyal , Prashant Rao , Jatin Patel , Ilya Slain
IPC分类号： G06F11/00
CPC分类号： G06F11/0793 , G06F11/0715 , G06F11/0757 , G06F11/1482 , G06Q10/06 , G06Q30/02
摘要： A system and method for automated recovery of processing of a unit of work during an error in a batch processing system is disclosed. Generally, at least a portion of a unit of work and instructions of operations to perform to process the portion of the unit of work is sent to a worker data structure. A periodic heartbeat is received from the worker data structure indicating the worker data structure is processing the at least a portion of the unit of work. If an unexpected termination of the worker data structure is detected, a signal is sent to a crash handler data structure instructing the crash handler data structure to detect and store a current input location of the at a portion of the unit of work. The records from the current location at the crash are skipped during reprocessing of the unit of work to increase the chances of success during reprocessing.
摘要翻译：公开了一种用于在批处理系统中的错误期间自动恢复工作单元的处理的系统和方法。通常，工作单元的至少一部分和用于执行以处理工作单元的部分的操作指令被发送到工作者数据结构。从工作者数据结构接收到周期性心跳，指示工作人员数据结构正在处理工作单元的至少一部分。如果检测到工作者数据结构意外终止，则将信号发送到崩溃处理程序数据结构，指示崩溃处理程序数据结构检测并存储工作单元的一部分的当前输入位置。在工作单位的后处理过程中，跳过当前坠机地点的记录，以增加后处理中成功的机会。

5. 发明授权

US11367295B1 Graphical user interface for presentation of events 有权
公开(公告)号：US11367295B1
公开(公告)日：2022-06-21
申请号：US12870694
申请日：2010-08-27
申请人： Ashutosh Joshi , Aparna Gupta , Binay Mohanty , Jalvin Upadhyay , Rajiv Arora , Martin Betz , Michael Prospero , David Cooke , Prashant Rao
发明人： Ashutosh Joshi , Aparna Gupta , Binay Mohanty , Jalvin Upadhyay , Rajiv Arora , Martin Betz , Michael Prospero , David Cooke , Prashant Rao
IPC分类号： G06F16/951 , G06F3/0482 , G06V30/40 , G06K9/00
摘要： Some embodiments provide a method for generating a graphical user interface (GUI) for a research system. The method receives a request from a user of the research system for information about a particular category. The method generates a chart that displays a set of events associated with the particular category over a particular period of time. The method incorporates the chart into a GUI for the particular category for transmission to the user. Some embodiments generate a list of events associated with the particular category and generate a GUI that displays the list of the events. Each event is represented in the list by a title of a document identified by the research system as representative of the event.

6. 发明授权

US08058899B2 Logic cell array and bus system 有权
标题翻译：逻辑单元阵列和总线系统
公开(公告)号：US08058899B2
公开(公告)日：2011-11-15
申请号：US12371040
申请日：2009-02-13
申请人： Martin Vorbach , Frank May , Dirk Reichardt , Frank Lier , Gerd Ehlers , Armin Nückel , Volker Baumgarte , Prashant Rao , Jens Oertel
发明人： Martin Vorbach , Frank May , Dirk Reichardt , Frank Lier , Gerd Ehlers , Armin Nückel , Volker Baumgarte , Prashant Rao , Jens Oertel
IPC分类号： H03K19/199 , G06F7/52
CPC分类号： G06F13/4027 , G06F9/3001 , G06F13/4022 , G06F15/7825 , G06F15/7867 , G06F15/80 , G06F15/8023 , G06F15/8092 , G06F15/82 , Y02D10/12 , Y02D10/13 , Y02D10/14 , Y02D10/151
摘要： A logic cell array having a number of logic cells and a segmented bus system for logic cell communication, the bus system including different segment lines having shorter and longer segments for connecting two points in order to be able to minimize the number of bus elements traversed between separate communication start and end points.
摘要翻译：具有多个逻辑单元的逻辑单元阵列和用于逻辑单元通信的分段总线系统，所述总线系统包括具有较短和较长段的不同段线，用于连接两个点，以便能够最小化在单独的通信开始和结束点。

7. 发明申请

US20120072699A1 LOGIC CELL ARRAY AND BUS SYSTEM 有权
标题翻译：逻辑单元阵列和总线系统
公开(公告)号：US20120072699A1
公开(公告)日：2012-03-22
申请号：US13289296
申请日：2011-11-04
申请人： Martin VORBACH , Frank May , Dirk Reichardt , Frank Lier , Gerd Ehlers , Armin Nückel , Volker Baumgarte , Prashant Rao , Jens Oertel
发明人： Martin VORBACH , Frank May , Dirk Reichardt , Frank Lier , Gerd Ehlers , Armin Nückel , Volker Baumgarte , Prashant Rao , Jens Oertel
IPC分类号： G06F15/76 , G06F9/02
CPC分类号： G06F13/4027 , G06F9/3001 , G06F13/4022 , G06F15/7825 , G06F15/7867 , G06F15/80 , G06F15/8023 , G06F15/8092 , G06F15/82 , Y02D10/12 , Y02D10/13 , Y02D10/14 , Y02D10/151
摘要： A logic cell array having a number of logic cells and a segmented bus system for logic cell communication, the bus system including different segment lines having shorter and longer segments for connecting two points in order to be able to minimize the number of bus elements traversed between separate communication start and end points.
摘要翻译：具有多个逻辑单元的逻辑单元阵列和用于逻辑单元通信的分段总线系统，所述总线系统包括具有较短和较长段的不同段线，用于连接两个点，以便能够最小化在单独的通信开始和结束点。

8. 发明授权

US08488608B2 System and method for traffic distribution in a multi-chassis link aggregation 有权
标题翻译：多机箱链路聚合中流量分配的系统和方法
公开(公告)号：US08488608B2
公开(公告)日：2013-07-16
申请号：US13010414
申请日：2011-01-20
申请人： Sindhu K. Mohandas , Prashant Rao
发明人： Sindhu K. Mohandas , Prashant Rao
IPC分类号： H04L12/28
CPC分类号： H04L49/552 , H04L45/22 , H04L45/245 , H04L45/28 , H04L45/586 , Y02D50/30
摘要： A pair of aggregation switches is connected to an edge node by a multi-chassis link aggregation group, wherein the aggregation switches are connected by a virtual fabric link (VFL) for exchange of information between the Aggregation Switches. The VFL includes a plurality of subsets of VFL physical links, wherein each subset is connected to a different pair of network interface modules on the Aggregation Switches. Traffic distribution across the plurality of subsets of VFL physical links is based on destination hardware device information in a pre-pended header of packets and/or based on a load balancing identifier in the pre-pended header.
摘要翻译：一对聚合交换机通过多机箱链路聚合组连接到边缘节点，其中聚合交换机由虚拟网络链路（VFL）连接，用于在聚合交换机之间交换信息。 VFL包括多个VFL物理链路子集，其中每个子集连接到聚合交换机上不同的一对网络接口模块。跨VFL物理链路的多个子集的流量分配基于分组的预先提取的报头中的目的地硬件设备信息和/或基于预先提供的报头中的负载平衡标识符。

9. 发明授权

US08463790B1 Event naming 有权
标题翻译：事件命名
公开(公告)号：US08463790B1
公开(公告)日：2013-06-11
申请号：US12870691
申请日：2010-08-27
申请人： Ashutosh Joshi , Aparna Gupta , Binay Mohanty , Jalvin Upadhyay , Rajiv Arora , Martin Betz , Michael Prospero , David Cooke , Prashant Rao
发明人： Ashutosh Joshi , Aparna Gupta , Binay Mohanty , Jalvin Upadhyay , Rajiv Arora , Martin Betz , Michael Prospero , David Cooke , Prashant Rao
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30011
摘要： Some embodiments provide a machine-implemented method. The method identifies an event for a particular category based on a number of documents classified as relevant to the particular category in a particular period of time. Based on content of the documents classified as relevant to the particular category, the method identifies a set of keywords for the event. The method uses the keywords to automatically select a representative document for the event. Some embodiments store a link to the representative document and automatically determine whether the particular document is still accessible at the link. When the document is no longer accessible at the link, the method replaces the document with a backup document as the representative document for the event.
摘要翻译：一些实施例提供了机器实现的方法。该方法基于在特定时间段内被分类为与特定类别相关的文档的数量来识别特定类别的事件。根据分类为与特定类别相关的文档的内容，该方法识别事件的一组关键字。该方法使用关键字为事件自动选择代表性文档。一些实施例存储到代表性文档的链接并且自动确定该特定文档是否仍然可在链接处访问。当链接不再可访问文档时，该方法将替换文档作为事件的代表性文档。

10. 发明申请

US20120033669A1 SYSTEM AND METHOD FOR TRAFFIC DISTRIBUTION IN A MULTI-CHASSIS LINK AGGREGATION 有权
标题翻译：用于多重链接聚合中的交通分配的系统和方法
公开(公告)号：US20120033669A1
公开(公告)日：2012-02-09
申请号：US13010414
申请日：2011-01-20
申请人： Sindhu K. Mohandas , Prashant Rao
发明人： Sindhu K. Mohandas , Prashant Rao
IPC分类号： H04L12/56
CPC分类号： H04L49/552 , H04L45/22 , H04L45/245 , H04L45/28 , H04L45/586 , Y02D50/30
摘要： A pair of aggregation switches is connected to an edge node by a multi-chassis link aggregation group, wherein the aggregation switches are connected by a virtual fabric link (VFL) for exchange of information between the Aggregation Switches. The VFL includes a plurality of subsets of VFL physical links, wherein each subset is connected to a different pair of network interface modules on the Aggregation Switches. Traffic distribution across the plurality of subsets of VFL physical links is based on destination hardware device information in a pre-pended header of packets and/or based on a load balancing identifier in the pre-pended header.
摘要翻译：一对聚合交换机通过多机箱链路聚合组连接到边缘节点，其中聚合交换机由虚拟网络链路（VFL）连接，用于在聚合交换机之间交换信息。 VFL包括多个VFL物理链路子集，其中每个子集连接到聚合交换机上不同的一对网络接口模块。跨VFL物理链路的多个子集的流量分配基于分组的预先提取的报头中的目的地硬件设备信息和/或基于预先提供的报头中的负载平衡标识符。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式