Scheduling Analysis and correction for Multiprocessor Real-Time Systems Based on Multi-Agent Systems

摘要

The Partitioned multiprocessor scheduling is the most used in practice for multiprocessor Real-Time Systems (RTS). Its complexity is known as NP-Hard and it is very time consuming to find a schedulable partition. Hence, the only existing solution to correct a non-schedulable partition is the regeneration of a new one. The present paper presents a new approach for scheduling analysis and correction in the aim of accelerating the process of finding a schedulable solution. In fact, we have used the multi-agent systems and the contract net protocol for modeling a net of cooperating processors able to correct, if possible, a non-schedulable solution without regeneration.