Formal Verification of the Processor Pre-Allocation Algorithm for Multiprocessor Scheduling

Provided by: Binary Information Press
Topic: Hardware
Format: PDF
In multiprocessor systems, several processors may deal with a task at the same or different time, so traditional test methods are hardly used to validate multiprocessor scheduling algorithms. In this paper, a lattice-valued Finite Automaton (l-FA) is proposed to verify the processor pre-allocation algorithm for multiprocessor scheduling. Firstly, an l-FA is used to represent the computations of the tasks allocated to the same processor and the product of l-FA is employed to represent the computations of all tasks in the multi-process system.

Find By Topic