Table of Contents Author Guidelines Submit a Manuscript
Modelling and Simulation in Engineering
Volume 2014, Article ID 705929, 11 pages
http://dx.doi.org/10.1155/2014/705929
Research Article

Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT

1Department of Electronics Engineering, Madras Institute of Technology, Anna University, Chennai 600 044, India
2Department of Instrumentation Engineering, Madras Institute of Technology, Anna University, Chennai 600 044, India

Received 28 June 2013; Revised 4 October 2013; Accepted 18 October 2013; Published 13 February 2014

Academic Editor: Zeki Ayag

Copyright © 2014 S. Ewins Pon Pushpa and Manamalli Devasigamani. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. N. Guan, W. Yi, Q. Deng, Z. Gu, and G. Yu, “Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling,” Journal of Systems Architecture, vol. 57, no. 5, pp. 536–546, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Lehoczky, L. Sha, and Y. Ding, “Rate monotonic scheduling algorithm: exact characterization and average case behavior,” in Proceedings of the Real-Time Systems Symposium, pp. 166–171, December 1989. View at Scopus
  3. S. K. Baruah and S. Chakraborty, “Schedulability analysis of non-preemptive recurring real-time tasks,” in Proceedings of the 14th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS '06), pp. 108–116, 2006.
  4. C. L. Liu and J. Layland, “Scheduling algorithms for multi-programming in a hard real-time environment,” Journal of the ACM, vol. 20, no. 1, pp. 47–61, 1973. View at Google Scholar
  5. “Modeling language guide-rational rose real time,” User guide.
  6. K. Jeffay, D. F. Stanat, and C. U. Martel, “On non-preemptive scheduling of periodic and sporadic tasks,” in Proceedings of the 12th Real-Time Systems Symposium (RTSS '91), pp. 129–139, December 1991. View at Scopus
  7. Q. Zhu, R. Oishi, T. Hasegawa, and T. Nakata, “Integrating UML into SoC design process,” in Proceedings of the Design, Automation and Test in Europe (DATE '05), vol. 2, pp. 836–837, March 2005. View at Publisher · View at Google Scholar · View at Scopus
  8. L. George, N. Rivierre, and M. Spuri, “Preemptive and non-preemptive real-time uniprocessor scheduling,” Tech. Rep., INRIA, 1996. View at Google Scholar
  9. S. Lauzac, R. Melhem, and D. Mossé, “An improved rate-monotonic admission control and its applications,” IEEE Transactions on Computers, vol. 52, no. 3, pp. 337–350, 2003. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Burchard, J. Liebeherr, Y. Oh, and S. H. Son, “New strategies for assigning real-time tasks to multiprocessor systems,” IEEE Transactions on Computers, vol. 44, no. 12, pp. 1429–1442, 1995. View at Google Scholar
  11. W.-C. Lu, H.-W. Wei, and K.-J. Lin, “Rate monotonic schedulability conditions using relative period ratios,” in Proceedings of the12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA '06), pp. 3–9, August 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. J. Y.-T. Leung and J. Whitehead, “On the complexity of fixed-priority scheduling of periodic, real-time tasks,” Performance Evaluation, vol. 2, no. 4, pp. 237–250, 1982. View at Google Scholar · View at Scopus
  13. N. C. Audsley, “On priority assignment in fixed priority scheduling,” Information Processing Letters, vol. 79, no. 1, pp. 39–44, 2001. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Bertogna, M. Cirinei, and G. Lipari, “Schedulability analysis of global scheduling algorithms on multiprocessor platforms,” IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 4, pp. 553–566, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. B. Kumar and J. Jasperneite, “UML profiles for modeling real-time communication protocols,” Journal of Object Technology, vol. 9, no. 2, pp. 178–198, 2010. View at Google Scholar · View at Scopus
  16. L. Kishor, D. Goyal, R. Singh, and P. Sharma, “Optimized scheduling algorithm,” in Proceedings of the IJCA International Conference on Computer Communication and Networks (CSI-COMNET '11), pp. 130–134, 2011.