Fault Tolerant PLBGSA: Precedence Level Based Genetic Scheduling Algorithm for P2P Grid

<table>Ten runs of old GA algorithm with <svg height="12.9125" id="M268" style="vertical-align:-1.59705pt" version="1.1" viewbox="0 0 57.299999 12.9125" width="57.299999" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g><g transform="matrix(.017,-0,0,-.017,9.208,10.862)"><path d="M95 130q31 0 61 -30t30 -78q0 -53 -38 -87.5t-93 -51.5l-11 29q77 31 77 85q0 26 -17.5 43t-44.5 24q-4 0 -8.5 6.5t-4.5 17.5q0 18 15 30t34 12z" id="x2C"></path></g><g transform="matrix(.017,-0,0,-.017,15.905,10.862)"><path d="M412 140l28 -9q0 -2 -35 -131h-373v23q112 112 161 170q59 70 92 127t33 115q0 63 -31 98t-86 35q-75 0 -137 -93l-22 20l57 81q55 59 135 59q69 0 118.5 -46.5t49.5 -122.5q0 -62 -29.5 -114t-102.5 -130l-141 -149h186q42 0 58.5 10.5t38.5 56.5z" id="x32"></path></g><g transform="matrix(.017,-0,0,-.017,24.065,10.862)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g><g transform="matrix(.017,-0,0,-.017,33.21,10.862)"><path d="M95 130q31 0 61 -30t30 -78q0 -53 -38 -87.5t-93 -51.5l-11 29q77 31 77 85q0 26 -17.5 43t-44.5 24q-4 0 -8.5 6.5t-4.5 17.5q0 18 15 30t34 12z" id="x2C"></path></g><g transform="matrix(.017,-0,0,-.017,39.925,10.862)"><path d="M153 550l-26 -186q79 31 111 31q90 0 141.5 -51t51.5 -119q0 -93 -89 -166q-85 -69 -173 -71q-32 0 -61.5 11.5t-41.5 23.5q-18 17 -17 34q2 16 22 33q14 9 26 -1q61 -50 124 -50q60 0 93 43.5t33 104.5q0 69 -41.5 110t-121.5 41q-53 0 -102 -20l38 305h286l6 -8
l-26 -65h-233z" id="x35"></path></g><g transform="matrix(.017,-0,0,-.017,48.084,10.862)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g>
</svg>, and <svg height="11.125" id="M269" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 17.424999 11.125" width="17.424999" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M249 635q70 0 116 -43t46 -105q0 -46 -28 -80q-22 -25 -80 -64q62 -35 97 -75t35 -99q0 -81 -63 -131t-135 -50q-83 0 -137.5 45.5t-54.5 123.5q0 52 45 95q29 28 89 64q-109 62 -109 155q0 66 50.5 115t128.5 49zM238 603q-42 0 -67.5 -31t-25.5 -72q0 -50 32.5 -79.5
t98.5 -62.5q61 48 61 124q0 59 -29.5 90t-69.5 31zM248 20q46 0 76.5 33.5t30.5 89.5q0 50 -39 85.5t-110 71.5q-81 -54 -81 -137q0 -67 35.5 -105t87.5 -38z" id="x38"></path></g><g transform="matrix(.017,-0,0,-.017,8.222,10.862)"><path d="M515 96q-37 -44 -84.5 -76t-71.5 -32q-12 0 -18 7t-6 34t10 75l19 89h-2q-87 -113 -181 -176q-43 -29 -83 -29q-46 0 -46 63q0 31 9 67l52 222q7 36 -1 36q-10 0 -76 -50l-13 24q47 45 92 71.5t67 26.5q18 0 21 -16.5t-8 -65.5l-56 -242q-16 -67 13 -67q41 0 114 74
t114 146l32 145l74 26h11q-52 -199 -80 -347q-8 -39 6 -39q7 0 32 17.5t47 39.5z" id="x1D462"></path></g>
</svg> generations.</table>

Journal of Engineering

fig10

Figure 10

Figure 10: Fault Tolerant PLBGSA: Precedence Level Based Genetic Scheduling Algorithm for P2P Grid 