Enabled to provide pervasive access to distributed resources in parallel ways, heterogeneous scheduling is applied extensively in large-scale computing systems for high performance. Conventional real-time scheduling algorithms, however, disregard energy efficiency in addition to stringent timing constraints. In recognition of green computing, an energy-aware model is first presented. Second, inspired by multi-disciplines, the meta-heuristic is addressed based on the supercomputer hybrid architecture. On the other hand, some technological breakthroughs are achieved, including boundary conditions for different heterogeneous computing and grid scheduling and descriptions of real-time variation of scheduling indexes (stringent timing and energy constraints). Extensive simulator and simulation experiments highlight higher efficacy and better scalability for the proposed approaches compared with the other three meta-heuristics; the overall improvements achieve 8%, 12% and 14% for high-dimension instances, respectively.
AbdelzaherTShinK (1999) Combined task and message scheduling in distributed real-time systems. IEEE Transactions on Parallel and Distributed Systems10(11): 967–985.
2.
AliSSiegelHJMaheswaranMHensgenD (2000) Task execution time modeling for heterogeneous computing systems. In: Proceedings of heterogeneous computing workshop, pp. 185–199.
3.
BraunTDSiegelHJBeckN. (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing61(6): 810–837.
4.
ChanHLChanJW-T (2009) Optimizing throughput and energy in online deadline scheduling. ACM Transactions on Algorithms6(1): 1–10.
5.
ChengSHuangY (2004) Dynamic real-time scheduling for multi-processor tasks using genetic algorithm. In: Proceedings of the 28th annual international conference on computer software and applications, pp. 154–160.
6.
De FalcoIDella CioppaAMaistoDScafuriUTarantinoE (2012) Biological invasion-inspired migration in distributed evolutionary algorgithms. Information Sciences207: 50–65.
7.
FengWHsuC (2004) The origin and evolution of green destiny. In: IEEE Cool Chips VII: an international symposium on low-power and high-speed chips, pp. 374–382.
8.
Fernandez-MartinezJGarcia-GonzaloE (2011) Stochastic stability analysis of the linear continuous and discrete pso models. IEEE Transactions on Evolutionary Computation15(3): 405–423.
9.
GargSKCSY (2011) Environment-conscious scheduling of hpc applications on distributed cloud oriented data centers. Journal of Parallel and Distributed Computing71(1): 732–749.
10.
HanXLamT-WLeeL-KToIKKKWongPWH (2010) Deadline scheduling and power management for speed bounded processors. Theoretical Computer Science411(40–42): 3587–3600.
11.
HuFEvansJJ (2009) Power and environment aware control of Beowulf clusters. Cluster Computing12(3): 299–308.
12.
IraniSShuklaSGuptaR (2007) Algorithms for power savings. ACM Transactions on Algorithms3(4): 1–41.
13.
KimKHBuyyaRKimJ (2007) Power aware scheduling of bag of-tasks applications with deadline constraints on dvs-enabled clusters. In: Proceedings of the 7th international cluster computing and the grid (CCGRID), pp. 541–548.
14.
LiMLiuBJYaoFF (2006) Min-energy voltage allocation for tree structured tasks. Journal of Combinatorial Optimization11(3): 305–319.
15.
LiMYaoFF (2005) An efficient algorithm for computing optimal discrete voltage schedules. SIAM Journal of Computing35(3): 658–671.
16.
LiuCLaylandJ (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM20(1): 46–61.
17.
LuoP (2007) A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing67(6): 695–714.
18.
MaYGongBSugiharaRGuptaR (2012) Energy-efficient deadline scheduling for heterogeneous systems. Journal of Parallel and Distributed Computing72(12): 1725–1740.
19.
MinDXiaoZShengBQuanyongHXuweiP (2014) Design and implementation of heterogeneous iot gateway based on dynamic priority scheduling algorithm. Transactions of The Institute of Measurement and Control36(7): 924–931.
NesmachnowSCancelaHAlbaE (2012) A parallel micro evolutionary algorithm for heterogeneous computing and grid scheduling. Applied Soft Computing12(2): 626–639.
22.
PantAJafriH (2004) Communicating efficiently on cluster based grids with MPICH-VMI. In: Proceedings of IEEE international conference on cluster computing, pp. 23–33.
23.
PoliR (2008) Dynamics and stability of the sampling distribution of particle swarm optimisers via moment analysis. Journal of Artificial Evolution and Applications10: 761459.
24.
RamamrithamKStankovicJ (1984) Dynamic task scheduling in distributed hard real-time system. IEEE Software1(3): 46–61.
25.
StankovicJSpuriMRamamrithamKButtazzoG (1998) Deadline scheduling for real-time systems—EDF and related algorithms (The Springer International Series in Engineering and Computer Science, vol. 20(1)). New York: Springer, pp. 46–61.
26.
SubramaniVKettimuthuRSrinivasanSJohnstonJSadayappanP (2002) Selective buddy allocation for scheduling parallel jobs on clusters. In: Proceedings IEEE Intenational conference on cluster computing, pp. 107–116.
27.
IBM Blue/Gene Team (2008) Overview of the IBM Blue Gene/P project. IBM Journal of Research and Development52(1): 199–220.
28.
ValleeGMorinCBerthouJYRillingL (2003) A new approach to configurable dynamic scheduling in clusters based on single system image technologies. In: Proceedings of the international symposium on parallel and distributed processing, pp. 107–116.
29.
WangJGongBLiuHLiSYiJ (2014) Heterogeneous computing and grid scheduling with parallel biologically inspired hybrid heuristics. Transactions of The Institute of Measurement and Control36(6): 805–814.
30.
XhafaF (2007) A hybrid evolutionary heuristic for job scheduling in computational grids (Studies in Computational Intelligence, vol. 75). New York: Springer.
31.
XhafaFAlbaEDorronsoroB (2007) Efficient batch job scheduling in grids using cellular memetic algorithms. In: Proceedings of the 21st international parallel and distributed processing symposium, pp. 1–8.
32.
YaoFDemersAShenkerS (1995) A scheduling model for reduced CPU energy. In: Proceedings of the 36th IEEE symposium on foundations of computer science (FOCS), pp. 374–382.
33.
ZhangYSivasubramaniamAMoreiraJFrankeH (2001) Impact of workload and system parameters on next generation cluster scheduling mechanisms. IEEE Transactions on Parallel and Distributed Systems12(9): 967–985.
