Optimering av multiprocessorsystem med hjälp av schemaläggning

A well known optimization-problem of multiprocessor system is scheduling of tasks. In this paper I use a variant of previous known algoritm, (Fast Critical Path) for scheduling real-time tasks on a multiprocessor system. This is made in a simulation study in MATLAB. The system architecture is assumed to be a MIMD- machine, (Multiple Instruction stream Multiple Data stream) with bus-typologi and message-architecture. Scheduling was made on this system where the number of processors varying from five to ten. The communication demands and precedence constraint of the task set was represented by a directed acyclic task graph. I scheduled three different task graphs where the number of task was ten, twenty and thirty, and the objective of the algoritm was to minimize the response time. Scheduling with the two bigger task sets generated a few failure-schedules, while scheduling with the smallest task set, never failed. (A schedule with response time longer than a predefined deadline, is a failure).