Abstract:This paper introduces a novel heuristic algorithm with linear computational complexity for multiprocessor systems. It provides suboptimal solutions for dynamic real-time systems by parallelization of tasks. The performance of scheduling algorithms for multiprocessor platforms is compared by a large quantity of scheduable task sets. Experiments show that the new scheduling scheduling algorithm has a higher success ratio and is appropriate for dynamic real-time systems without a complete prior knowledge of task parameters.