Resource management scheme by Petri nets for multiprocessors

Petri net is one of the best expressions to describe parallel tasks, and can check many conditions quickly because all transitions can be checked at the same time. This paper proposes a resource management scheme for multiprocessors by the high-speed condition check in Petri nets. The system consists of a host processing unit, work processing units (PUs), memory units (MUs), cross-bar switch and dispatch unit. Dispatch unit manages PUs and MUs and dispatches tasks quickly. We examined the resource management scheme by simulations. In calculation of LU decompositions on a distributed memory multiprocessor, we confirmed that the efficiency of processor usage is increased. The execution time is two times faster than static assignments