公开(公告)号：WO2006048364A3

公开(公告)日：2006-08-03

申请号：PCT/EP2005055055

申请日：2005-10-06

Applicant: IBM ,  IBM UK ,  BLACK-ZIEGELBEIN ELIZABETH ,  CUOMO GENNARO ,  MARTIN BRIAN ,  PACIFICI GIOVANNI ,  SPREITZER MICHAEL ,  STEINDER MALGORZATA ,  TANTAWI ASSER

Inventor： BLACK-ZIEGELBEIN ELIZABETH ,  CUOMO GENNARO ,  MARTIN BRIAN ,  PACIFICI GIOVANNI ,  SPREITZER MICHAEL ,  STEINDER MALGORZATA ,  TANTAWI ASSER

IPC: G06F9/50

CPC classification number: G06F9/5066 ,  G06F9/5061 ,  G06F9/5083

Abstract: A method, system and apparatus for on-demand application resource allocation. In accordance with the method of the invention, an anticipated workload can be compared to a measured capacity for an application cluster in one or more server computing nodes in a server farm. If the measured capacity warrants a re-configuration of the application clusters, a new placement can be computed for application server instances in individual ones of the server computing nodes. Subsequently, the new placement can be applied to the server computing nodes in the server farm. In this regard, the applying step can include starting and stopping selected ones of the application server instances in different ones of the server computing nodes to effectuate the new placement.

Abstract translation: 一种按需应用资源分配的方法，系统和装置。 根据本发明的方法，可以将预期的工作负载与服务器场中的一个或多个服务器计算节点中的应用集群的测量容量进行比较。 如果测量的容量保证应用集群的重新配置，则可以针对各个服务器计算节点中的应用服务器实例计算新的放置。 随后，可以将新的布局应用于服务器场中的服务器计算节点。 就这一点而言，应用步骤可以包括在服务器计算节点中的不同服务器计算节点中启动和停止选择的应用服务器实例以实现新的布局。

公开(公告)号：WO2004074960A2

公开(公告)日：2004-09-02

申请号：PCT/GB2004000462

申请日：2004-02-05

Applicant: IBM ,  IBM UK ,  IMS STEVEN ,  MARTIN BRIAN ,  MCELROY THOMAS ,  TOPOL BRAD

Inventor： IMS STEVEN ,  MARTIN BRIAN ,  MCELROY THOMAS ,  TOPOL BRAD

IPC: G06F17/30 ,  G06F

CPC classification number: G06F17/30902

Abstract: Methods, systems and computer program products for caching dynamic content fragments in a distributed cache and assembling requested content using these fragments. The disclosed techniques are non-invasive, and enable the benefits of distributed fragment caching to be extended to more applications, without regard to the programming model used when designing the application. An application developer specifies dependencies among content creating components (or, in alternative embodiments, it may be possible to infer this information), and if one of these components may be called upon to generate a content fragment dynamically, correlator data is programmatically created and attached to a message that references the component. A subsequent content generation request to the component then automatically carries the correlator data, and that data is programmatically restored.

Abstract translation: 用于在分布式缓存中缓存动态内容片段并使用这些片段组装所请求的内容的方法，系统和计算机程序产品。 所公开的技术是非侵入性的，并且使分布式片段缓存的优点能够扩展到更多应用，而不考虑在设计应用时使用的编程模型。 应用程序开发人员指定内容创建组件之间的依赖关系（或在替代实施例中，可以推断该信息），并且如果这些组件中的一个可被动态地生成内容片段，则相关器数据被编程地创建并附加 引用组件的消息。 然后，向组件的后续内容生成请求自动携带相关器数据，并且该数据被编程地恢复。

公开(公告)号：AT439714T

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

申请号：AT05801382

申请日：2005-10-26

Applicant: IBM

Inventor： GISSEL THOMAS ,  MARTIN BRIAN ,  MCGEE JASON ,  NEWPORT WILLIAM

IPC: H04L12/26 ,  H04L29/06

Abstract: In a method and system for monitoring events occurring at respective servers of a configuration of nodes, a first server located at a first node receives information from a messaging system pertaining to events at servers located at other nodes. The messaging system usefully comprises a highly available (HA) bulletin board or the like. When the first server receives a start event notification pertaining to a second server located at a second node, a direct communication path is established between the first and second servers. The first server identifies events in the second server that affect or are of interest to services of the first server. The first server then registers with the second server, to receive notification through the direct communication path when respective identified events occur.