公开(公告)号：JP2010267264A

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

申请号：JP2010111035

申请日：2010-05-13

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： GEDIK BUGRA ,  ANDRADE HENRIQUE ,  WU KUN-LUNG ,  HOU RUI ,  WANG HUA YONG

IPC: G06F9/45 ,  G06F9/44

CPC classification number: G06F8/71 ,  G06F8/10 ,  G06F8/30 ,  G06F8/60 ,  G06F8/70

Abstract: PROBLEM TO BE SOLVED: To prevent an executable component code from being unnecessarily regenerated and recompiled when an executable code is constructed for a component-based application.
SOLUTION: The method for constructing the executable code for the component-based application includes: a step 306 of extracting a signature for each source code component when a request to compile a source code is received; a step 308 of retrieving a stored signature corresponding to a currently available instance of executable code for the source code component; a step 310 of comparing the derived signature with the stored signature; a step 312 of compiling the source code component into the executable code when the derived signature does not match the stored signature; and a step 314 of obtaining the executable code for the source code component from a repository when the extracted signature matches the stored signature.
COPYRIGHT: (C)2011,JPO&INPIT

Abstract translation: 要解决的问题：为了防止可执行组件代码在为基于组件的应用程序构建可执行代码时不必要地重新生成并重新编译。 解决方案：用于构建基于组件的应用程序的可执行代码的方法包括：当接收到编译源代码的请求时，提取每个源代码组件的签名的步骤306; 检索与源代码组件的可执行代码的当前可用实例相对应的存储签名的步骤308; 将导出的签名与存储的签名进行比较的步骤310; 当导出的签名与存储的签名不匹配时，将源代码组件编译成可执行代码的步骤312; 以及当所提取的签名与存储的签名相匹配时从存储库获取源代码组件的可执行代码的步骤314。 版权所有（C）2011，JPO＆INPIT

公开(公告)号：JP2005108221A

公开(公告)日：2005-04-21

申请号：JP2004276110

申请日：2004-09-22

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： CHEN SHYH-KWEI ,  MEI G-GUO MARK ,  WU KUN-LUNG ,  PHILIP S U

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30324 ,  G06F17/30516 ,  Y10S707/99933 ,  Y10S707/99934

Abstract: PROBLEM TO BE SOLVED: To provide a more efficient and new interval indexing method.
SOLUTION: This invention introduces a new concept called virtual construct intervals (VCI), where each predicate interval is decomposed into one or more of these construct intervals. These VCIs strictly cover the predicate interval. Namely, every attribute value covered by the predicate interval is also covered by at least one of the decomposed VCIs, and vice versa. Each construct interval has a unique ID or interval coordinate and a set of endpoints. A construct interval is considered activated when a predicate interval using it in its decomposition is added to the system. The predicate ID is then inserted into the ID lists associated with the decomposed VCIs. To facilitate fast search, a bitmap vector is used to indicate the activation of VCIs that cover an event value.
COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：提供更有效和更新的间隔索引方法。 解决方案：本发明引入了称为虚拟构建间隔（VCI）的新概念，其中每个谓词间隔被分解成这些构建间隔中的一个或多个。 这些VCI严格覆盖谓词间隔。 即，由谓词间隔覆盖的每个属性值也被分解的VCI中的至少一个覆盖，反之亦然。 每个构造间隔具有唯一的ID或间隔坐标和一组端点。 当在其分解中使用它的谓词间隔被添加到系统时，构造间隔被认为被激活。 然后将谓词ID插入到与分解的VCI相关联的ID列表中。 为了便于快速搜索，使用位图矢量表示覆盖事件值的VCI的激活。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：JP2007220140A

公开(公告)日：2007-08-30

申请号：JP2007114983

申请日：2007-04-25

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： JORDAN KEVIN MICHAEL ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: G06F12/00 ,  G06F9/50 ,  G06F13/00

CPC classification number: G06F9/505

Abstract: PROBLEM TO BE SOLVED: To provide a method and system for cache server balancing.
SOLUTION: In a system including a collection of cooperating cache servers such as proxy cache servers, a request can be forwarded to a cooperating cache server if the requested object cannot be found locally. An overload condition is detected if for example, due to reference skew, some objects are in high demand by all the clients and the cache servers that contain those hot objects become overloaded due to forwarded requests. In response, the load is balanced by shifting some or all of the forwarded requests from an overloaded cache server to a less loaded one. Both centralized and distributed load balancing environments are described.
COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供缓存服务器平衡的方法和系统。 解决方案：在包括合作缓存服务器（如代理缓存服务器）的集合的系统中，如果请求的对象不能在本地找到，则可以将请求转发到协作缓存服务器。 如果例如由于引用偏斜而检测到过载状况，则所有客户端都需要一些对象，并且包含这些热对象的缓存服务器由于转发请求而变得过载。 作为响应，通过将一些或全部转发的请求从重载的缓存服务器移动到较少的缓存服务器来平衡负载。 描述了集中式和分布式负载均衡环境。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：JP2001273186A

公开(公告)日：2001-10-05

申请号：JP2001015963

申请日：2001-01-24

Applicant: IBM

Inventor： WU KUN-LUNG ,  PHILIP SHIIRAN YU

IPC: G06F12/00 ,  G06F13/00 ,  G06F17/30

Abstract: PROBLEM TO BE SOLVED: To provide hashing corresponding to a waiting time to common Web caching between proxy caches distributed geographically. SOLUTION: This method performs common Web caching between the proxy caches distributed geographically and, in particular this system/method for waiting time-corresponding hashing performs common Web caching between the proxy caches distributed geographically. In hashing, the delay of network waiting time and a proxy loading state are considered. When the loading state is good as the result, a request can be hashed to the proxy caches which is geographically close. in other cases, the request is hashed to geographically remote proxy caches to balance the load between the caches.

公开(公告)号：JPH1155252A

公开(公告)日：1999-02-26

申请号：JP15112198

申请日：1998-06-01

Applicant: IBM

Inventor： CROSSKEY JAMES P ,  MEI MARK GEE-GWO ,  RAGAVAN HARISH ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: B65G61/00 ,  G06F13/00 ,  G06Q20/10 ,  G06Q30/02 ,  G06Q30/04 ,  H04L12/14 ,  H04L29/06 ,  H04L29/08 ,  H04M15/00 ,  G06F17/60 ,  H04L12/54 ,  H04L12/58

Abstract: PROBLEM TO BE SOLVED: To provide a system and method for charging to one or plural persons concerned in response to a client access to an internet. SOLUTION: At least one of one or plural persons concerned is identified as a person responsible for payment of claimed charge (a step 203). Then, charge is shared by each responsible person concerned based on a prescribed function. Then, the total sum of the charge to each responsible person concerned is calculated based on the function of share and the band width using amounts by the client (a step 204).

公开(公告)号：PL347159A1

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

申请号：PL34715999

申请日：1999-10-08

Applicant: IBM

Inventor： JORDAN KEVIN MICHAEL ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: G06F12/00 ,  G06F9/50 ,  G06F13/00 ,  G06F9/46 ,  G06F17/30

Abstract: In a system including a collection of cooperating cache servers, such as proxy cache servers, a request can be forwarded to a cooperating cache server if the requested object cannot be found locally. An overload condition is detected if for example, due to reference skew, some objects are in high demand by all the clients and the cache servers that contain those hot objects become overloaded due to forwarded requests. In response, the load is balanced by shifting some or all of the forwarded requests from an overloaded cache server to a less loaded one. Both centralized and distributed load balancing environments are described.

公开(公告)号：GB2365166A

公开(公告)日：2002-02-13

申请号：GB0029651

申请日：2000-12-06

Applicant: IBM

Inventor： WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: G06F13/00 ,  G06F12/00 ,  G06F17/30

Abstract: A system and method are provided for collaborative web caching among geographically distributed cache servers, particularly using a latency-sensitive hashing system. Thus network latency delays as well as proxy load conditions are taken into consideration during hashing. As a result, requests can be hashed into geographically closer proxy caches if the load conditions permit. Otherwise, requests will be hashed into geographically distant proxy caches to better balance the load among the caches. The method selects the proxy cache by first identifying a set of possible proxy caches by hashing the required URL into an anchor hash partition, and also including one or more nearby partitions into the anchor hash partition. Each partition is mapped to a proxy cache and the cache is then selected according to which one has the smallest latency delay.

公开(公告)号：CA2343802A1

公开(公告)日：2000-04-20

申请号：CA2343802

申请日：1999-10-08

Applicant: IBM

Inventor： YU PHILIP SHI-LUNG ,  WU KUN-LUNG ,  JORDAN KEVIN MICHAEL

IPC: G06F12/00 ,  G06F9/50 ,  G06F13/00 ,  G06F9/46 ,  G06F17/30

Abstract: In a system including a collection of cooperating cache servers, such as pro xy cache servers, a request can be forwarded to a cooperating cache server if t he requested object cannot be found locally. An overload condition is detected if for example, due to reference skew, some objects are in high demand by all t he clients and the cache servers that contain those hot objects become overload ed due to forwarded requests. In response, the load is balanced by shifting som e or all of the forwarded requests from an overloaded cache server to a less loaded one. Both centralized and distributed load balancing environments are described.

公开(公告)号：HU224787B1

公开(公告)日：2006-02-28

申请号：HU0104250

申请日：1999-10-08

Applicant: IBM

Inventor： JORDAN KEVIN MICHAEL ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: G06F9/46 ,  G06F12/00 ,  G06F9/50 ,  G06F13/00

Abstract: In a system including a collection of cooperating cache servers, such as proxy cache servers, a request can be forwarded to a cooperating cache server if the requested object cannot be found locally. An overload condition is detected if for example, due to reference skew, some objects are in high demand by all the clients and the cache servers that contain those hot objects become overloaded due to forwarded requests. In response, the load is balanced by shifting some or all of the forwarded requests from an overloaded cache server to a less loaded one. Both centralized and distributed load balancing environments are described.

公开(公告)号：DE69827435D1

公开(公告)日：2004-12-16

申请号：DE69827435

申请日：1998-05-21

Applicant: IBM

Inventor： CROSSKEY JAMES P ,  MEI MARK GEE-GWO ,  RAGAVAN HARISH ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: B65G61/00 ,  G06F13/00 ,  G06Q20/10 ,  G06Q30/02 ,  G06Q30/04 ,  H04L12/14 ,  H04L29/06 ,  H04L29/08 ,  H04M15/00 ,  G06F17/60

Abstract: A system and method for billing one or more participating parties for client access to the internet is disclosed including the steps of identifying at least one of the one or more participating parties as being responsible for the billing, allocating a share of the billing to each responsible participating party based on a predetermined function and computing a billing amount for each of the responsible participating parties based on a function of the share and a client bandwidth usage.