文摘
英文文摘
论文说明：LIST OF FIGURES、LIST OF TABLES
声明
CHAPTER 1: INTRODUCTION
1.1 The purpose and significance of the paper
1.2 Grid Computing
1.3 Scheduling
1.3.1 Job Shop Scheduling
1.3.2 Resource Scheduling
1.3.3 The difficulties of Resource Scheduling
1.4 Optimization
1.5 Summary
CHAPTER 2: PARTICLE SWARM OPTIMIZATION
2.1 Purpose
2.2 Introduction
2.3 Simulating Social Behavior
2.3.1 Human Social Behavior
2.3.2 Mapping to a Computer Simulation
2.4 Precursors: The Etiology of Particle Swarm Optimization
2.4.1 Nearest Neighbor Velocity Matching and Craziness
2.4.2 The Cornfield Vector
2.4.3 Eliminating Ancillary Variables
2.4.4 Multidimensional Search
2.4.5 Acceleration by Distance
2.4.6 Current Simplified Version
2.5 Principles of Swarm Intelligence
2.6 Summary
CHAPTER 3: HETEROGENEOUS COMPUTING
3.1 Purpose
3.2 Introduction
3.3 Multiclass Applications
3.4 Model Description and Problem
3.4.1 Architecture Model
3.4.2 Modeling Multiclass Tasks with Availability Requirements
3.4.3 Problem Formulation
3.4.4 Heterogeneity Model
3.5 The Availability-Aware Scheduling Algorithm-SSAC
3.6 Summary
CHAPTER 4: SIMULATION AND EXPERIMENTAL RESULTS
4.1 Purpose
4.2 The SimGrid Framework
4.2.1 Maintaining the topology
4.2.2 Managing the tasks
4.2.3 Organizing the paths and channels
4.2.4 Simulation Kernels and Models
4.2.5 User Interfaces
4.3 Introducing the problem model
4.4 Solving the problem
4.4.1 Iterative model of PSO to minimizing the makespan
4.4.2. Steps of PSO to minimizing the makespan
4.5. Experimental results and discussion
4.5.1. Experimental Ⅰ: Arrival Rate
4.5.1. Experimental Ⅱ: Number of Nodes
CONCLUSION AND RECOMMENDATIONS
REFERENCES
ACKNOWLEDGEMENT
APPENDIX A
