A Hybrid Gravitational Emulation Local Search-Based Algorithm for Task Scheduling in Cloud Computing

<div>Display of the relationship of resources as a weighted graph. In this figure, <svg height="8.02022pt" id="M8" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -7.81382 4.54925 8.02022" width="4.54925pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z"></path></g></svg> is a work and <svg height="8.8423pt" id="M9" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 18.942 8.8423" width="18.942pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M743 375C743 570 607 650 407 650H136L130 622C214 612 220 606 204 526L125 122C110 43 105 36 24 27L17 0H250C382 0 482 23 571 76C680 141 743 248 743 375ZM644 379C644 188 520 36 305 36C277 36 249 38 229 46C205 55 202 71 212 126L293 553C300 588 306 600 317 606C330 613 356 617 390 617C547 617 644 537 644 379Z"></path></g><g transform="matrix(.013,0,0,-0.013,10.089,0)"><path d="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z"></path></g></svg> is the number of data centers in a node.</div>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: A Hybrid Gravitational Emulation Local Search-Based Algorithm for Task Scheduling in Cloud Computing 