Implementation of nMPRA CPU architecture based on preemptive hardware scheduler engine and different scheduling algorithms

Implementation of nMPRA CPU architecture based on preemptive hardware scheduler engine and different scheduling algorithms

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Computers & Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Taking into consideration the requirements of real-time embedded systems, the processor scheduler must guarantee a constant scheduling frequency, providing determinism and predictability of tasks execution. The purpose of this study is to implement the nMPRA (multi pipeline register architecture) processor into field-programmable gate array, and to integrate the already existing scheduling methods, thus providing a preemptive schedulability analysis of the proposed architecture based on the pipeline assembly line and hardware scheduler. This study describes a hardware implementation of the real-time scheduler named nHSE (hardware scheduler engine for n tasks) and presents the results obtained using the appropriate schedulability methods used in real-time environments. The scheduling and task switch operations are the main source of non-determinism, being successfully dealt with real-time nMPRA concept, in order to improve the system's functionality. Some mechanisms used for synchronisation and inter-task communication are also taken into consideration.


    1. 1)
      • 1. Buttazzo, G.C.: ‘Hard real-time computing systems – predictable scheduling algorithms and applications’ (Springer, New York, 2011, 3rd edn.), ISBN: 978-1-4614-0675-4.
    2. 2)
      • 2. Găitan, V.G., Găitan, N.C., Ungurean, I.: ‘CPU architecture based on a hardware scheduler and independent pipeline registers’, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2015, 23, (9), pp. 16611674, doi: 10.1109/TVLSI.2014.2346542.
    3. 3)
      • 3. Shahbazi, M., Poure, P., Saadate, S., et al: ‘Fault-tolerant five-leg converter topology with FPGA-based reconfigurable control’, IEEE Trans. Ind. Electron., 2013, 60, (6), pp. 22842294.
    4. 4)
      • 4. Phuong, T.T., Ohishi, K., Yokokura, Y., et al: ‘FPGA-based high-performance force control system with friction-free and noisefree force observation’, IEEE Trans. Ind. Electron., 2014, 61, (2), pp. 9941008, doi: 10.1109/TIE.2013.2266081.
    5. 5)
      • 5. Zimmer, M., Broman, D., Shaver, C., et al: ‘FlexPRET: a processor platform for mixed-criticality systems’. Proc. of the 20th IEEE Real-Time and Embedded Technology and Application Symp. (RTAS), Berlin, Germany, 15–17 April 2014, doi: 10.1109/RTAS.2014.6925994.
    6. 6)
      • 6. MicroBlaze Soft Processor Core. Available, Xilinx, accessed January 2017.
    7. 7)
      • 7. Oliveira, S.R., Almeida, L., Ferrari, A.d.B.: ‘The ARPA-MT embedded SMT processor and its RTOS hardware accelerator’, IEEE Trans. Ind. Electron., 2011, 58, (3), pp. 890904, doi: 10.1109/TIE.2009.2028359.
    8. 8)
      • 8. Tănase, C.A.: ‘An approach of MPRA technique over ARM cache architecture’. 2016 Int. Conf. on Development and Application Systems (DAS), Suceava, Romania, 2016, pp. 8690, doi: 10.1109/DAAS.2016.7492553.
    9. 9)
      • 9. Amber Open Source Project, March 2015. Available at,filedetails?repname=amber&path=%2Famber%2Ftrunk%2Fdoc%2Famber-core.pdf, accessed November 2016.
    10. 10)
      • 10. Baruah, S.K.: ‘The limited-preemption uniprocessor scheduling of sporadic task systems’. Proc. of the 17th Euromicro Conf. on Real-Time Systems (ECRTS'05), Palma de Mallorca, Balearic Islands, Spain, July 2005, pp. 137144, doi: 10.1109/ECRTS.2005.32.
    11. 11)
      • 11. Yao, G., Buttazzo, G.C., Bertogna, M.: ‘Bounding the maximum length of non-preemptive regions under fixed priority scheduling’. Proc. of the 15th IEEE Int. Conf. on Embedded and Real-Time Computing Systems and Applications (RTCSA'09), Beijing, China, August 2009, pp. 351360.
    12. 12)
      • 12. Burns, A.: ‘Preemptive priority-based scheduling: an appropriate engineering approach’, in Son, S.H. (Ed.): ‘Advances in real-time systems’ (Prentice-Hall, New Jersey, USA, 1995), pp. 225248, ISBN: 0-13-083348-7.
    13. 13)
      • 13. Singh, P., Pandey, A., Mekonnen, A.: ‘Varying response ratio priority: a preemptive CPU scheduling algorithm (VRRP)’, J. Comput. Commun., 2015, 3, pp. 4051.
    14. 14)
      • 14. Wang, G., Guo, H., Wang, Y.: ‘A novel heterogeneous scheduling algorithm with improved task priority’. 2015 IEEE 17th Int. Conf. on High Performance Computing and Communications, 2015 IEEE 7th Int. Symp. on Cyberspace Safety and Security, and 2015 IEEE 12th Int. Conf. on Embedded Software and Systems, New York, NY, 2015, pp. 18261831, doi: 10.1109/HPCC-CSS-ICESS.2015.48.
    15. 15)
      • 15. Noon, A., Kalakech, A., Kadry, S.: ‘A new round robin based scheduling algorithm for operating systems – dynamic quantum using the mean average’, Int. J. Comput. Sci. Issues (IJCSI), 2011, 8, (3), no. 1, pp. 224229.
    16. 16)
      • 16. Ale Agha, A.E., Jassbi, S.J.: ‘A new method to improve round robin scheduling algorithm with quantum time based on harmonic-arithmetic mean (HARM)’, Int. J. Inf. Technol. Comput. Sci. (IJITCS), 2013, 5, (7), pp. 5662, doi: 10.5815/ijitcs.2013.07.07.
    17. 17)
      • 17. Xiaojie, L., Xianbo, H.: ‘The improved EDF scheduling algorithm for embedded real-time system in the uncertain environment’. 2010 3rd Int. Conf. on Advanced Computer Theory and Engineering (ICACTE), August 2010, vol. 4, pp. V4-563V4-566, doi: 10.1109/ICACTE.2010.5579295.
    18. 18)
      • 18. Ayers, G.: ‘eXtensible Utah Multicore (XUM) project at the University of Utah, 2011–2012’. Available at,mips32r1, accessed September 2015.
    19. 19)
      • 19. Meakin, B.: ‘Multicore system design with Xum: the extensible Utah multicore project’. Master of Science thesis, The University of Utah, May 2010.
    20. 20)
      • 20. Patterson, D.A., Hennessey, J.L.: ‘Computer organization and design, the hardware/software interface’ (2011, 4th edn., Morgan Kaufmann, MA, USA), ISBN: 9780123747501.
    21. 21)
      • 21. MIPS® Architecture for Programmers Volume I-A: Introduction to the MIPS32® Architecture Document Number: MD00082 Revision 3.02, 21 March 2011, Available at, accessed May 2016.
    22. 22)
      • 22. Kelinman, S., Eykholt, J.: ‘Interrupts as threads’, ACM SIGOPS Oper. Syst. Rev., 1995, 29, (2), pp. 2126, doi: 10.1145/202213.202217.
    23. 23)
      • 23. El-Maleh, A.H.: ‘Finite state machine-based fault tolerance technique with enhanced area and power of synthesised sequential circuits’, IET Comput. Digit. Tech., 2017, 11, (4), pp. 159164, doi: 10.1049/iet-cdt.2016.0085.
    24. 24)
      • 24. Kuacharoen, P., Shalan, M., Mooney, V.J.III: ‘A configurable hardware scheduler for real-time systems’. Proc. Engineering of Reconfigurable Systems and Algorithms, 2003, pp. 95101.
    25. 25)
      • 25. Ramachandran, S.: ‘Digital VLSI systems design: a design manual for implementation of projects on FPGAs and ASICs using Verilog’ (Springer, Netherlands, 2007), eBook ISBN: 978-1-4020-5829-5, doi: 10.1007/978-1-4020-5829-5.
    26. 26)
      • 26. Ashenden, P.J.: ‘Digital design an embedded systems approach using Verilog’, 10 September 2007, ISBN: 978-0-12-369527-7, eBook ISBN: 9780080553115.

Related content

This is a required field
Please enter a valid email address