TABLE OF CONTENTS(Sample )

Page
No
DECLARATION………………………………………………… I

ACKNOWLEDGEMENTS…………………………………………….. Ii

ABSTRACT………………………………………………………….. Iii

TABLE OF CONTENTS…………………………………………….. V

LIST OF FIGURES…………………………………………………. Viii

LIST OF TABLES………………………………………………….. Viii

LIST OF SNAPSHOTS…………………………………………… Ix

LIST OF ALGORITHMS…………………………………………… X

LIST OF ABBREVIATIONS………………………………………. X

1. INTRODUCTION……………………………………………………. 1

1.1 Overview………………………………………………………….. 1

1.2 Problem Definition………………………………………………. 1

1.3 Thesis Objective and Scope……………………………………… 2

1.4 Thesis Outline…………………………………………………… 3

2. SURVEY OF GRID SCHEDULING ALGORITHMS…………… 4

2.1 Overview……..………………………………………………… 4

2.2 Characteristics of Grid Computing……………………………… 4

2.3 Types of Grids………………………………………………… 5

2.4 Features of Grid Computing…………………………………….. 6

2.5 Real Time Application in Grid Computing……………………… 6

v
 2.6 Challenges of Grid Computing……………………………….. 7

2.7 Benefits and Limitations of Grid Computing…………………. 8

2.8 Grid Scheduling Algorithms………………………………….. 9

2.8.1 Independent Task Scheduling…………………………… 10

3. SYSTEM ANALYSIS AND DESIGN……………………………. 17

3.1 Existing System-Hierarchical Scheduling Model…………………. 17

3.2 Problem of Heterogeneity…………………………………………. 17

3.3 Proposed System-Reliability Based Scheduling Algorithm……… 18

3.3.1 System Architecture………..…………………………… 18

3.3.2 Grid Applications…………………………………….. 20

3.4 Reliability Based Scheduling Algorithm……………… 23

3.4.1 Global and Local Reliability Scheduling……. 23

3.4.1.1 Task Reliability Analysis………… 24

3.4.1.2 Task Priorities Phase……………….. 25

3.4.1.3 Task Assignment Phase…………… 27

4. EXPERIMENTAL RESULTS…………………………………… 32

4.1 Introduction……………………………………………………. 32

4.2 Tools…………………..………………………………………. 32

4.2.1 GridSim5.0 Toolkit……………………………………… 32

4.2.2 GridSim Methods used in Project…………… 32

4.2.3 Initializing GridSim…………………………. 34

4.3 Performance Evaluation………………………………………… 35

4.3.1 Comparison Metrics…………………………………… 36

4.3.2 Randomly Generated Application Graphs……………… 37

vi
 4.3.3 Grid Application Environment…………… 44

5. CONCLUSION AND SCOPE FOR FUTURE WORK…………… 48

5.1 Conclusion……………………………………………………….. 48

5.2 Scope for Future Work………………………………………….. 49

REFERENCES………………………………………………………. 50

APPENDICES……………………………………………………….. 53

Appendix A: GridSim5.0 Simulator………………………….. 53

LIST OF FIGURES

S.No Figure Page

No No.

vii
 1. 3.1 Architecture of Hierarchical Grid Scheduling Model 19

2. 3.2 A Simple DAG Representing Precedence Constrained Application 20

3. 4.1 Schedule Length Comparison with HEFT algorithm 38

4. 4.2 Speedup Comparison with HEFT algorithm 38

5. 4.3 Speedup for different reliability overhead 39

6. 4.4 Schedule Length for different reliability overhead 39

7. 4.5 System Reliability for different applications 40

8. 4.6 System Reliability with different CCR values 41

9. 4.7 Speedup with different CCR values 42

10. 4.8 Schedule Length with different CCR values 42

LIST OF TABLES
S.No Table Page
No.
No.
1. 2.1 Comparison of Existing Grid Scheduling Algorithms 16

2. 3.1 Definitions of Notations 21

3. 4.1 Simulation Parameters 34

4. 4.2 Schedule Length comparison with HEFT algorithm 38

5. 4.3 Speedup comparison with HEFT algorithm 38

6. 4.4 Speedup for different reliability overhead 39

7. 4.5 Schedule length for different reliability overhead 39

viii
 8. 4.6 System Reliability for different applications 40

9. 4.7 System reliability for different CCR values 41

10. 4.8 Speedup for different CCR values 41

11. 4.9 Schedule length for different CCR values 42

12. 4.10 Simulation Results 43

LIST OF SNAPSHOTS

S.No Figure No. Page No.

1. 4.9 System Architecture of Algorithm 45

2. 4.10 DAG of the application with 4 tasks 45

3. 4.11 Local Scheduler result 46

4. 4.12 Global Scheduler result 46

5. 4.13 Graphical representation of System Reliability factor 47

6. 4.14 Graphical Representation of Schedule Length 47

comparison with HEFT algorithm

7. 4.15 Graphical Representation of Speedup comparison 47

with HEFT algorithm

ALGORITHMS

S.No Algorithm No Page.No

1. 3.1 Reliability Based Scheduling Algorithm 30

ix
 LIST OF ABBREVIATIONS

WLAN Wireless Local Area Network

VN Virtual Node

VL Virtual Link

HDC Heterogeneous Distributed Computing

MCT Minimum Completion Time

HEFT Heterogeneous Earliest Finish Time

CPOP Critical Path on a Machine

DAG Directed Acyclic Graph

EST Earliest Start Time

EFT Earliest Finish Time

ESA Earliest Start Time of an Application

EFA Earliest Finish Time of an Application

DRT Data Ready Time

LC Local System Overhead

SC System Overhead

VO Virtual Organisation

RAC Application Reliability Overhead

CCR Communication to Computation Cost Ratio

x
RASD Reliability Aware Scheduling Driven Algorithm

xi