Skip to main content
SpringerLink
Log in

The partitioned scheduling of sporadic task systems on multiprocessors

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Abstract The DBF * algorithm of sporadic task systems on multiprocessors uses the approximation of the exact demand bound function on uniprocessor as a criterion. The systems which are feasible under the partitioned paradigm are flagged as “infeasible” sometimes. In this paper, we present a novel efficient DBF(eDBF) partitioned scheduling algorithm. A criterion which tracks the demand bound function exactly as needed is used to avoid the incorrect judgment in determining whether a processor can accommodate an additional task in the new algorithm. We give the pseudo code of the new algorithm on least-number processors and fixed-number processors respectively. Then, we prove the correctness of, and evaluated the effectiveness of this new algorithm. The experimental results demonstrate that eDBF has better performance than DBF * and Density algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fisher N, Baruah S (2005) The partitioned, static-priority scheduling of sporadic real-time tasks with constrained deadlines on multiprocessor platforms. In: The 9th international conference on principles of distributed systems, pp 291–305

  2. Lehoczky JP (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the 11th real-time systems symposium, pp 201–209

  3. Fisher N, Baruah S, Baker TP (2006) The partitioned scheduling of sporadic tasks according to static-priorities. In: the 18th Euromicro conference on real-time systems, pp 118–127

  4. Krishnamurti R, Ma E (1992) An approximation algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems. IEEE Trans Comput 41:1572–1579

    Article  Google Scholar 

  5. Baruah S, Fisher N (2007) The partitioned dynamic-priority scheduling of sporadic task systems. Real-Time Syst 36:199–226

    Article  MATH  Google Scholar 

  6. Baruah S, Fisher N (2006) The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans Comput 55:918–923

    Article  Google Scholar 

  7. Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology

  8. Baker TP, Cirinei M (2007) Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks. In: Lecture notes in computer science, vol 4878. Springer, Berlin, pp 62–75

    Google Scholar 

  9. Baruah S, Fisher N (2007) Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems. In: Lecture notes in computer science, vol 4878. Springer, Berlin, pp 204–216

    Google Scholar 

  10. Baruah S, Fisher N (2008) Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In: Lecture notes in computer science, vol 4904. Springer, Berlin, pp 215–226

    Google Scholar 

  11. Dubernard JP, Genjet D (2002) Scheduling hard sporadic tasks by means of finite automata and generating functions. In: 6th International conference on implementation and application of automata, pp 87–100

  12. Park SJ, Cho KH (2008) Real-time preemptive scheduling of sporadic tasks based on supervisory control of discrete event systems. Inf Sci 178:3393–3401

    Article  MathSciNet  MATH  Google Scholar 

  13. Johnson DS (1973) Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology

  14. Baruah S, Mok A, Rosier L (1990) Preemptively Scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th real-time systems symposium, pp 182–190

  15. Baruah S, Chen D, Gorinsky S, Mok A (1999) Generalized multiframe tasks. Int J Time-Crit Comput Syst 15:5–22

    Google Scholar 

  16. Devi M (2003) An improved schedulability test for uniprocessor periodic task systems. In: The 15th Euromicro conference on real-time systems, pp 23–30

  17. Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20:46–61

    Article  MathSciNet  MATH  Google Scholar 

  18. Albers K, Slomka F (2004) An event stream driven approximation for the analysis of real-time systems. In: The 16th Euromicro conference on real-time systems, pp 187–195

  19. Albers K, Slomka F (2005) Efficient feasibility analysis for real-time systems with EDF scheduling. In: Proceedings of the design, automation and test in Europe conference and exhibition, pp 492–497

Download references

Author information

Authors and Affiliations

  1. Department of Automation, Dalian University of Technology, Liaoning, 116024, China

    Wei Ba, Dabo Zhang, Qi Li & Wei Wang

Authors
  1. Wei Ba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dabo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qi Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Ba.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ba, W., Zhang, D., Li, Q. et al. The partitioned scheduling of sporadic task systems on multiprocessors. J Supercomput 59, 227–245 (2012). https://doi.org/10.1007/s11227-010-0433-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0433-z

Keywords

Search

Navigation