Download now Free registration required
Task scheduling algorithms are key techniques in task management system of computing grid. Because of the uncertainty nature of a grid, traditional task scheduling algorithms do not work well in an open, heterogeneous and dynamic grid environment of real world. In this paper, Set Pair Analysis (SPA), a new soft computation method is used to process the synthetic uncertainty in the task scheduling of a computing grid. After introducing SPA and its application, the paper goes on to introduce the definition of connection number to express the uncertain Expected Time to Compute of tasks, analysis operation properties and linear order relation suitable for computing grid scheduling.
- Format: PDF
- Size: 669.15 KB