公开(公告)号：US06766365B1

公开(公告)日：2004-07-20

申请号：US09310289

申请日：1999-05-12

Applicant: Jiandong Huang ,  Yuewei Wang

Inventor： Jiandong Huang ,  Yuewei Wang

IPC: G06F15173

CPC classification number: H04L47/822 ,  H04L47/2433 ,  H04L47/245 ,  H04L47/70 ,  H04L47/745 ,  H04L47/765 ,  H04L47/782 ,  H04L47/805

Abstract: A global resource manager is provided for each node of a plurality of nodes of a distributed data processing system. Each node can be a coordinator node, an intermediate node, and a leaf node depending on the node at which a session arrives for global processing. In response to the arriving sessions, the global resource managers implement ripple scheduling by conducting a global QoS negotiation and adaptation, and preemption if necessary, in order to determine if the arriving session is supportable by the distributed data processing system. More specifically, the resource managers of all nodes determine whether their corresponding nodes can support the arriving session. The resource managers of the coordinator node and all intermediate nodes request their child nodes to indicate whether the child nodes can support the arriving session. The resource managers of all intermediate nodes and all leaf nodes respond to their coordinating or intermediate nodes with an indication of supportability. The resource manager of the coordinator node sends a commit message if all nodes can support the arriving session.

公开(公告)号：US06751666B1

公开(公告)日：2004-06-15

申请号：US09310798

申请日：1999-05-12

Applicant: Jiandong Huang ,  Yuewei Wang

Inventor： Jiandong Huang ,  Yuewei Wang

IPC: G06F15173

CPC classification number: H04L47/822 ,  H04L47/2433 ,  H04L47/245 ,  H04L47/70 ,  H04L47/745 ,  H04L47/765 ,  H04L47/782 ,  H04L47/805

Abstract: A global resource manager is provided for each node of a plurality of nodes of a distributed data processing system. Each node can be a coordinator node, an intermediate node, and a leaf node depending on the node at which a session arrives for global processing. In response to the arriving sessions, the global resource managers implement ripple scheduling by conducting a global QoS negotiation and adaptation, and preemption if necessary, in order to determine if the arriving session is supportable by the distributed data processing system. More specifically, the resource managers of all nodes determine whether their corresponding nodes can support the arriving session. The resource managers of the coordinator node and all intermediate nodes request their child nodes to indicate whether the child nodes can support the arriving session. The resource managers of all intermediate nodes and all leaf nodes respond to their coordinating or intermediate nodes with an indication of supportability. The resource manager of the coordinator node sends a commit message if all nodes can support the arriving session.

Abstract translation: 为分布式数据处理系统的多个节点的每个节点提供全球资源管理器。 根据会话到达的节点，每个节点可以是协调节点，中间节点和叶节点，用于全局处理。 响应于到达的会话，全球资源管理器通过进行全局QoS协商和适配来实现纹波调度，并且如有必要，进行抢占，以便确定到达的会话是否可由分布式数据处理系统支持。 更具体地说，所有节点的资源管理器确定它们对应的节点是否可以支持到达的会话。 协调器节点和所有中间节点的资源管理器请求其子节点来指示子节点是否可以支持到达的会话。 所有中间节点和所有叶节点的资源管理器对其协调或中间节点进行响应，并具有可支持性的指示。 如果所有节点都可以支持到达的会话，则协调器节点的资源管理器发送提交消息。

公开(公告)号：US07882262B2

公开(公告)日：2011-02-01

申请号：US11207329

申请日：2005-08-18

Applicant: Partha Bhattacharya ,  Yuewei Wang ,  Eli Nathaniel Stevens ,  Gheorghe Mircea Sasu

Inventor： Partha Bhattacharya ,  Yuewei Wang ,  Eli Nathaniel Stevens ,  Gheorghe Mircea Sasu

IPC: G06F15/173 ,  G06F17/30 ,  G06F11/00

CPC classification number: G06F17/30386

Abstract: A system and method of generating an overall top N query result from multiple sets of sessionized network events that correspond to different time periods include identifying a subset within each set of network events whose event attributes satisfy a predefined query, generating an aggregation result table for each identified subset of network events in accordance with an aggregation attribute, identifying matching first and second entries in first and second aggregation result tables that have a same aggregation attribute value, generating a new entry in a query result table by merging the matching first and second entries together, and selecting entries in the query result table that have highest session counts as the overall top N query result.

Abstract translation: 从对应于不同时间段的多组会话网络事件生成整个前N个查询结果的系统和方法包括：识别事件属性满足预定义查询的每组网络事件的子集，生成每个 根据聚合属性确定网络事件的子集，识别具有相同聚合属性值的第一和第二聚合结果表中的匹配第一和第二条目，通过将匹配的第一和第二条目合并，在查询结果表中生成新条目 并且选择具有最高会话计数的查询结果表中的条目作为整体前N个查询结果。

公开(公告)号：US20070043703A1

公开(公告)日：2007-02-22

申请号：US11207329

申请日：2005-08-18

Applicant: Partha Bhattacharya ,  Yuewei Wang ,  Eli Stevens ,  Gheorghe Sasu

Inventor： Partha Bhattacharya ,  Yuewei Wang ,  Eli Stevens ,  Gheorghe Sasu

IPC: G06F17/30

CPC classification number: G06F17/30386

Abstract: A system and method of generating an overall top N query result from multiple sets of sessionized network events that correspond to different time periods include identifying a subset within each set of network events whose event attributes satisfy a predefined query, generating an aggregation result table for each identified subset of network events in accordance with an aggregation attribute, identifying matching first and second entries in first and second aggregation result tables that have a same aggregation attribute value, generating a new entry in a query result table by merging the matching first and second entries together, and selecting entries in the query result table that have highest session counts as the overall top N query result.

Abstract translation: 从对应于不同时间段的多组会话网络事件生成整个前N个查询结果的系统和方法包括：识别事件属性满足预定义查询的每组网络事件的子集，生成每个 根据聚合属性确定网络事件的子集，识别具有相同聚合属性值的第一和第二聚合结果表中的匹配第一和第二条目，通过将匹配的第一和第二条目合并，在查询结果表中生成新条目 并且选择具有最高会话计数的查询结果表中的条目作为整体前N个查询结果。

公开(公告)号：US06446125B1

公开(公告)日：2002-09-03

申请号：US08827536

申请日：1997-03-28

Applicant: Jiandong Huang ,  Yuewei Wang

Inventor： Jiandong Huang ,  Yuewei Wang

IPC: G06F15173

CPC classification number: H04L47/822 ,  H04L47/2433 ,  H04L47/245 ,  H04L47/70 ,  H04L47/745 ,  H04L47/765 ,  H04L47/782 ,  H04L47/805

Abstract: A global resource manager is provided for each node of a plurality of nodes of a distributed data processing system. Each node can be a coordinator node, an intermediate node, and a leaf node depending on the node at which a session arrives for global processing. In response to the arriving sessions, the global resource managers implement ripple scheduling by conducting a global QoS negotiation and adaptation, and preemption if necessary, in order to determine if the arriving session is supportable by the distributed data processing system. More specifically, the resource managers of all nodes determine whether their corresponding nodes can support the arriving session. The resource managers of the coordinator node and all intermediate nodes request their child nodes to indicate whether the child nodes can support the arriving session. The resource managers of all intermediate nodes and all leaf nodes respond to their coordinating or intermediate nodes with an indication of supportability. The resource manager of the coordinator node sends a commit message if all nodes can support the arriving session.

公开(公告)号：US08910188B1

公开(公告)日：2014-12-09

申请号：US13428249

申请日：2012-03-23

Applicant: Yuewei Wang ,  Algis P. Rudys ,  Stewart Yang

Inventor： Yuewei Wang ,  Algis P. Rudys ,  Stewart Yang

IPC: G06F3/00 ,  G06F9/44 ,  G06F9/46 ,  G06F13/00

CPC classification number: G06F9/542 ,  G06Q30/02

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for processing event data. In one aspect, a method includes assigning events to event bundles based on timestamps associated with the events. Each event bundle contains events having timestamps that are within a pre-specified period of time. Event batches are created, where each event batch includes a pre-specified number of event bundles. A first event batch is provided to a first computing group and a second computing group. The first computing group is configured to perform a first processing stage, and the second computing group is configured to perform a second processing stage. A determination is made that a threshold number of the event bundles in the first event batch have been processed by the first computing group. In response to the determination, a second event batch is provided to each of the computing groups.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于处理事件数据。 在一个方面，一种方法包括基于与事件相关联的时间戳将事件分配给事件束。 每个事件包包含具有在预定时间段内的时间戳的事件。 创建事件批次，其中每个事件批次包含预先指定的事件包数。 将第一事件批次提供给第一计算组和第二计算组。 第一计算组被配置为执行第一处理阶段，并且第二计算组被配置为执行第二处理阶段。 确定第一事件批中的事件束的阈值数目已被第一计算组处理。 响应于该确定，向每个计算组提供第二事件批次。

公开(公告)号：US06446126B1

公开(公告)日：2002-09-03

申请号：US09307803

申请日：1999-05-12

Applicant: Jiandong Huang ,  Yuewei Wang

Inventor： Jiandong Huang ,  Yuewei Wang

IPC: G06F15173

CPC classification number: H04L47/822 ,  H04L47/2433 ,  H04L47/245 ,  H04L47/70 ,  H04L47/745 ,  H04L47/765 ,  H04L47/782 ,  H04L47/805

Abstract: A global resource manager is provided for each node of a plurality of nodes of a distributed data processing system. Each node can be a coordinator node, an intermediate node, and a leaf node depending on the node at which a session arrives for global processing. In response to the arriving sessions, the global resource managers implement ripple scheduling by conducting a global QoS negotiation and adaptation, and preemption if necessary, in order to determine if the arriving session is supportable by the distributed data processing system. More specifically, the resource managers of all nodes determine whether their corresponding nodes can support the arriving session. The resource managers of the coordinator node and all intermediate nodes request their child nodes to indicate whether the child nodes can support the arriving session. The resource managers of all intermediate nodes and all leaf nodes respond to their coordinating or intermediate nodes with an indication of supportability. The resource manager of the coordinator node sends a commit message if all nodes can support the arriving session.

Abstract translation: 为分布式数据处理系统的多个节点的每个节点提供全球资源管理器。 根据会话到达的节点，每个节点可以是协调节点，中间节点和叶节点，用于全局处理。 响应于到达的会话，全球资源管理器通过进行全局QoS协商和适配来实现纹波调度，并且如有必要，进行抢占，以便确定到达的会话是否可由分布式数据处理系统支持。 更具体地说，所有节点的资源管理器确定它们对应的节点是否可以支持到达的会话。 协调器节点和所有中间节点的资源管理器请求其子节点来指示子节点是否可以支持到达的会话。 所有中间节点和所有叶节点的资源管理器对其协调或中间节点进行响应，并具有可支持性的指示。 如果所有节点都可以支持到达的会话，则协调器节点的资源管理器发送提交消息。