정보처리학회논문지:컴퓨터 및 통신 시스템 (KIPS Transactions on Computer and Communication Systems)

  • 제2권6호
  • /
  • Pages.237-244
  • /
  • 2013
  • /
  • 2287-5891(pISSN)
  • /
  • 2734-049X(eISSN)
한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

한정된 전력량을 가진 멀티프로세서 시스템에서 (m,k)-firm 데드라인 태스크를 위한 실시간 스케줄링 기법

Real-time Scheduling for (m,k)-firm Deadline Tasks on Energy-constrained Multiprocessors

  • 공연화 (고려대학교 전산과학) ;
  • 조현중 (고려대학교 컴퓨터정보학과)
  • 투고 : 2013.01.25
  • 심사 : 2013.04.24
  • 발행 : 2013.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 연구에서는 전력량 제약을 가진 멀티프로세서 시스템에서 (m,k)-firm 데드라인을 갖는 실시간 태스크를 효율적으로 스케줄링 할 수 있는 방법으로 EMRTS-MK(Energy-constrained Multiprocessor Real-Time Scheduling algorithms for (m,k)-firm deadline constrained tasks) 를 제안한다. EMRTS-MK는 단지 전력 소모량을 최소로 줄이는 것이 목표가 아니라 한정된 전력량을 고려하여 시스템이 주어진 임무 시간(Mission Time) 동안 최소한의 서비스 품질을 보장하고 동시에 가능하면 최대한의 서비스 품질을 제공함을 목표로 한다. 본 연구에서는 상용멀티코어 환경에서 EMRTS-MK를 구현하여 성능을 평가하였으며, 제안된 알고리즘이 (m,k)-firm 데드라인을 갖는 멀티미디어 서비스를 효과적으로 지원해 줄 수 있다는 것을 보였다.

We propose Energy-constrained Multiprocessor Real-Time Scheduling algorithms for (m,k)-firm deadline constrained tasks (EMRTS-MK). Rather than simply saving as much energy as possible, we consider energy as hard constraint under which the system remains functional and delivers an acceptable performance at least during the prescribed mission time. We evaluate EMRTS-MKs in several experiments, which quantitatively show that they achieve the scheduling objectives.

키워드

참고문헌

  1. M. Hamdaoui, P. Ramanathan, "A dynamic priority assignment technique for streams with (m,k)-firm deadlines," IEEE T. on Computers, pp.1443-1451, 1995.
  2. P. Ramanathan, "Overload management in real-time control applications using (m,k)-firm guarantee," IEEE T. on Parallel and Distributed Systems, pp.549-559, June, 1999.
  3. G. Quan, X. Hu, "Enhanced Fixed-priority scheduling with (m,k)-firm guarantee," IEEE RTSS, pp.79-88, 2000.
  4. G. Koren, D.Shasha, "Skip-over: Algorithm and complexity for overloaded systems that allow skips," RTSS, 1995.
  5. T. A. Alenawy, H. Aydin, "Energy-constrained scheduling for weakly-hard real-time systems," IEEE RTSS, 2005.
  6. T. Wu, S. Jin, "Weakly hard real-time scheduling algorithm for multimedia embedded system on multiprocessor platform," IEEE International Conference on Ubi-Media Computing, 2008.
  7. P.Pillai, K.G Shin, "Real-Time Dynamic Voltage Scaling for Low-Power Embedded Operating Systems," ACM Symposium on Operating System Principles, 2002.
  8. S. Saewong, R. Rajkumar, "Practical Voltage-Scaling for Fixed-Priority Real-time Systems," IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'03), May, 2003.
  9. Y. Kong, H. Cho, "Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-time Tasks on Multiprocessors," PDCAT, Oct., 2011.
  10. S. K. Baruah, N. K. Cohen, C. G. Plaxton, D. A. Varvel, "Proportionate progress: A notion of fairness in resource allocation", Algorithmica, Vol.15, No.6, pp.600-625, 1996. https://doi.org/10.1007/BF01940883
  11. G. Bernat, A. Burns, A. Llamosi. "Weakly-hard real-time systems," IEEE Trans. on Computers, April, 2001.
  12. J. Calandrino, H. Leontyev, A. Block, U. Devi, and J. Anderson, "LITMUSRT: A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers", IEEE RTSS, 2006.
  13. W. Shieh, B. Chen, "Energy-Efficient Tasks scheduling Algorithm for Dual-core Real-time Systems," Computer Symposium (ICS), 2010.
  14. H. Yu, B. Veeravalli, Y. Ha, "Leakage-Aware Dynamic Scheduling for Real-Time Adaptive Applications on Multiprocessor Systems," DAC, 2010.
  15. Y. Wang, H. Lku, D. Liu, E. H.-M. SHA, "Overhead-Aware Energy Optimization for Real-Time Streaming Applications on Multiprocessor System-on-Chip," ACM Trans. on Design Automation of Electronic Systems, Vol.16, issue 2, March, 2011.