公开(公告)号：US08898669B2

公开(公告)日：2014-11-25

申请号：US11830195

申请日：2007-07-30

申请人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

发明人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

IPC分类号： G06F9/46 ,  G06F9/48

CPC分类号： G06F9/4881 ,  G06F2209/484 ,  G06F2209/485

摘要： Automated techniques are disclosed for coordinating request or transaction processing in a data processing system. For example, a technique for handling requests in a data processing system comprises the following steps. A compound request comprising at least two individual requests of different types is received. An individual request r1 of the compound request is placed on a queue for requests of type t1, wherein t1 is the request type of r1. After r1 has reached the front of the queue, it is determined if at least one individual request of said compound request can execute. The compound request is executed if it is determined that all individual requests of the compound request can execute.

摘要翻译： 公开了用于在数据处理系统中协调请求或事务处理的自动化技术。 例如，在数据处理系统中处理请求的技术包括以下步骤。 接收到包含至少两个不同类型的单独请求的复合请求。 复合请求的单个请求r1被放置在类型为t1的请求的队列上，其中t1是r1的请求类型。 在r1到达队列的前面之后，确定是否可以执行所述复合请求的至少一个单独请求。 如果确定复合请求的所有单独请求都可以执行，则执行复合请求。

公开(公告)号：US20110225594A1

公开(公告)日：2011-09-15

申请号：US12723914

申请日：2010-03-15

申请人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich M. Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

发明人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich M. Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

IPC分类号： G06F9/46

CPC分类号： G06F9/46 ,  G06F9/505 ,  G06F2209/501 ,  G06F2209/5019 ,  H04L67/1008

摘要： In a computer system comprising a plurality of computing devices wherein the plurality of computing devices processes a plurality of tasks and each task has a task type, a method for determining overheads associated with task types comprises the following steps. Overheads are estimated for a plurality of task types. One of the plurality of computing devices is selected to execute one of the plurality of tasks, wherein the selection comprises estimating load on at least a portion of the plurality of computing devices from tasks assigned to at least a portion of the plurality of computing devices and the estimates of overheads of the plurality of task types. One or more of the estimates of overheads of the plurality of task types are varied.

摘要翻译： 在包括多个计算设备的计算机系统中，其中所述多个计算设备处理多个任务，并且每个任务具有任务类型，用于确定与任务类型相关联的开销的方法包括以下步骤。 估计多个任务类型的开销。 选择多个计算设备中的一个来执行多个任务中的一个，其中所述选择包括从分配给所述多个计算设备的至少一部分的任务估计所述多个计算设备的至少一部分上的负载，以及 多个任务类型的开销的估计。 改变多个任务类型的开销的估计中的一个或多个。

公开(公告)号：US20110125903A1

公开(公告)日：2011-05-26

申请号：US12625806

申请日：2009-11-25

申请人： Ignacio Silva-Lepe ,  Arun Kwangil Iyengar ,  Thomas Arthur Mikalsen ,  Isabelle M. Rouvellou ,  Revathi Subramanian

发明人： Ignacio Silva-Lepe ,  Arun Kwangil Iyengar ,  Thomas Arthur Mikalsen ,  Isabelle M. Rouvellou ,  Revathi Subramanian

IPC分类号： G06F15/173 ,  G06F15/16

CPC分类号： G06F9/5055

摘要： Systems, methods, apparatus and articles of manufacture are disclosed for tracking, propagation and matching of messages pertaining to the interest in and availability of services across autonomous service domains In one embodiment of the invention, a system of distributed, federated service domains in a service-oriented environment is provided wherein each service domain comprises: a plurality of locally provided services; a plurality of service requesters; and a service registry comprising descriptions of: one or more locally provided services; and one or more requested services, each of the requested services being one of: a fulfilled reference to a foreign service; and an unfulfilled reference to a foreign service.

摘要翻译： 公开了用于跟踪，传播和匹配关于跨越自主服务域的服务的兴趣和可用性的消息的系统，方法，装置和制品在本发明的一个实施例中，服务中的分布式，联合服务域的系统 提供了一种面向对象的环境，其中每个服务域包括：多个本地提供的服务; 多个服务请求者; 以及包括以下描述的服务注册表：一个或多个本地提供的服务; 和一个或多个所请求的服务，每个所请求的服务是以下之一：对外部服务的满足的引用; 和对外国服务的未兑现的参考。

公开(公告)号：US20090327817A1

公开(公告)日：2009-12-31

申请号：US12147763

申请日：2008-06-27

申请人： Arun Kwangil Iyengar ,  Thomas Repantis

发明人： Arun Kwangil Iyengar ,  Thomas Repantis

IPC分类号： G06F17/30 ,  G06F11/07

CPC分类号： G06F17/30348 ,  G06F2201/82

摘要： Techniques for coordinating updates to replicated data are disclosed. For example, in a system comprised of a plurality of nodes, a method for maintaining consistent copies of data across said nodes comprises the following steps. A copy of an object o1 is maintained by a plurality of nodes. In response to a request r1 to update a copy of object o1, a message is sent to at least some of said plurality of nodes instructing a node receiving the message to invalidate its copy of object o1. In response to a node n1 receiving an invalidation message arising from r1 wherein n1 is processing another request r2 to update object o1, requests r1 and r2 are coordinated to prevent the requests from causing conflicting updates or invalidations.

摘要翻译： 公开了用于协调对复制数据的更新的技术。 例如，在由多个节点组成的系统中，用于在所述节点之间维持一致的数据副本的方法包括以下步骤。 对象o1的副本由多个节点维护。 响应于更新对象o1的副本的请求r1，向所述多个节点中的至少一些节点发送消息，指示接收到该消息的节点使其对象o1的副本无效。 响应于接收到由r1产生的无效消息的节点n1，其中n1正在处理另一请求r2来更新对象o1，协调请求r1和r2以防止请求引起冲突的更新或无效。

公开(公告)号：US20090271798A1

公开(公告)日：2009-10-29

申请号：US12110813

申请日：2008-04-28

申请人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich Miles Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

发明人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich Miles Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

IPC分类号： G06F9/46

CPC分类号： G06F9/505 ,  G06F9/5033 ,  H04L65/1006 ,  H04L67/1002 ,  H04L67/1023 ,  H04L67/1027

摘要： Techniques are disclosed for load balancing in networks such as those networks handling telephony applications. By way of example, a method for directing requests associated with calls to servers in a system comprised of a network routing calls between a plurality of nodes wherein a node participates in a call as a caller or a receiver and wherein a load balancer sends requests associated with calls to a plurality of servers comprises the following steps. A request associated with a node belonging to a group including a plurality of nodes is received. A server is selected to receive the request. A subsequent request is received. A determination is made whether or not the subsequent request is associated with a node belonging to the group. The subsequent request is sent to the server based on determining that the subsequent request is associated with a node belonging to the group. By way of another example, a method for balancing requests among servers in a client server environment wherein a load balancer sends requests associated with a client to a plurality of servers comprises the following steps. Information is maintained regarding a weighted number of requests assigned to each server. The load balancer receives a request from a client. A server s1 is selected to receive the request by examining the maintained information and identifying a server with a least weighted number of requests assigned thereto. The load balancer sends the request to server s1 and increments a weighted number of requests assigned to server s1 in the maintained information. In response to receiving a notification from server s1 that the request has completed, a weighted number of requests assigned to server s1 is decremented in the maintained information.

摘要翻译： 公开了用于诸如处理电话应用的那些网络的网络中的负载平衡的技术。 作为示例，一种用于将与呼叫相关联的请求定向在由多个节点之间的网络路由呼叫组成的系统中的服务器的方法，其中节点作为呼叫者或接收者参与呼叫，并且其中负载平衡器发送相关联的请求 对多个服务器的呼叫包括以下步骤。 接收与属于包括多个节点的组的节点相关联的请求。 选择服务器接收请求。 接收到后续请求。 确定后续请求是否与属于该组的节点相关联。 基于确定后续请求与属于该组的节点相关联，将后续请求发送到服务器。 作为另一示例，用于在客户端服务器环境中的服务器之间平衡请求的方法，其中负载平衡器将与客户端相关联的请求发送到多个服务器包括以下步骤。 维护关于分配给每个服务器的加权数量的信息。 负载均衡器从客户端接收请求。 选择服务器s1以通过检查维护的信息并识别具有分配给其的最少加权数量的服务器来接收请求。 负载平衡器将请求发送到服务器s1，并在维护的信息中增加分配给服务器s1的加权数量。 响应于从服务器s1接收到请求已经完成的通知，分配给服务器s1的加权数量在维护的信息中减少。

公开(公告)号：US07574563B2

公开(公告)日：2009-08-11

申请号：US11502213

申请日：2006-08-10

申请人： James Robert Harold Challenger ,  Louis Ralph Degenaro ,  Robert Filepp ,  Arun Kwangil Iyengar ,  Richard Pervin King

发明人： James Robert Harold Challenger ,  Louis Ralph Degenaro ,  Robert Filepp ,  Arun Kwangil Iyengar ,  Richard Pervin King

IPC分类号： G06F12/00 ,  G06F13/00

CPC分类号： G06F17/30902 ,  G06F17/30451

摘要： Methods for serving data include maintaining an incomplete version of an object at a server and at least one fragment at the server. In response to a request for the object from a client, the incomplete version of the object, an identifier for a fragment comprising a portion of the object, and a position for the fragment within the object are sent to the client. After receiving the incomplete version of the object, the identifier, and the position, the client requests the fragment from the server using the identifier. The object is constructed by including the fragment in the incomplete version of the object in a location specified by the position.

摘要翻译： 用于服务数据的方法包括在服务器处维护对象的不完整版本以及在服务器处保留至少一个片段。 响应于来自客户端的对象的请求，对象的不完整版本，包含对象的一部分的片段的标识符和对象内的片段的位置被发送到客户端。 在接收到对象的不完整版本，标识符和位置后，客户端使用标识符从服务器请求片段。 该对象通过将该片段包含在该位置指定的位置的不完整版本的对象中来构造。

公开(公告)号：US20090037913A1

公开(公告)日：2009-02-05

申请号：US11830195

申请日：2007-07-30

申请人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

发明人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

IPC分类号： G06F9/46

CPC分类号： G06F9/4881 ,  G06F2209/484 ,  G06F2209/485

摘要： Automated techniques are disclosed for coordinating request or transaction processing in a data processing system. For example, a technique for handling requests in a data processing system comprises the following steps. A compound request comprising at least two individual requests of different types is received. An individual request r1 of the compound request is placed on a queue for requests of type t1, wherein t1 is the request type of r1. After r1 has reached the front of the queue, it is determined if at least one individual request of said compound request can execute. The compound request is executed if it is determined that all individual requests of the compound request can execute.

摘要翻译： 公开了用于在数据处理系统中协调请求或事务处理的自动化技术。 例如，在数据处理系统中处理请求的技术包括以下步骤。 接收到包含至少两个不同类型的单独请求的复合请求。 复合请求的单个请求r1被放置在类型为t1的请求的队列上，其中t1是r1的请求类型。 在r1到达队列的前面之后，确定是否可以执行所述复合请求的至少一个单独请求。 如果确定复合请求的所有单独请求都可以执行，则执行复合请求。

公开(公告)号：US20080276244A1

公开(公告)日：2008-11-06

申请号：US12173502

申请日：2008-07-15

申请人： Arun Kwangil Iyengar

发明人： Arun Kwangil Iyengar

IPC分类号： G06F9/46

CPC分类号： G06F11/3466 ,  G06F11/3409

摘要： A method for communicating information from a first computing node to at least one of the following: a storage device and a second computing node. The first computing node is monitored to collect at least one estimate of available resources, and based on this estimate, an amount of data collected is modified. Then, the modified data is sent to at least one of the following: the storage device and the second computing node. This invention also provides for the determination of an optimum batch size for aggregating data wherein, for a number of batch sizes, costs are estimated for sending batched information to persistent storage and for losing batched data. Then, the optimum batch size is selected from the number of different batch sizes based on sums of these costs. This invention also provides for selective compression of data, wherein it is determined which of a number of compression algorithms do not incur an overhead that exceeds available resources. Then, one of the determined algorithms is selected to maximize compression.

摘要翻译： 一种用于将信息从第一计算节点传送到以下的至少一个的方法：存储设备和第二计算节点。 监视第一计算节点以收集至少一个可用资源的估计，并且基于该估计，修改收集的数据量。 然后，将修改的数据发送到以下至少一个：存储设备和第二计算节点。 本发明还提供用于确定用于聚合数据的最佳批量大小，其中对于多个批量大小，估计用于将批量信息发送到持久存储器并丢失批量数据的成本。 然后，基于这些成本的总和，从不同批量大小的数量中选择最佳批量大小。 本发明还提供对数据的选择性压缩，其中确定多个压缩算法中的哪一个不会引起超出可用资源的开销。 然后，选择确定的算法之一以最大化压缩。

公开(公告)号：US20080235397A1

公开(公告)日：2008-09-25

申请号：US12132811

申请日：2008-06-04

申请人： Louis R. Degenaro ,  Lei Gao ,  Arun Kwangil Iyengar ,  Jian Yin

发明人： Louis R. Degenaro ,  Lei Gao ,  Arun Kwangil Iyengar ,  Jian Yin

IPC分类号： G06F15/173

CPC分类号： G06F9/5083 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1017 ,  H04L67/1023 ,  H04L2029/06054

摘要： Improved load balancing techniques are disclosed. For example, in one illustrative aspect of the invention, a method of satisfying requests in a system comprised of a plurality of servers comprises the following steps. At least one load balancer is provided for routing requests to the plurality of servers. At the at least one load balancer, a request sent from a client is obtained. At the at least one load balancer, the request is examined. Costs of satisfying the request by at least two of the plurality of servers are estimated. The estimation is based on at least one of a number and a cost of at least one remote access for satisfying the request. The request is routed to a server of the plurality of servers with a low estimated cost of satisfying the request.

摘要翻译： 公开了改进的负载平衡技术。 例如，在本发明的一个说明性方面，在由多个服务器构成的系统中满足请求的方法包括以下步骤。 提供至少一个负载平衡器用于将请求路由到多个服务器。 在至少一个负载均衡器上，获得从客户端发送的请求。 在至少一个负载均衡器上，检查该请求。 估计满足多个服务器中的至少两个的请求的成本。 该估计基于用于满足该请求的至少一个远程访问的数量和成本中的至少一个。 以满足请求的低估计成本将该请求路由到多个服务器的服务器。

公开(公告)号：US07395279B2

公开(公告)日：2008-07-01

申请号：US10715237

申请日：2003-11-17

申请人： Arun Kwangil Iyengar ,  Richard P. King ,  Lakshmish Macheeri Ramaswamy ,  Daniela Rosu ,  Karen Witting

发明人： Arun Kwangil Iyengar ,  Richard P. King ,  Lakshmish Macheeri Ramaswamy ,  Daniela Rosu ,  Karen Witting

IPC分类号： G06F17/30 ,  G06F12/00

CPC分类号： G06F17/30215 ,  Y10S707/99932 ,  Y10S707/99952

摘要： A system and method for maintaining consistency in a system where multiple copies of an object may exist is provided for maintaining consistent copies. Consistency is maintained using a plurality of consistency policies in which at least one consistency policy results in different performance than a second consistency policy. A consistency policy is selected from the plurality consistency policies for each object to improve system performance.

摘要翻译： 提供用于维持一个对象的多个副本可能存在的系统中的一致性的系统和方法，用于维持一致的副本。 使用多个一致性策略维护一致性，其中至少一个一致性策略导致与第二一致性策略不同的性能。 从每个对象的多个一致性策略中选择一致性策略以提高系统性能。