타임 패트리넷 기반의 분할 알고리즘을 이용한 스케쥴러 설계

• 영문명: Design of the Scheduler using the Division Algorithm Based on the Time Petri net
• 발행기관: 한국시뮬레이션학회
• 저자명: 송유진(Yu-Jin Song) 이종근(Jongkun Lee)
• 간행물 정보: 『한국시뮬레이션학회 논문지』제12권 제2호, 13~24쪽, 전체 12쪽
• 주제분류: 공학 > 기타공학
• 파일형태: PDF
• 발행일자: 2003.06.30

영문 초록

In this study, we propose a scheduling analysis method of the Flexible management system using the transitive matrix. The Scheduling problem is a combination-optimization problem basically, and a complexity is increased exponentially for a size of the problem. To reduce an increase of a complexity, we define that the basic unit of concurrency (short BUC) is a set of control flows based on behavioral properties in the net. And we propose an algorithm to divide original system into some BUC. To sum up, we divide a petri net model of the Flexible management system into the basic unit of concurrency through the division algorithm using the transitive matrix. Then we apply it to the division-scheduling algorithm to find an efficient scheduling. Finally, we verify its efficiency with an example.

목차

1. 서론

2. 관련 연구

3. 타입 패트리넷과 추이적 행렬

4. 추이적 행렬을 이용한 BUC 단위의 분할 알고리즘

5. 분할 알고리즘을 이용한 스케쥴링 알고리즘

6. 사례 연구

7. 결론

키워드

BUC Petri Nets Transitive Matrix Division algorithm Flexible management System