公开(公告)号：JP2005339198A

公开(公告)日：2005-12-08

申请号：JP2004157103

申请日：2004-05-27

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

Inventor： HAMA TOSHIYUKI ,  HIRAIDE RYO

IPC: G06F12/08 ,  G06F3/06 ,  G06F12/00 ,  G06F12/12

CPC classification number: G06F11/3452 ,  G06F12/12 ,  G06F2201/88 ,  G06F2201/885

Abstract: PROBLEM TO BE SOLVED: To obtain analytically and with high accuracy the caching hit ratio of a caching system. SOLUTION: This system is a caching hit ratio estimation system estimating the caching hit ratio of a caching system which performs the caching of the data for access accessed from a demand origin system. This system is provided with an access request arrival frequency acquiring part which acquires an average arrival frequency measured about an access request to each data for access, an access request arrival probability density function generating part which generates an access request arrival probability density function that is a probability density function of an arrival time interval of access requests to the data for access based on the average arrival frequency of the access request to each data for access, and a caching hit ratio estimation function generating part which generates the estimation function of the caching hit ratio of each data for access based on access demand arrival probability density functions of a plurality of data for access. COPYRIGHT: (C)2006,JPO&NCIPI

Abstract translation: 要解决的问题：缓存系统的缓存命中率分析和高精度获取。 解决方案：该系统是缓存命中率估计系统，估计缓存系统的缓存命中率，该缓存系统执行从需求源系统访问的访问数据的缓存。 该系统设置有访问请求到达频率获取部分，其获取关于访问的每个数据的访问请求所测量的平均到达频率;访问请求到达概率密度函数生成部，其生成访问请求到达概率密度函数，其为 基于访问请求的访问请求的平均到达频率到接入的每个数据的访问请求的到达时间间隔的概率密度函数，以及生成缓存命中的估计函数的缓存命中率估计函数生成部 基于用于访问的多个数据的访问需求到达概率密度函数的用于访问的每个数据的比率。 版权所有（C）2006，JPO＆NCIPI

公开(公告)号：JP2005149184A

公开(公告)日：2005-06-09

申请号：JP2003386440

申请日：2003-11-17

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

Inventor： HAMA TOSHIYUKI

IPC: G06F12/08 ,  G06F12/00 ,  G06F15/16 ,  G06F17/30

CPC classification number: G06F17/30902

Abstract: PROBLEM TO BE SOLVED: To provide a method and an apparatus for estimating a hit rate which accurately estimates a rate of hitting at a session data cache 12 associated with a Web application on a Web server 10 in a running state while avoiding the increase of overhead.
SOLUTION: The method comprises steps for; calculating a quitting probability pl, an average μ and a distribution σ
2 of a deliberate time and a hit rate r for a session data cache 12 which is associated with the Web application based on a counter of the Web server 10; and defining pl
α , μ
α , σ
2
α and an average of α for the readout number of each group of the session data. A calculation formula setting apparatus 21 sets a formula of f(α)=α for calculating a fixed point including pl, μ, σ
2 , r, pl
α , μ
α , and σ
2
α . A means 22 for retrieving a true value which retrieves a value close to the true value of α based on a formula f(α)=α. An estimating means 23 estimates r
α based on the α which has been retrieved.
COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：提供一种用于估计命中率的方法和装置，其在运行状态下准确地估计与在Web服务器10上的Web应用程序相关联的会话数据高速缓存12处的速度，同时避免 开销增加 解决方案：该方法包括以下步骤： 计算与网络计数器相关联的会话数据高速缓存12的故意时间和命中率r的退出概率pl，平均μ和分布σ 2 服务器10; 并且对于每个的读出数定义平均值α，μα，σ 2 α 组会话数据。 计算公式设定装置21设定用于计算包含pl，μ，σ 2 ，r，P1 α的固定点的f（α）=α的公式， SB>α和σ 2 α。 一种用于根据公式f（α）=α来检索检索接近真值α的值的真值的装置22。 估计装置23基于已经检索到的α来估计r α。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：JP2004348491A

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

申请号：JP2003145589

申请日：2003-05-23

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

Inventor： HAMA TOSHIYUKI ,  TEZUKA TSUDOI ,  KABUTO YOSUKE

IPC: G06F11/34 ,  G06F15/00

Abstract: PROBLEM TO BE SOLVED: To adjust server's loads caused by requests and to steadily set the controlled loads without stopping service provision by the server.
SOLUTION: Requests transmitted to the sever 2 are temporarily stored in a queue 4, the requests existing in the queue or requests generated by a false client 5 when no request exists in the queue are successively transferred to the server 2 at prescribed timing to control server's loads caused by the requests. In this case, timing at which requests to be transferred to the server 2 arrive at the server 2 at fixed arrival time interval distribution is adopted as the prescribed timing. Such a timing is determined on the basis of random numbers generated from a random number generator 6 at prescribed probability distribution.
COPYRIGHT: (C)2005,JPO&NCIPI

公开(公告)号：JPH10214898A

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

申请号：JP1249897

申请日：1997-01-27

Applicant: IBM

Inventor： HAMA TOSHIYUKI ,  ETO HIROAKI

IPC: H01L21/82 ,  G06F17/50

Abstract: PROBLEM TO BE SOLVED: To enlarge wiring interval and width while adopting a free angle wiring by selecting a wire to be shaped, generating an arc-shaped prohibition region from an obstacle containing a terminal and a wiring prohibition region other than the terminal, and obtaining the shortest path for avoiding the passage of the generated prohibition region. SOLUTION: One wire to be shaped from a phase wiring to a physical wiring is selected (Step 12). Then, an obstacle for viewing it is specified (Step 14). Then, an area within an arc with an interval that becomes a given number of times larger than a gap that at least need to be provided between a wiring to be shaped and a selected obstacle is set to a selected obstacle as a prohibition region (Step 18). Then, the physical wiring of the wiring to be shaped is determined using the shortest path so that the prohibition region cannot be passed (Step 22).

公开(公告)号：CA2743170C

公开(公告)日：2019-05-07

申请号：CA2743170

申请日：2010-05-06

Applicant: IBM

Inventor： YOSHIZUMI TAKAYUKI ,  HAMA TOSHIYUKI

IPC: B21B37/00 ,  B21B1/00 ,  B22D11/12

Abstract: To solve combined scheduling of two different slab sequences by a rational technique. [Solution] A two-dimensional grid graph having a direct slab sequence as a first dimension and an inventory slab sequence as a second dimension is prepared by processing of a computer as a data structure represented on a memory or a hard disk drive of the computer. A processing program of the computer generates two child nodes corresponding to a direct slab and an inventory slab, in each node of the two-dimensional graph according to a predetermined algorithm. By defining an appropriate weighting function, the processing program of the computer weights edges between nodes in the two-dimensional grid graph. After forming the weighted graph on a storage device of the computer such as the memory or the hard disk drive, the processing program of the computer calculates a path from a start point to an end point as a shortest path search problem such as known Dijkstra's algorithm.

公开(公告)号：CA2743170A1

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

申请号：CA2743170

申请日：2010-05-06

Applicant: IBM

Inventor： YOSHIZUMI TAKAYUKI ,  HAMA TOSHIYUKI

IPC: B21B37/00 ,  B21B1/00 ,  B22D11/12

Abstract: Merged scheduling of two different slab lines is solved by a rational technique. By computer processing, a grid-shaped two-dimensional graph with a direct slab line as a first dimension and a stock slab line as a second dimension is prepared as a data structure represented in a memory or hard disk drive of a computer. A computer processing program generates two child nodes for the direct slab and the stock slab in each node of the two-dimensional graph in accordance with a predetermined algorithm. By defining an appropriate weighting factor, edges between nodes of the grid-shaped two-dimensional graph are weighted. When a weighted graph is formed in a storage device of the computer such as the memory or hard disk drive of the computer, the computer processing program finds a path from a starting point to an ending point as a shortest path search problem such as an already known Dijkstra's method.