Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Multi-Dimensional Scheduling for Real-Time Tasks on Heterogeneous Clusters

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Multiple performance requirements need to be guaranteed in some real-time applications such as multimedia data processing and real-time signal processing in addition to timing constraints. Unfortunately, most conventional scheduling algorithms only take one or two dimensions of them into account. Motivated by this fact, this paper investigates the problem of providing multiple performance guarantees including timeliness, QoS, throughput, QoS fairness and load balancing for a set of independent tasks by dynamic scheduling. We build a scheduler model that can be used for multi-dimensional scheduling. Based on the scheduler model, we propose a heuristic multi-dimensional scheduling strategy, MDSS, consisting of three steps. The first step can be of any existing real-time scheduling algorithm that determines to accept or reject a task. In step 2, we put forward a novel algorithm MQFQ to enhance the QoS levels of accepted tasks, and to make these tasks have fair QoS levels at the same time. Another new algorithm ITLB is proposed and used in step 3. The ITLB algorithm is capable of balancing load and improving throughput of the system. To evaluate the performance of MDSS, we perform extensive simulation experiments to compare MDSS strategy with MDSR strategy, DASAP and DALAP algorithms. Experimental results show that MDSS significantly outperforms MDSR, DASAP and DALAP.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Hwang K, Xu Z. Scalable Parallel Computing: Technology, Architecture, Programming. USA: McGraw-Hill, 1998.

    MATH  Google Scholar 

  2. Qin X, Jiang H. A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters. Journal of Parallel and Distributed Computing, 2005, 65(8): 885–900.

    Article  MATH  Google Scholar 

  3. Xie T, Qin X. Scheduling security-critical real-time applications on clusters. IEEE Trans. Computers, 2006, 55(7): 864–879

    Article  Google Scholar 

  4. Krishna C M, Shin K G. Real-Time Systems. USA: McGraw-Hill, 2001.

    Google Scholar 

  5. Zhu X, Lu P. Study of scheduling for processing real-time communication signals on heterogeneous clusters. In Proc. 9th Int. Symp. Parallel Architectures, Algorithms, and Networks, Sydney, Australia, May 7–9, 2008, pp.121–126.

  6. Zhu X, Lu P. Scheduling of real-time signal processing in cluster-based software radio systems. Journal of Software, 2009, 20(3): 766–778.

    MathSciNet  Google Scholar 

  7. Zhu X, Lu P. Multi-dimensional scheduling scheme for QoS-aware real-time applications on heterogeneous clusters. In Proc. 10th IEEE Int. Conf. High Performance Computing and Communications, Dalian, China, Sept. 25–27, 2008, pp.205–212.

  8. Pyndiah R, Glavieux A, Picart A et al. Near optimal decoding of product codes. In Proc. IEEE Global Telecommunications Conf., Dallas, Texas, USA, Nov. 29–Dec. 3, 2004, pp.339–343.

  9. Chi Z, Song L, Parhi K K. A study on the performance, complexity tradeoffs of block turbo decoder design. In Proc. IEEE Int. Symp. Circuits and Systems, Sydney, Australia, May 6–9, 2001, pp.65–68.

  10. Adde P, Pyndiah R. Recent simplifications and improvements in block turbo codes. In Proc. 2nd Int. Symp. Trubo Codes and Related Topics, Brest, France, Sept. 4–7, 2000, pp.133–136.

  11. Ullman J D. NP-complete scheduling problems. Journal of Computer and System Sciences, 1975, 10(3): 384–393.

    Article  MATH  MathSciNet  Google Scholar 

  12. Braun T D, Siegal H J, Beck N et al. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In Proc. 8th Heterogeneous Computing Workshop, San Juan, Puerto Rico, Apr. 12, 1999, pp.15–29.

  13. Maheswaran M, Ali S, Siegel H J et al. Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing, 1999, 59(2): 107–121.

    Article  Google Scholar 

  14. Beccari G, Caselli S, Zanichelli F. A technique for adaptive scheduling of soft real-time tasks. Journal of Real-Time Systems, 2005, 30(3): 187–215.

    Article  MATH  Google Scholar 

  15. Manimaran G, Murthy C S R. A fault-tolerant dynamic scheduling algorithm for multiprocessor real-time systems and its analysis. IEEE Trans. Parallel and Distributed Systems, 1998, 9(11): 1137–1152.

    Article  Google Scholar 

  16. Topcuoglu H, Hariri S. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel and Distributed Systems, 2002, 13(3): 260–274.

    Article  Google Scholar 

  17. Abdelzaher T F, Shin K G. Combined task and message scheduling in distributed real-time systems. IEEE Trans. Parallel and Distributed Systems, 1999, 10(11): 1179–1191.

    Article  Google Scholar 

  18. He L, Jarvis S A, Spooner D P et al. Dynamic scheduling of parallel real-time jobs by modeling spare capabilities in heterogeneous clusters. In Proc. IEEE Int. Conf. Cluster Computing, Hong Kong, China, Dec. 1–4, 2003, pp.2–10.

  19. Cheng S, Huang Y. Dynamic real-time scheduling multi-processor tasks using genetic algorithm. In Proc. Int. Conf. Computer Software and Applications, Hong Kong, China, Sept. 28–30, 2004, pp.154–160.

  20. Boyer W F, Hura G S. Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments. Journal of Parallel and Distributed Computing, 2005, 65(9): 1035–1046.

    Article  MATH  Google Scholar 

  21. Ghosh S, Melhem R, Mosse D. Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems. IEEE Trans. Parallel and Distributed Systems, 1997, 8(3): 272–284.

    Article  Google Scholar 

  22. Palis M A. Online real-time job scheduling with rate of progress guarantees. In Proc. Int. Symp. Parallel Architectures, Algorithms and Networks, Manila, Philippines, May 23–25, 2002, pp.57–62.

  23. Xu J, Parnas L. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Trans. Software Engineering, 1990, 16(3): 360–369.

    Article  Google Scholar 

  24. Yang C, Deconinck G, Gui W. Fault-tolerant scheduling for real-time embedded control systems. Journal of Computer Science and Technology, 2004, 19(2): 191–202.

    Article  MathSciNet  Google Scholar 

  25. Li W, Kavi K, Akl R. A non-preemptive scheduling algorithm for soft real-time systems. Journal of Computers and Electrical Engineering, 2007, 33(1): 12–29.

    Article  MATH  Google Scholar 

  26. Manimaran, C S R Murthy. An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Trans. Parallel and Distributed Systems, 1998, 9(3): 312-319.

    Article  Google Scholar 

  27. Atdelzater T F, Atkins E M, Shin K G. QoS negotiation in real-time systems and its application to automated flight control. IEEE Trans. Computers, 2000, 49(11): 1170–1183.

    Article  Google Scholar 

  28. Guo J, Bhuyan L N. Load balancing in a cluster-based web server for multimedia applications. IEEE Trans. Parallel and Distributed Systems, 2006, 17(11): 1321–1334.

    Article  Google Scholar 

  29. Harada F, Ushio T, Nakamoto Y. Adaptive resource allocation control for fair QoS management. IEEE Trans. Computers, 2007, 56(3): 344–357.

    Article  MathSciNet  Google Scholar 

  30. He L, Jarvis S A, Spooner D P. Dynamic scheduling of parallel jobs with QoS demands in multiclusters and grids. In Proc. 5th IEEE/ACM Int. Workshop on Grid Computing, Pittsburgh, USA, Nov. 8, 2004, pp.402–409.

  31. Doğan A, Özgüner F. On QoS-based scheduling of a meta-task with multiple QoS demands in heterogeneous computing. In Proc. 16th IEEE Int. Symposium on Parallel and Distributed Processing, Florida, USA. Apr. 15–19, 2002, pp.50–55.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Fudan University, Shanghai, 200433, China

    Xiao-Min Zhu (Member, IEEE) & Pei-Zhong Lu

Authors
  1. Xiao-Min Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pei-Zhong Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiao-Min Zhu.

Additional information

This work is supported by the National Natural Science Foundation of China under Grant No. 60673082, and the Special Funds of Authors of Excellent Doctoral Dissertation in China under Grant No. 200084.

The previous version appeared in Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications (HPCC 2008), pp.205–212.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 89.7 kb).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, XM., Lu, PZ. Multi-Dimensional Scheduling for Real-Time Tasks on Heterogeneous Clusters. J. Comput. Sci. Technol. 24, 434–446 (2009). https://doi.org/10.1007/s11390-009-9235-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-009-9235-2

Keywords

Search

Navigation