메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

An Efficient Loop Handling Algorithm for Critical Path Analysis

오류 신고하기

피인용 0

An Efficient Loop Handling Algorithm for Critical Path Analysis
검색

    초록·키워드

    Two popular approaches for critical path analysis are Modified Breadth-First Search (MBFS) and Modified Depth-First Search (MDFS). The MDFS method has exponential complexity in the worst case, even though it can handle loops in the circuit dynamically. The MBFS method has linear complexity; however, it cannot examine all forward paths if the logic circuit contains loops. In this paper, we present a new algorithm for critical path analysis. The algorithm can examine all forward paths by preprocessing loops in the logic circuits, while maintaining linear complexity. In addition, it can examine the logic paths which may be excluded by the MDFS method.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-ECN-0101-2009-569-013208536