Parallel Application Scheduling Model Based on Petri Net with Changeable Structure
Citations Over Time
Abstract
This paper proposes two different models for the scheduling net and the job net based on the idea that the scheduling net is separated from the job net. This method makes models compact and intuitional. In addition, the separation benefits the analysis of the job net and the scheduling net respectively. According to the granularity of parallel applications, the scheduling net is designed to four levels, which is convenient to deploy distributed schedulers in parallel environment and is beneficial to the management of different parallel application granularities. Based on Petri Net with changeable structure, the job net model can change its structure dynamically according to the allocation results or states of jobs. Therefore, the model supports dynamic mergence and division of subtasks and can deal with the abnormity of subtasks. We validate the scheduling net and the job net using
Related Papers
- Timed Petri Nets: Theory and Application(1998)
- → An Editing and Checking Tool for Stochastic Petri Nets(1992)
- An application for the control of stochastic petri nets via fluidification approach(2012)
- From Fluid Stochastic Petri Nets to First-order Hybrid Petri Nets(2008)