In recent years, the emergence of technologies such as robotics and ubiquitous computing applications has increased the demand for high-performance and energy-efficient platforms in real-time systems. While RM and EDF are known as optimal scheduling algorithms in single-processor environments, they are not optimal in multiprocessor settings. To address this limitation, algorithms such as EDZL and EDCL have been investigated. However, these algorithms still face challenges such as scheduling overhead, schedulability success rate, and deadline misses. This work proposes two improved algorithms based on EDCL and evaluates their performance through comparative simulations. As a result, the proposed method 2 was able to suppress deadline misses, the proposed method 1 outperformed others in terms of schedulability success rate, the conventional method suppressed the number of context switches, and the proposed method 1 reduced the number of scheduler invocations. Furthermore, schedulability analysis was carried out through response-time analysis.