RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      노드의 긴박도 분속에 의한 하드웨어 소프트웨어 분할 = Hardware-Software partitioning with analysis of node's Urgency

      한글로보기

      https://www.riss.kr/link?id=A2020384

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      Mixed hardware and software implementation is common in the design of digital systems such as communication systems, DSP applications, and embedded control systems. In general, software is easy to modify, maintain, and upgrade, though it is slow compared to hardware. On the other hand, hardware can be made faster than software but the cost for all hardware solution is usually too high. A design issue raised in designing such systems is to find the point in between all hardware solution and all software solution to improve the performance as much as possible at a minimum hardware cost. The hardware software codesign methodology enables us to design mixed hardware and software systems with optimum performance and cost.
      There are several different style of codesign, depending on what assumptions are made about the specification and the components and what elements of the system are synthesized. We introduced hardware software partitioning, which map a behavioral specification onto a hardware architecture consisting of a CPU and multiple ASICs.
      In this paper, we propose a partitioning algorithm for hardware software codesign. The new algorithm exploits the urgency that resides in the system to improve the performance maximally at a minimum hardware cost with low complexity of partitioning algorithm. The key of the new algorithm is the concept of node's probability that can run in parallel with each other candidate node in both hardware software distribution graph but, it may hardly be delayed. We calculate the cost function and select the node with max value and because, we can get low cost system and satisfy the constraints with low algorithm complexity.
      At present, this algorithm is incomplete. To obtain better results, it is necessary to introduce a communication model between hardware and software part, variety of Basic Scheduling Block's size, and so on.
      번역하기

      Mixed hardware and software implementation is common in the design of digital systems such as communication systems, DSP applications, and embedded control systems. In general, software is easy to modify, maintain, and upgrade, though it is slow compa...

      Mixed hardware and software implementation is common in the design of digital systems such as communication systems, DSP applications, and embedded control systems. In general, software is easy to modify, maintain, and upgrade, though it is slow compared to hardware. On the other hand, hardware can be made faster than software but the cost for all hardware solution is usually too high. A design issue raised in designing such systems is to find the point in between all hardware solution and all software solution to improve the performance as much as possible at a minimum hardware cost. The hardware software codesign methodology enables us to design mixed hardware and software systems with optimum performance and cost.
      There are several different style of codesign, depending on what assumptions are made about the specification and the components and what elements of the system are synthesized. We introduced hardware software partitioning, which map a behavioral specification onto a hardware architecture consisting of a CPU and multiple ASICs.
      In this paper, we propose a partitioning algorithm for hardware software codesign. The new algorithm exploits the urgency that resides in the system to improve the performance maximally at a minimum hardware cost with low complexity of partitioning algorithm. The key of the new algorithm is the concept of node's probability that can run in parallel with each other candidate node in both hardware software distribution graph but, it may hardly be delayed. We calculate the cost function and select the node with max value and because, we can get low cost system and satisfy the constraints with low algorithm complexity.
      At present, this algorithm is incomplete. To obtain better results, it is necessary to introduce a communication model between hardware and software part, variety of Basic Scheduling Block's size, and so on.

      더보기

      목차 (Table of Contents)

      • Ⅰ. 서론
      • Ⅱ. 통합설계
      • Ⅲ. 하드웨어/소프트웨어 분할
      • Ⅳ. 관련연구
      • Ⅴ. 파티션닝 알고리즘
      • Ⅰ. 서론
      • Ⅱ. 통합설계
      • Ⅲ. 하드웨어/소프트웨어 분할
      • Ⅳ. 관련연구
      • Ⅴ. 파티션닝 알고리즘
      • Ⅵ. 결과 및 결론
      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼