Abstract

ABSTRACT A scheduling algorithm is crucial for running a simulation model so that tasks can be performed efficiently.The traditionally used blade-based parallel engine system cannot be adapted to a new simulation model. This study proposed a combined dynamic priority and static method, that is, a hybrid load-balancing scheduling (HLB) algorithm. The algorithm is given priority according to the operating cycle of the model and system steps. The experimental results demonstrated that the algorithm outperformed the earliest deadline first and the time-stepped load-balancing scheduling algorithms. The results also demonstrated that the HLBhad a higher real-time operating efficiency than the other algorithms under a lower overhead guarantee. The HLB algorithm causedbetter performance while maintaining computation and communication efficiency. Simultaneously, the utilisation rate of the central processing unit was around 35%.The further study should be enhanced to generalise it so that it could be applied to incorporate load balancing.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call