Synchronization Analysis for Hard Real-Time Multicore Systems

Article Preview

Abstract:

Multicore processors are increasingly used in real-time embedded systems. Better utilization of hard real-time systems requires accurate scheduling and synchronization analysis. In this paper, we characterize the major synchronization penalties arising from partitioned fixed priority scheduling for hard real-time tasks on multicore platform, including transitive remote preemption, multiple remote blocking, and multiple priority inversions. Subsequently, we propose a new response time analysis by improving the approach to bound task blocking time. The key idea of this approach is to classify the total blocking time into (i) direct blocking, including local and remote blocking, and transitive remote preemption; and (ii) multiple local interference which is incurred by multiple priority inversion. Simulation results indicate that the proposed approach produces less pessimistic results in task blocking time, and better schedulability performance.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2246-2252

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] R. Rajkumar. Real-time synchronization protocols for shared memory multiprocessos Proc. Int. Conf. On Dist. Computing Syst.1990. pp.116-123.

Google Scholar

[2] P. Gai, G. Lipari and M.D. Natale. Minimizing memory utilization of real-time task sets in single and multiprocessor systems-on-a-chip Proc. Int. Conf. On Real-Time Syst. Symp. 2001. pp.73-83.

DOI: 10.1109/real.2001.990598

Google Scholar

[3] A. Block, H. Leontyev, B.B. Brandenburg and J.H. Anderson. A flexible real-time locking protocol for multiprocessors Proc. Int. Conf. On Real-Time Computing Syst. and Appl. 2007. pp.71-80.

DOI: 10.1109/rtcsa.2007.8

Google Scholar

[4] B.B. Brandenburg and J.H. Anderson. Optimality results for multiprocessor real-time locking Proc. Int. Conf. On Real-Time Syst. Symp. 2010. pp.49-60.

DOI: 10.1109/rtss.2010.17

Google Scholar

[5] L. Sha, R. Rajkumar and J.P. Lehoczky. IEEE Trans. Computers 39 (1990) 1175-85.

Google Scholar

[6] K. Lakshmanan, D. Niz and R. Rajkumar. Coordinated task scheduling, allocation and synchronization on multiprocessors Proc. Int. Conf. On Real-Time Syst. Symp. 2009. pp.469-78.

DOI: 10.1109/rtss.2009.51

Google Scholar

[7] S. Schliecker, M. Negrean and R. Ernst. IEEE Trans. Industrial Info. 5 (2009) 402-13.

Google Scholar

[8] J. Ras and A.M. Cheng An evaluation of the dynamic and static multiprocessor priority ceiling protocol and the multiprocesoor stack resource policy in an SMP system Proc. Int. Conf. On Real-Time Computing Syst. and Appl. 2009. pp.13-22.

DOI: 10.1109/rtas.2009.10

Google Scholar

[9] R. Henia, A. Hamann, M. Jersak, R. Racu, K. Richter and R. Ernst. IEEE Proc. Comput. Digital Techniques 152 (2005) 148-66.

DOI: 10.1049/ip-cdt:20045088

Google Scholar

[10] C.L. Liu and J.W. Layland. J. ACM. 20 (1973) 46-61.

Google Scholar

[11] K.W. Tindell, A. Buns and A.J. Welling. Real-Time Syst. 6 (1994) 133-51.

Google Scholar

[12] L. Ming. Scheduling of the inter-dependent messages in real-time communication Proc. Int. Workshop On Real-Time Computing Syst. and Appl.1994.

Google Scholar

[13] E. Bini and G.C. Buttazzo. Real-Time Syst. 30 (2005) 129-54.

Google Scholar