지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2010.11
- 수록면
- 380 - 383 (4page)
이용수
초록· 키워드
오류제보하기
System on Chip (SoC) consists of multiple cores communicating with each other using a communication back plane. The SoC programming model is based on a task graph where a node represents an operation to be scheduled on a core while the edges represent the communication between these operations. Each node and edge is weighted by duration of computation or communication. In a task graph there could be more nodes that can run in parallel than cores. This leads to a scheduling problem. Typically such scheduling is done statically during program development based on estimated execution times. In this paper we propose hardware based dynamic task scheduling driven by real execution times. A key challenge in implementing hardware based task scheduling is runtime discovery of the task graph. It has been observed that most applications have phases because of the presence of loops where only a task graph is executed repeatedly. In this work, we propose to dynamically extract the task graph information in a bus based SoC by adding extra logic to the arbiter which monitors the bus communication and extracts the task graph for the current application phase. The extracted task graph can then be used by the arbiter to adaptively change the priority for bus grant so as to maximize performance. It is seen from our experiments that in most cases it takes less than 100 task graph iterations for our algorithm to extract the application task graph. This is small as compared to millions of task graph iterations in a typical application.
목차
Abstract
Ⅰ. INTRODUCTION
Ⅱ. PRELIMINARIES
Ⅲ. PROPOSED SOLUTION
Ⅳ. ARBITER ARCHITECTURE
Ⅴ. RESULTS
Ⅵ. CONCLUSION
Ⅶ. REFERENCES
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
그래프 중심성들을 이용한 그래프 유사도 측정
한국컴퓨터정보학회논문지
2018 .12
-
병렬 Reduction이 가능한 함수언어의 Graph변환에 관한 연구
(구)정보과학회논문지
1987 .11
-
Task Scheduling with Graph Partitioning for Multi Processors
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2003 .07
-
서비스 로봇을 위한 그래프 구조 맵에서의 작업 계획
대한기계학회 춘추학술대회
2019 .11
-
중심성이 높은 정점의 변화에 따른 네트워크 특성 분석
한국컴퓨터정보학회논문지
2017 .03
-
The Classification of random graph models using graph centralities
한국컴퓨터정보학회논문지
2019 .07
-
그래프의 정점 연결성에 대한 최소 범위 할당
한국정보통신학회논문지
2017 .11
-
Anonymizing Graphs Against Weight-based Attacks with Community Preservation
Journal of Computing Science and Engineering
2011 .09
-
양방향 최고 비용경로 클러스터링에 의한 작업 스케쥴 방법
정보과학회논문지(A)
1996 .01
-
Test Case Generation of Concurrent Programs Based On Event Graph
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2008 .07
-
Static Task Scheduling Algorithm with Minimum Distance for Multiprocessor System (STMD)
SmartCR
2015 .04
-
Unified Graph Clustering via Learning Robust and Structured Graph
대한전자공학회 학술대회
2019 .06
-
그래프 정보를 이용한 그래프 구조 간략화 알고리즘
제어로봇시스템학회 국내학술대회 논문집
2016 .03
-
Extended Star Graphs are Hamiltonian Graphs
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2004 .07
-
신호 흐름 그래프에 의한 샘풀된 데이터계통의 해석
전기의세계
1970 .09
-
Review of Task Duplication Based (TDB) Scheduling Algorithms
SmartCR
2015 .02
-
Towards the Easy Manipulation of Graph-Based Content Representation of Multimedia Data
ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications
2008 .07
-
관계형 데이타베이스에 기반한 그래프 알고리즘의 표현과 구현
정보과학회논문지 : 데이타베이스
2002 .10
-
워크스테이션 네트웍에서의 휴리스틱 태스크 스케줄링 알고리즘
정보과학회논문지 : 컴퓨팅의 실제 및 레터
2000 .12
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-569-001489755