skip to main content
research-article
Public Access

Toward a Practical Regularity-based Model: The Impact of Evenly Distributed Temporal Resource Partitions

Published:14 August 2017Publication History
Skip Abstract Section

Abstract

Most Hierarchical Real-time Scheduling (HiRTS) techniques have focused on temporal resource partitions in which time units are periodically distributed. Although such periodic partitions could provide great flexibility for the resource-level scheduling, engineers face significant obstacles when trying to determine the schedulability of real-time tasks running on them. The main reason is that periodic partitions fail to effectively bound the difference between the ideal and the actual resource allocation. To solve this problem, some researchers introduced the Regular Partition, a type of temporal resource partition that is almost evenly distributed. Recent research has shown that it achieves maximal transparency for task scheduling—some classical real-time scheduling problems on a regular partition can be easily transformed into equivalent problems on a dedicated single resource. However, the resource partitioning problem for regular partitions is much more complicated than the one for periodic partitions. Based on a practical two-layer HiRTS platform, this article introduces MulZ (Multiple Z-seqences), which is the first to solve this problem with a partitioned scheduling strategy. By using a more complicated approximation methodology, our experimental results show that MulZ outperforms the current best global scheduling algorithm on this problem. After that, it compares the overall performance of the periodic partition and the regular partition. We conclude that the regular partition is a better choice for the integration of real-time applications.

References

  1. T. Aswathanarayana, D. Niehaus, V. Subramonian, and C. Gill. 2005. Design and performance of configurable endsystem scheduling mechanisms. RTAS 2005.Google ScholarGoogle Scholar
  2. S. Baruah, N. Cohen, G. Plaxton, and D. Varvel. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15 (1996), 600. DOI:10.1007/BF01940883 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Baruah, J. Gehrke, and G. Plaxton. 1995. Fast scheduling of periodic tasks on multiple resources. IPPS 1995.Google ScholarGoogle Scholar
  4. M. Behnam, I. Shin, T. Nolte, and M. Nolin. 2007. SIRAP: A synchronization protocol for hierarchical resource sharing in real-time open systems. EMSOFT 2007.Google ScholarGoogle Scholar
  5. F. Bruns, S. Traboulsi, D. Szczesny, E. Gonzalez, Y. Xu, and A. Bilgic. 2010. An evaluation of microkernel-based virtualization for embedded real-time systems. ECRTS 2010.Google ScholarGoogle Scholar
  6. A. Bastoni, B. B. Brandenburg, and J. H. Anderson. 2010. An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers. RTSS 2010.Google ScholarGoogle Scholar
  7. A. Bastoni, B. Brandenburg, and J. Anderson. 2011. Is semi-partitioned scheduling practical? ECRTS 2011.Google ScholarGoogle Scholar
  8. T. Cucinotta, F. Checconi, G. Kousiouris, D. Kyriazis, T. Varvarigou, A. Mazzetti, Z. Zlatev, J. Papay, M. Boniface, S. Berger, et al. 2010. Virtualised e-learning with real-time guarantees on the irmos platform. SOCA 2010.Google ScholarGoogle ScholarCross RefCross Ref
  9. T. Cucinotta, G. Anastasi, and L. Abeni. 2009. Respecting temporal constraints in virtualised services. COMPSAC 2009.Google ScholarGoogle Scholar
  10. Z. Deng and J. Liu. 1997. Scheduling real-time applications in an open environment. RTSS 1997.Google ScholarGoogle Scholar
  11. A. Easwaran, M. Anand, and I. Lee. 2007. Compositional analysis framework using EDP resource models. RTSS 2007.Google ScholarGoogle Scholar
  12. X. Feng. 2004. Design of real-time virtual resource architecture for largescale embedded systems. Ph.D. dissertation, Department of Computer Science, The University of Texas at Austin, 2004.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Groesbrink, L. Almeida, M. de Sousa, and S. M. Petters. 2014. Towards certifiable adaptive reservations for hypervisor-based virtualization. RTAS 2014.Google ScholarGoogle Scholar
  14. Xiayu Hua, Zheng Li, Hao Wu, Chunhui Guo, and Shangping Ren. 2015. Periodic resource integration. J. Syst. Softw. 110 (2015), 193--204. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Y. Li, A. M. K. Cheng, and A. K. Mok. 2012a. Regularity-based partitioning of uniform resources in real-time systems. RTCSA 2012.Google ScholarGoogle Scholar
  16. Y. Li and A. M. K. Cheng. 2012b. Static approximation algorithms for regularity-based resource partitioning. RTSS 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. M. Lopez, J. L. Diaz, and D. F. Garcia. 2004. Utilization bound for EDF scheduling on real-time multiprocessor systems. Real-Time Syst. 28, 1 (2004), 39--68. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. L. Liu and J. W. Layland. 1973. Scheduling algorithms for multiprogramming environment in a hard real-time environment. J. ACM 20, 1 (1973), 46--61. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Y. Li and A. M. K. Cheng. 2016a. Transparent real-time task scheduling on temporal resource partitions. IEEE Transaction on Computers (TC) 5 (2016), 1646--1655. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Y. Li and A. M. K. Cheng. 2016b. The Value of ‘Even Distribution’ for Temporal Resource Partitions. Technical Report, University of Houston, 2016.Google ScholarGoogle Scholar
  21. J. Lee, S. Xi, S. Chen, L. T. X. Phan, C. Gill, I. Lee, C. Lu, and O. Sokolsky. 2012. Realizing compositional scheduling through virtualization. RTCSA 2012.Google ScholarGoogle Scholar
  22. A. K. Mok and X. Feng. 2001a. Towards compositionality in real-time resource partitioning based on regularity bounds. RTSS 2001.Google ScholarGoogle ScholarCross RefCross Ref
  23. A. K. Mok, X. Feng, and D. Chen. 2001b. Resource partition for real-time systems. RTAS 2001.Google ScholarGoogle ScholarCross RefCross Ref
  24. Linh T. X. Phan, Meng Xu, Jaewoo Lee, Insup Lee, and Oleg Sokolsky. 2013. Overhead-aware compositional analysis of real-time systems. RTAS 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Shigero, M. Takashi, and H. Kei. 1999. On the schedulability conditions on partial time slots. RTCSA 1999.Google ScholarGoogle Scholar
  26. I. Shin and I. Lee. 2003. Periodic resource model for compositional real-time guarantees. RTSS 2003.Google ScholarGoogle Scholar
  27. I. Shin and I. Lee. 2004. Compositional real-time scheduling framework. RTSS 2004.Google ScholarGoogle Scholar
  28. M. Xu, L. T. X. Phan, I. Lee, O. Sokolsky, S. Xi, C. Lu, and C. D. Gill. 2013. Cache-aware compositional analysis of real-time multicore virtualization platforms. RTSS 2013.Google ScholarGoogle Scholar
  29. S. Xi, J. Wilson, C. Lu, and C. Gill. 2011. RT-Xen: Towards real-time hypervisor scheduling in Xen. EMSOFT 2011.Google ScholarGoogle Scholar
  30. W. Zhang, S. Rajasekaran, T. Wood, and M. Zhu. 2014. MIMP: deadline and interference aware scheduling of hadoop virtual machines. CCGRID 2014.Google ScholarGoogle Scholar
  31. Man-Ki Yoon, Jung-Eun Kim, Richard Bradford, and Lui Sha. 2013. Holistic design parameter optimization of multiple periodic resources in hierarchical scheduling. DATE 2013.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Toward a Practical Regularity-based Model: The Impact of Evenly Distributed Temporal Resource Partitions

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!