• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1083-1086
• /
• 2005

Modern superscalar processors exploit Instruction Level Parallelism to achieve high performance by speculative techniques such as branch prediction. The indirect branch target prediction is very difficult compared to the prediction of direct branch target and branch direction, since it has dynamically polymorphic target. We present a accurate and hardware-efficient indirect branch target predictor. It can reduce the tags which has to be stored in the Indirect Branch Target Cache without a sacrifice of the prediction accuracy. We implement the proposed scheme on SimpleScalar and show the efficiency running SPEC95 benchmarks.

• Proceedings of the KSAR Conference
• /
• 2002.06a
• /
• pp.196-196
• /
• 2002

• Proceedings of the Korean Society of Crop Science Conference
• /
• 1994.06a
• /
• pp.46-47
• /
• 1994

• The Korean Nurse
• /
• v.19 no.5 s.108
• /
• pp.39-49
• /
• 1980

The survey was performed with supervisor nurse at 30 general hospitals which had a system in concerning about supervisor nurse in seoul from Nov. 15 to Dec. 2, 1979. The findings as follows; 1. Age distribution of the subjects were from 25 to 65, most of

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.3
• /
• pp.621-626
• /
• 2009

This paper presents a multiple branch predictor using perceptrons. The key idea is to apply neural networks to the multiple branch predictor. We describe our design and evaluate it with the SPEC 2000 integer benchmarks. Our predictor achieves increased accuracy than the Bi-Mode and the YAGS multiple branch predictor with the same hardware cost.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 1992.05a
• /
• pp.66-67
• /
• 1992

• Proceedings of the Korean Society of Crop Science Conference
• /
• 1991.10a
• /
• pp.40-41
• /
• 1991

• Proceedings of the Korean Society of Crop Science Conference
• /
• 1992.05a
• /
• pp.64-65
• /
• 1992

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.1-8
• /
• 2002

A Branch-and-Cut algorithm is a branch-and-bound algorithm in which rutting planes are generated throughout the branch-and-bound tree. It is now one of the most widespread and successful methods for solving mixed integer programming problems. In this paper we presents efficient implementation techniques of branch-and-cut algorithm for miked integer programming problems.

• Transactions of Materials Processing
• /
• v.10 no.1
• /
• pp.23-29
• /
• 2001

In this study, the optimized initial hole shape for T-branch forming was proposed to obtain effective welding region. Design variables were determined by approximation analysis using volume constant condition. We performed 3D elastic-plastic FEM(Finite Element Method) analysis to simulate T-branch forming process. The variation of height and thickness of T-branch with various hole shapes was investigated. The optimized initial hole shape equation was obtained by using results for the numerical analysis.