期刊文献+

Multi-Dimensional Scheduling for Real-Time Tasks on Heterogeneous Clusters 被引量:3

Multi-Dimensional Scheduling for Real-Time Tasks on Heterogeneous Clusters
原文传递
导出
摘要 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. 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.
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2009年第3期434-446,共13页 计算机科学技术学报(英文版)
基金 supported by the National Natural Science Foundation of China under Grant No.60673082 the Special Funds of Authors of Excellent Doctoral Dissertation in China under Grant No.200084.
关键词 CLUSTERS SCHEDULING MULTI-DIMENSIONAL HETEROGENEOUS REAL-TIME MAKESPAN clusters, scheduling, multi-dimensional, heterogeneous, real-time, makespan
  • 相关文献

参考文献2

二级参考文献43

  • 1Zheng K, Wang J, Huang L, Decarreau G. Open wireless software radio on common PC. In: Proc. of the 17th Annual IEEE Int'l Symp. on Personal, Indoor and Mobile Radio Communications. Helsinki: IEEE Press, 2006.707-716.
  • 2Pyndiah R, Glavieux A, Picart A, Jacq S. Near optimal decoding of product codes. In: Proc. of the IEEE Global Telecommunications Conf. San Francisco: IEEE Press, 1994. 339-343.
  • 3Yu NY, Kim Y, Lee PJ. Iterative decoding of product codes composed of extended hamming codes. In: Samir T, Mehmet U, eds. Proc. of the 5th IEEE Int'l Symp. on Computers and Communications. Antibes-Juan Les Pins: IEEE Press, 2000. 732-737.
  • 4Chi Z, Song L, Parhi KK. A study on the performance, complexity tradeoffs of block turbo decoder design. In: Proc. of the IEEE Int'l Symp. on Circuits and Systems. Sydney: IEEE Press, 2001,4:65-68.
  • 5Atdelzater TF, Atkins EM, Shin KG. QoS negotiation in real-time systems and its application to automated flight control. IEEE Trans. on Computers, 2000,49(11):1170-1183.
  • 6Qin 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.
  • 7Garey MR, Johnson DS. Strong NP-completeness results: motivation, examples, and implications. Journal of Association for Computing Machinery, 1978,25(3):499-508.
  • 8Subramani V, Kettimuthu R, Srinivasan S, Johnston J, Sadayappan P. Selective buddy allocation for scheduling parallel jobs on clusters. In: Gropp B, Pennington R, Reed D, Baker M, Brown M, Buyya R, eds. Proc. of the IEEE Int'l Conf. Cluster Computing. Chicago: IEEE Press, 2002. 107-116.
  • 9Vallee G, Morin C, Berthou JY, Rilling L. A new approach to configurable dynamic scheduling in clusters based on single system image technologies. In: Proc. of the Int'l Parallel and Distributed Processing Syrup. Nice: IEEE Press, 2003.22-26.
  • 10Braun TD, Siegal H J, Beck N, Boloni LL, Maheswaran M, Reuther AI, Robertson JP, Theys MD, Yao B, Hensgen D, Freund RF. A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Prasanna VK, ed. Proc. of the 8th Heterogeneous Computing Workshop. San Juan: IEEE Press, 1999. 15-29.

共引文献17

同被引文献25

  • 1罗宇平.基于Min-Min改进后的网格调度算法[J].微电子学与计算机,2009,26(3):86-88. 被引量:10
  • 2黄纬,温志萍,程初.云计算中基于K-均值聚类的虚拟机调度算法研究[J].南京理工大学学报,2013,37(6):807-812. 被引量:17
  • 3郭权,王希诚.网格环境下具有可靠性的任务调度策略[J].南京理工大学学报,2006,30(5):592-598. 被引量:6
  • 4Johnson B W.Design and analysis of fault tolerant digital systems[M]. Boston:Addison-Wesley Longman Publishing Co.,1988.
  • 5Liestman A L,Compbell R H.A fault-tolerant scheduling problem[J]. IEEE Transactions on Software Engineering, 1986,12(I 1): 1088-1089.
  • 6Manimaran G,Murthy C S R.A fault-tolerant dynamic scheduling algorithm for muhiprecessor real-time systems and its analysis[J]. IEEE Transactions on Parallel and Distributed Systems,1998,9 (11):1137-1152.
  • 7Oh Y,Son S H.Scheduling real-time tasks for dependability[J]. Journal of Operational Research Society, 1997,48 (6) : 629-639.
  • 8Ghosh S,Melhem R,Mosse D.Fauh-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems[J].IEEE Transactions on Parallel and Distributed Systems, 1997,8( 3 ) :272-284.
  • 9Al-Omari R,Somani A K,Manimaran G.Efficient overloading techniques for primary-backup scheduling in real-time systems[J].Journal of Parallel and Distributed Computing, 2004,64(5 ) : 629-648.
  • 10Xie Tao,Qin Xiao.Seheduling security-critical real-time applications on clusters[J].IEEE Transactions on Computers,2006,55 (7) : 864-879.

引证文献3

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部