• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1094-1101
• /
• 2013

This paper proposes an improved branch predictor that reduces the number execution cycles of applications by selectively accessing a specific element in 4-way associative cache. When a branch instruction is fetched, the proposed branch predictor acquires a branch target address from the selected element in the cache by referring to MRU buffer. Branch prediction rate and application execution speed are considerably improved by increasing the number of BTAC entries in restricted power condition, when compared with that of previous branch predictor which accesses all elements. The effectiveness of the proposed dynamic branch predictor is verified by executing benchmark applications on the core simulator. Experimental results show that number of execution cycles decreases by an average of 10.1%, while power consumption increases an average of 7.4%, when compared to that of a core without a dynamic branch predictor. Execution cycles are reduced by 4.1% in comparison with a core which employs previous dynamic branch predictor.

• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.1-8
• /
• 2002

In this paper, we propose a novel branch method which improve learning effects of the digital contents using a user-friendly access method by taking any conceptual object as the unit of interface. The conceptual objects may exist as a part of one or more contents pages, and we can access them to repeat, replay or return to the original branch point, that elevates the interactions of the digital contents. This method is useful for all kinds of digital contents, but it is especially effective to make educational contents in the field of science, engineering, and language courses because they contain various conceptual elements such as blocks of modeling, mathematical equations, and memorizing units. In addition, if we realize the blanch method proposed in this paper with the conventional page-branch or title-branch methods in the same contents, user interaction will be maximized and learning effects of the contents maybe beautifully improved.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1158-1165
• /
• 1999

조건부 분기 명령어(conditional branch instruction)의 잘못된 분기 예측(branch misprediction)은 프로세서의 성능 향상에 심각한 장애 요인이 되고 있다. 특히 시분할(time-sharing) 시스템과 같이 문맥 교환(context switch)이 발생하는 멀티프로그래밍 환경(multiprogramming environment)에서는 더욱 낮은 분기 예측 정확성(branch prediction accuracy)을 보인다. 본 논문에서는 문맥 교환이 발생하는 멀티프로그래밍 환경에서 높은 분기 예측 정확성을 보이는 중첩 분기 예측표 교환(Overlapped Predictor Table Switch, OPTS) 기법을 소개한다. 분기 예측표(predictor table)를 분할하여 각각의 프로세스(process)에 할당하는 OPTS 기법은 문맥 교환의 영향을 최소화함으로써 높은 분기 예측 정확성을 유지하는 분기 예측 방법이다.Abstract There is wide agreement that one of the most important impediments to the performance of current and future pipelined superscalar processors is the presence of conditional branches in the instruction stream. Accurate branch prediction is required to overcome this performance limitation. Many branch predictors have been proposed to help to alleviate this problem, including the two-level adaptive branch predictor, and more recently, hybrid branch predictor. In a less idealized environment, such as a time-sharing system, code of interest involves context switches. Context switches, even at fairly large intervals, can seriously degrade the performance of many of the most accurate branch prediction schemes. In this study, we measure the effect of context switch on the branch prediction accuracy in various situation and show the feasibility of our new mechanism, OPTS(Overlapped Predictor Table Switch), which save and restore branch history table at every context switch.

• The KIPS Transactions:PartA
• /
• v.16A no.5
• /
• pp.347-356
• /
• 2009

Precise branch prediction is a critical factor in the IPC Improvement of modern microprocessor architectures. In addition to the branch prediction accuracy, branch prediction delay have a profound impact on overall system performance as well. However, it tends to be overlooked when the architects design the branch predictor. To tolerate branch prediction delay, this paper proposes Early Start Prediction (ESP) technique. The proposed solution dynamically identifies the start instruction of basic block, called as Basic Block Start Address (BB_SA), and the solution uses BB_SA when predicting the branch direction, instead of branch instruction address itself. The performance of the proposed scheme can be further improved by combining short interval hiding technique between BB_SA and branch instruction. The simulation result shows that the proposed solution hides prediction latency, with providing same level of prediction accuracy compared to the conventional predictors. Furthermore, the combination with short interval hiding technique provides a substantial IPC improvement of up to 10.1%, and the IPC is actually same with ideal branch predictor, regardless of branch predictor configurations, such as clock frequency, delay model, and PHT size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.10-17
• /
• 2013

This thesis proposes an automatic embedded core generator system that supports branch prediction. The proposed system includes a dynamic branch prediction module that enhances execution speed of target applications by inserting history/direction flags into BTAC(Branch Target Address Cache). Entries of BHT(Branch History Table) and BTAC are determined based on branch informations extracted by simulation. To verify the effectiveness of the proposed branch prediction module, ARM9TDMI core including a dynamic branch predictor was described in SMDL and generated. Experimental results show that as the number of entry rises, area increase up to 60% while application execution cycle and BTAC miss rate drop by an average of 1.7% and 9.6%, respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.1_2
• /
• pp.103-109
• /
• 2001

이 논문에서는 중첩된 조건부 분기를 가진 데이터-흐름 그래프에 대한 효과적인 스케쥴링 알고리즘을 제안한다. 이러한 그래프의 스케쥴링은 조건부 자원 공유 문제를 추가적으로 고려해야 하기 때문에 상당히 복잡하게 된다. 이 논문은 이를 적절히 해결하기 위한 방법을 제시하고 있는데 그 핵심은 조건부 분기가 있는 데이터-흐름 그래프를 조건부 분기가 없는 동일한 기능의 그래프로 변형시키는데 있다. 이렇게 함으로서, 변형된 그래프에 설계자의 관심에 맞는 기존의 스케쥴링 알고리즘을 선택 적용하여 스케쥴을 얻을 수 있고, 이것에서부터 원래 그래프의 스케쥴을 생성 할 수 있다. 실험 결과로부터 우리는 이러한 접근 방식이 매우 효과적임을 입증한다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1993.10b
• /
• pp.11-30
• /
• 1993

종래부터 CATV 또는 MATV시스템의 신호분기회로로 사용되어 오고 있는 Tap-off는 단지 실험적 경험적으로 제작되어 왔으며 이론적인 해석이나 엄밀한 설계법이 확립되어있지 않았기 때문에 그 성능에 있어서도 대역폭이 좁거나 분기 특성이 나쁜문제점등이 있었다 따라서 본 논문에서는 보조변성기가 부가된 변형된 약결합성 신호분기기를 제안하여 설계의 자유도를 높힘으로써 상당히 조밀한 결합간격의 회로구성이 가능한 설계법을 제안하고 그 주파수특성을 계산하여 제안한 변형된 신호분기기의 설계법의 유효함을 확인하였다.

• Digital Contents
• /
• no.8 s.123
• /
• pp.82-85
• /
• 2003

2003년도 국내 DB관련 업체를 대상으로 종합경기, 내수판매, 수출, 투자, 자금사정, 채산성, 고용 등 7영역에 대해 DB산업 경기실사지수(DB_BSI)를 조사한 결과, 1/4분기에 비해 2/4분기 경기실적은 다소 회복된 것으로 조사됐다. 이와 같은 호전세는 3분기에도 지속될 전망이나 세계경제의 부진, 중증급성호흡기증후군(SARS)으로 인한 중국시장 부진, 북핵문제를 둘러싼 지정학적 위협, 가계 부채 증가 등에 따른 시장부진 등의 악재로 인해 보합세(100)에는 미치지 못할 것으로 전망된다.

• Digital Contents
• /
• no.10 s.77
• /
• pp.49-51
• /
• 1999

2.4분기에는 개인 컴퓨터를 비롯해 PC통신, 인터넷, 휴대폰 동의 급격한 보급 증가와 더불어 정보서비스 이용량이 급격하게 늘고 있는 것으로 나타났다. 최근 정보통신부의 조사에 따르면 보급수준(이용자수)과 이용수준(매출액)을 종합한 정보이용 동향을 분석한 결과 1999년 2/4분기 정보 이용지수 성장률은 1/4분기 15.19% 의 성장률에 비해 1.19% 증가한 16.38%로 높은 성장률을 지속한 것으로 나타났다.

• Journal of Korean Society of Forest Science
• /
• v.84 no.2
• /
• pp.121-130
• /
• 1995

Forecasting accuracy is examined in the context of Michigan travel demand. Eight different annual models are used to forecast up to two years ahead, and nine different quarterly models up to four quarters. In the evaluation of annual models' performance, multiple regression performed better than the other methods in both the one year and two year forecasts. For quarterly models, Winters exponential smoothing and the Box-Jenkins method performed better than naive 1 s in the first quarter ahead, but these methods in the second, third, and fourth quarters ahead performed worse than naive 1 s. The sophisticated models did not outperform simpler models in producing quarterly forecasts. The best model, multiple regression, performed slightly better when fitted to quarterly rather than annual data: however, it is not possible to strongly recommend quarterly over annual models since the improvement in performance was slight in the case of multiple regression and inconsistent across the other models. As one would expect, accuracy declines as the forecasting time horizon is lengthened in the case of annual models, but the accuracy of quarterly models did not confirm this result.