EBEnci Bai

Enci Bai

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Enci Bai has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Speeding Up the Schedulability Analysis and Priority Assignment of Sporadic Tasks Under Uniprocessor FPNS

    by Weizhe Zhang, Enci Bai, Jing Li

    Fixed-priority non-preemptive scheduling (FPNS) is widely used in practice because of its simplicity and predictability. This article aims to enhance the efficiency of the schedulability analysis and priority assignment of sporadic tasks under uniprocessor FPNS. To speed-up the schedulability analysis, we first improve the state-of-the-art worst-case response time analysis for uniprocessor fixed-priority non-preemptive scheduling. In addition, we present two special conditions under which the worst-case response time of a task can be analyzed from its first job, which further improves the efficiency of the analysis. To accelerate the priority assignment, we present two priority-assignment algorithms based on the improved Audsley's algorithm: improved Audsley-based longest deadline first (IA-LDF) and improved Audsley-based longest worst-case execution time first (IA-LCF). The numerical experiments show that IA-LDF and IA-LCF can lead to 31.2% and 36% decrease in runtime compared to longest deadline first (LDF) and longest worst-case execution time first (LCF), respectively.


  • Open Access

    Solving Energy-Aware Real-Time Tasks Scheduling Problem with Shuffled Frog Leaping Algorithm on Heterogeneous Platforms

    by Weizhe Zhang, Enci Bai, Hui He, Albert M.K. Cheng

    Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remission and local optimal avoidance techniques are proposed to avoid the precocity and improve the solution quality. Convergence acceleration significantly reduces the search time. Experimental results show that the SFLA-based energy-aware meta-heuristic uses 30% less energy than the Ant Colony Optimization (ACO) algorithm, and 60% less energy than the Genetic Algorithm (GA) algorithm. Remarkably, the running time of the SFLA-based meta-heuristic is 20 and 200 times less than ACO and GA, respectively, for finding the optimal solution.