A METHOD AND APPARATUS FOR MODULO SCHEDULING

Disclosed is a modulo scheduling method which comprises the following steps of: obtaining a data dependence graph including dependency between commands included in a loop; searching for a recurrence which is a group of commands forming a cycle in the data dependence graph; and scheduling to determin...

Full description

Saved in:
Bibliographic Details
Main Authors AHN, MIN WOOK, SHIN, JANG SEOP, PAEK, YUN HEUNG
Format Patent
LanguageEnglish
Korean
Published 15.03.2016
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary:Disclosed is a modulo scheduling method which comprises the following steps of: obtaining a data dependence graph including dependency between commands included in a loop; searching for a recurrence which is a group of commands forming a cycle in the data dependence graph; and scheduling to determine a processing order of the recurrence. Searching for a recurrence searches for only a recurrence in which a sum of iteration distances is less than a predetermined critical value. The iteration distances are the number of iterations which are performed until it is possible to process another command which depends on the result of processing a predetermined command after processing the predetermined command which is included in a recurrence. 루프(loop)가 포함하는 명령어들 간의 의존관계를 포함하는 데이터 의존성 그래프(dependence graph)를 획득하고 데이터 의존성 그래프에서, 사이클을 형성하는 명령어들의 집합인 리커런스(recurrence)를 탐색하고, 리커런스의 처리 순서를 결정하는 스케줄링하고, 리커런스를 탐색하는 것은 이터레이션 디스턴스(Iteration Distance)의 합이 소정의 임계값보다 작은 리커런스만을 탐색하고, 이터레이션 디스턴스는 리커런스에 포함된 소정의 명령어를 처리한 후 소정의 명령어의 처리 결과에 의존하는 다른 명령어를 처리할 수 있을 때까지 소요되는 이터레이션 횟수인 모듈로 스케줄링 방법이 개시된다.
Bibliography:Application Number: KR20140119362