A multi-thread dynamic grading and grouping concurrent scheduling algorithm

In this paper, a high efficient dynamic scheduling algorithm is developed to schedule a set of multi-thread on realtime multiprocessor systems. The algorithm divides two grades schedule. The one-grade-schedule inserts the new thread into thread-queue of thread-queue matrix according to the restriction rules and insertion rules, the two-grade-schedule places some threads chose from thread matrix into two-grade-windows, and then assigns multiple threads of two-grade-windows to processors concurrently reasonably. It has proved that this algorithm has higher efficiency and good effect in same structure multiprocessing system for multi-thread concurrent scheduling.