发明申请
- 专利标题: Joining units of work based on complexity metrics
- 专利标题(中): 根据复杂性指标加入工作单位
-
申请号: US11171714申请日: 2005-06-30
-
公开(公告)号: US20070006070A1公开(公告)日: 2007-01-04
- 发明人: Randall Baartman , Steven Branda , Surya Duggirala , John Stecher , Robert Wisniewski
- 申请人: Randall Baartman , Steven Branda , Surya Duggirala , John Stecher , Robert Wisniewski
- 申请人地址: US NY ARMONK
- 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址: US NY ARMONK
- 主分类号: G06F17/00
- IPC分类号: G06F17/00
摘要:
A method, apparatus, system, and signal-bearing medium that, in an embodiment, determine units of work in a page, join selected pairs of the units of work with lowest complexity metrics until all of the units of work have complexity metrics that are less than a threshold. The joining is subject to rules of a dependency graph, which indicates data dependency relationships of the units of work. The selected joined pairs are then encapsulated into a processing unit, which is sent to multiple grid servers. Responses from the grid servers are used to assemble dynamic content into the page. In an embodiment, the complexity metrics are then modified based on an exponential moving average of responses times of the units of work. In this way, in an embodiment, the performance of assembling the page may be increased.
信息查询