Paper
A Data Mining Grid Scheduling Model based on Colored-hierarchy Petri Net
- Authors:
- Zhang Hui
- Abstract
- Dynamics and granularity in data mining grid scheduling (DMGS) are greatly influenced by resources. DMGS is defined as a workflow, combined with colored-hierarchy Petri Nets (CHPN) structure of the scheduling variable scheduling algorithm, which contains the scheduling problem into job scheduling layer, sub-job scheduling layer, task scheduling layer and sub-task scheduling layer. Within the four layers, job scheduling will be decomposed from top to bottom. Each layer is based on Petri net state transfer. The results show that HCPN can be effective in DMGS.
- Keywords
- Colored-hierarchy; Petri Net; Data Mining Grid; Scheduling
- StartPage
- 64
- EndPage
- 69
- Doi