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

1. 发明申请

US20060136279A1 Synchronization of runtime and application state via batching of workflow transactions 有权
标题翻译：通过批处理工作流事务来同步运行时和应用程序状态
公开(公告)号：US20060136279A1
公开(公告)日：2006-06-22
申请号：US11023769
申请日：2004-12-22
申请人： Paul Maybee , Anandhi Somasekaran , Satish Thatte
发明人： Paul Maybee , Anandhi Somasekaran , Satish Thatte
IPC分类号： G06F15/02
CPC分类号： G06Q10/10 , G06Q10/06316 , G06Q10/0633
摘要： Workflow management for maintaining consistency of persisted state across communicating components via batching of uncommitted work. A workflow component defines a workflow containing work items to be performed by service provider components. The workflow component assigns the work items to the service provider components, and the service provider components acknowledge the assigned work items. The workflow component appends the assigned work items to a work batch. The workflow component creates a transaction containing the batched work items. The workflow component commits to the workflow by requesting the service provider components to perform the work items. The workflow component checks the state of the execution of the work items and stores the state in a persistent storage.
摘要翻译：工作流管理，用于通过批量未提交的工作来保持通信组件之间持久状态的一致性。工作流组件定义包含由服务提供商组件执行的工作项的工作流。工作流组件将工作项分配给服务提供者组件，服务提供者组件确认所分配的工作项。工作流组件将分配的工作项目附加到工作批次。工作流组件创建一个包含批处理工作项的事务。通过请求服务提供商组件来执行工作项，工作流组件提交到工作流。工作流组件检查工作项目的执行状态，并将状态存储在持久存储器中。

2. 发明授权

US08028007B2 Scalable storage and processing of hierarchical documents 失效
标题翻译：分级文件的可扩展存储和处理
公开(公告)号：US08028007B2
公开(公告)日：2011-09-27
申请号：US11348038
申请日：2006-02-06
申请人： Yossi Levanoni , Wei-Lun Lo , Sanjib Saha , Paul Maybee , Bimal Mehta , Lee Graber , Anandhi Somasekaran , Akash Sagar , Balinder Malhi , Allen Zhang , Siunie Sutjahjo
发明人： Yossi Levanoni , Wei-Lun Lo , Sanjib Saha , Paul Maybee , Bimal Mehta , Lee Graber , Anandhi Somasekaran , Akash Sagar , Balinder Malhi , Allen Zhang , Siunie Sutjahjo
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30929 , G06F17/30902 , G06F17/30938 , Y10S707/99933
摘要： Large messages in the form of hierarchically structured documents are processed in a streaming fashion using the ultimate consumer read requests as the driving force for the processing. The messages are partitioned into fixed length segments. The segments are processed in pipeline fashion. This processing chain includes simulating random access of hierarchical documents using stream transformations, mapping streams to a transport's native capabilities, composing streams into chains and using pipeline processing on the chains, staging fragments into a database and routing messages when complete messages have been formed, and providing tools to allow the end user to inspect partial messages.
摘要翻译：采用最终消费者阅读请求作为处理的驱动力，以流式方式处理层次结构化文档形式的大量消息。消息被分割成固定长度段。这些段以管道方式处理。该处理链包括使用流转换来模拟分层文档的随机访问，将流映射到传输的本机能力，将流合成链并在链上使用流水线处理，将片段分段到数据库中并在完成消息形成时路由消息;以及提供允许最终用户检查部分消息的工具。

3. 发明申请

US20060129524A1 Scalable storage and processing of hierarchical documents 失效
标题翻译：分级文件的可扩展存储和处理
公开(公告)号：US20060129524A1
公开(公告)日：2006-06-15
申请号：US11348038
申请日：2006-02-06
申请人： Yossi Levanoni , Wei-Lun Lo , Sanjib Saha , Paul Maybee , Bimal Mehta , Lee Graber , Anandhi Somasekaran , Akash Sagar , Balinder Malhi , Allen Zhang , Siunie Sutjahjo
发明人： Yossi Levanoni , Wei-Lun Lo , Sanjib Saha , Paul Maybee , Bimal Mehta , Lee Graber , Anandhi Somasekaran , Akash Sagar , Balinder Malhi , Allen Zhang , Siunie Sutjahjo
IPC分类号： G06F17/30
CPC分类号： G06F17/30929 , G06F17/30902 , G06F17/30938 , Y10S707/99933
摘要： Large messages in the form of hierarchically structured documents are processed in a streaming fashion using the ultimate consumer read requests as the driving force for the processing. The messages are partitioned into fixed length segments. The segments are processed in pipeline fashion. This processing chain includes simulating random access of hierarchical documents using stream transformations, mapping streams to a transport's native capabilities, composing streams into chains and using pipeline processing on the chains, staging fragments into a database and routing messages when complete messages have been formed, and providing tools to allow the end user to inspect partial messages.
摘要翻译：采用最终消费者阅读请求作为处理的驱动力，以流式方式处理层次结构化文档形式的大量消息。消息被分割成固定长度段。这些段以管道方式处理。该处理链包括使用流转换模拟分层文档的随机访问，将流映射到传输的本机能力，将流合成链，并在链上使用流水线处理，将片段分段到数据库中并在完成消息形成时路由消息;以及提供允许最终用户检查部分消息的工具。

4. 发明授权

US07113942B2 Scalable storage and processing of hierarchical documents 有权
公开(公告)号：US07113942B2
公开(公告)日：2006-09-26
申请号：US10609283
申请日：2003-06-27
申请人： Yossi Levanoni , Wei-Lun Lo , Sanjib Saha , Paul Maybee , Bimal Mehta , Lee Graber , Anandhi Somasekaran , Akash Sagar , Balinder Malhi , Allen Zhang , Siunie Sutjahjo
发明人： Yossi Levanoni , Wei-Lun Lo , Sanjib Saha , Paul Maybee , Bimal Mehta , Lee Graber , Anandhi Somasekaran , Akash Sagar , Balinder Malhi , Allen Zhang , Siunie Sutjahjo
IPC分类号： G06F7/00
CPC分类号： G06F17/30929 , G06F17/30902 , G06F17/30938 , Y10S707/99933
摘要： Large messages in the form of hierarchically structured documents are processed in a streaming fashion using the ultimate consumer read requests as the driving force for the processing. The messages are partitioned into fixed length segments. The segments are processed in pipeline fashion. This processing chain includes simulating random access of hierarchical documents using stream transformations, mapping streams to a transport's native capabilities, composing streams into chains and using pipeline processing on the chains, staging fragments into a database and routing messages when complete messages have been formed, and providing tools to allow the end user to inspect partial messages.

5. 发明申请

US20050015776A1 Processing convoy workflow scenarios 失效
标题翻译：处理车队工作流场景
公开(公告)号：US20050015776A1
公开(公告)日：2005-01-20
申请号：US10452961
申请日：2003-06-02
申请人： Bimal Mehta , Johannes Klein , Lee Graber , Paul Maybee , Sriram Balasubramanian , Sanjib Saha , Satish Thatte , Paul Ringseth
发明人： Bimal Mehta , Johannes Klein , Lee Graber , Paul Maybee , Sriram Balasubramanian , Sanjib Saha , Satish Thatte , Paul Ringseth
IPC分类号： G06F3/00 , G06F9/46
CPC分类号： G06F9/54 , G06F2209/542
摘要： An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure. The runtime infrastructure is tightly integrated with the underlying correlation and subscription evaluation framework.
摘要翻译： XLANG / s编译器在编译期间检测车队场景，并生成运行时指令，将传入的消息与业务流程实例正确关联。存在于事件驱动过程中的车队场景由在提供给后续接收操作的接收操作期间初始化的相关集定义。编译器通过分析XLANG / s程序的控制和数据流来检测这些车队场景。三个车队模式有区别：（1）活动车队，（2）统一的顺序车队，（3）不均匀的顺序车队。 XLANG / s允许对车队场景的声明性描述，而不需要了解支持其正确执行的低级细节。通过静态分析书面工作流应用程序来演绎应用程序使用的车队场景的性质和类型来处理方便情景。在编译时提取信息以支持运行时基础设施。运行时基础架构与底层的相关和订阅评估框架紧密集成。

6. 发明授权

US08595702B2 Simultaneously displaying multiple call stacks in an interactive debugger 有权
标题翻译：同时在交互式调试器中显示多个调用堆栈
公开(公告)号：US08595702B2
公开(公告)日：2013-11-26
申请号：US12403578
申请日：2009-03-13
申请人： Paul Maybee , Daniel Moth , Johan Marien
发明人： Paul Maybee , Daniel Moth , Johan Marien
IPC分类号： G06F9/44
CPC分类号： G06F11/3664 , G06F8/34 , G06F11/3636
摘要： Visual representations of multiple call stacks in a parallel programming system include a stack segments graph constructed by coalescing data from multiple stacks. The graph has nodes that represent stack segments and has arcs between adjacent segments. Similar stack frames are represented by the same node. In a stack prefix view of the graph, arcs are directed from a node representing stack frames to a node representing subsequently executed stack frames. In a method-centered view, an arc is shown between a node representing stack frames of a selected method and a node representing adjacent stack frames. The graph can be based on call stacks of all tasks or all threads, or based on call stacks of tasks or threads flagged by a user. Stack frame, thread, and/or task details are also displayed.
摘要翻译：并行编程系统中多个调用堆栈的视觉表示包括通过聚合来自多个堆栈的数据构建的堆栈段图。该图具有表示堆栈段并具有相邻段之间的弧的节点。类似的堆栈帧由相同的节点表示。在图的堆栈前视图中，弧表示从表示堆栈帧的节点到表示随后执行的堆栈帧的节点。在以方法为中心的视图中，在表示所选方法的堆栈帧的节点和表示相邻堆栈帧的节点之间示出了弧。该图可以基于所有任务或所有线程的调用堆栈，或者基于用户标记的任务或线程的调用堆栈。还会显示堆叠框架，线程和/或任务详细信息。

7. 发明申请

US20120159444A1 FUSING DEBUG INFORMATION FROM DIFFERENT COMPILER STAGES 审中-公开
标题翻译：从不同的编译器阶段提供调试信息
公开(公告)号：US20120159444A1
公开(公告)日：2012-06-21
申请号：US12971943
申请日：2010-12-17
申请人： Amit Kumar Agarwal , Travis Paul Dorschel , Paul Maybee
发明人： Amit Kumar Agarwal , Travis Paul Dorschel , Paul Maybee
IPC分类号： G06F9/44
CPC分类号： G06F11/3624 , G06F8/41
摘要： The present invention extends to methods, systems, and computer program products for fusing debug information from different compiler stages. Embodiments of the invention fuse debug information from a plurality of different compile stages in a code generation process into a single set of debug information. The single set of debug information maps directly between instructions and symbols (e.g., source code) input to a first compile stage and instructions and symbols (e.g., machine code) output from a last compile stage.
摘要翻译：本发明扩展到用于从不同编译器阶段对调试信息进行融合的方法，系统和计算机程序产品。本发明的实施例将来自代码生成过程中的多个不同编译阶段的调试信息融合到一组调试信息中。单个调试信息集直接映射到输入到第一编译阶段的指令和符号（例如，源代码）以及从最后编译阶段输出的指令和符号（例如，机器代码）。

8. 发明申请

US20100235815A1 SIMULTANEOUSLY DISPLAYING MULTIPLE CALL STACKS IN AN INTERACTIVE DEBUGGER 有权
标题翻译：同时在交互式调试器中同时显示多个调用堆栈
公开(公告)号：US20100235815A1
公开(公告)日：2010-09-16
申请号：US12403578
申请日：2009-03-13
申请人： Paul Maybee , Daniel Moth , Johan Marien
发明人： Paul Maybee , Daniel Moth , Johan Marien
IPC分类号： G06F9/44
CPC分类号： G06F11/3664 , G06F8/34 , G06F11/3636
摘要： Visual representations of multiple call stacks in a parallel programming system include a stack segments graph constructed by coalescing data from multiple stacks. The graph has nodes that represent stack segments and has arcs between adjacent segments. Similar stack frames are represented by the same node. In a stack prefix view of the graph, arcs are directed from a node representing stack frames to a node representing subsequently executed stack frames. In a method-centered view, an arc is shown between a node representing stack frames of a selected method and a node representing adjacent stack frames. The graph can be based on call stacks of all tasks or all threads, or based on call stacks of tasks or threads flagged by a user. Stack frame, thread, and/or task details are also displayed.
摘要翻译：并行编程系统中多个调用堆栈的视觉表示包括通过聚合来自多个堆栈的数据构建的堆栈段图。该图具有表示堆栈段并具有相邻段之间的弧的节点。类似的堆栈帧由相同的节点表示。在图的堆栈前视图中，弧表示从表示堆栈帧的节点到表示随后执行的堆栈帧的节点。在以方法为中心的视图中，在表示所选方法的堆栈帧的节点和表示相邻堆栈帧的节点之间示出了弧。该图可以基于所有任务或所有线程的调用堆栈，或者基于用户标记的任务或线程的调用堆栈。还会显示堆叠框架，线程和/或任务详细信息。

9. 发明申请

US20080276238A1 Use of Metrics to Control Throttling and Swapping in a Message Processing 有权
标题翻译：使用度量来控制消息处理中的调节和交换
公开(公告)号：US20080276238A1
公开(公告)日：2008-11-06
申请号：US12172984
申请日：2008-07-14
申请人： Yossi Levanoni , Sanjib Saha , Bimal Kumar Mehta , Paul Maybee , Lee Graber , Balasubramanian Sriram , Eldar Azerovich Musayev , Kevin Bowen Smith
发明人： Yossi Levanoni , Sanjib Saha , Bimal Kumar Mehta , Paul Maybee , Lee Graber , Balasubramanian Sriram , Eldar Azerovich Musayev , Kevin Bowen Smith
IPC分类号： G06F9/44
CPC分类号： G06F9/4881 , G06F9/5083
摘要： A system and method of using metrics to control throttling and swapping in a message processing system is provided. A workload status of a message processing system is determined, and the system polls for a new message according to the workload status. The message processing system identifies a blocked instance and calculates an expected idle time for the blocked instance. The system dehydrates the blocked instance if the expected idle time exceeds a predetermined threshold.
摘要翻译：提供了一种使用度量来控制消息处理系统中的调节和交换的系统和方法。确定消息处理系统的工作负载状态，并且系统根据工作负载状态轮询新消息。消息处理系统识别被阻止的实例并计算被阻止的实例的预期空闲时间。如果预期的空闲时间超过预定的阈值，系统将阻塞的实例脱水。

10. 发明授权

US10169199B2 Automatic model-specific debugger extensions 有权
公开(公告)号：US10169199B2
公开(公告)日：2019-01-01
申请号：US12136053
申请日：2008-06-10
申请人： Paul Maybee , Johan Marien , Brian Crawford , John Cunningham
发明人： Paul Maybee , Johan Marien , Brian Crawford , John Cunningham
IPC分类号： G06F9/44 , G06F11/36
摘要： Extensions to a debugger are identified in a debugger database which is read automatically when the debugger loads. The debugger watches for trigger events in its execution environment and optionally for load conditions in a debuggee program's internal state. If a trigger event occurs and a load condition is met, then the debugger automatically loads an extension for use. Some extensions provide debugging routines that are specifically designed to support debugging of applications which use a specific programming model.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式