Open AccessJournal Article
A Real-Time Task Scheduling Algorithm for Dynamic Reconfigurable Systems
1
TL;DR: This paper presents a scheduling algorithm MSSA (minimun space scheduling algorithm) based on the minimum space between the hardware tasks of the vertex list which obtains the place position and the start time of the greatest value of the cost function and enables the task scheduling even more compact.
read more
Abstract: Soft real-time scheduling of the hardware tasks is one of the key factors which affect the performance of dynamic reconfigurable systemsThis paper presents a scheduling algorithm MSSA(minimun space scheduling algorithm) based on the minimum space between the hardware tasks of the vertex listThe algorithm constitutes a three-dimensional resources model according to the length,width and the activation time to reach the adjacent degree of the task and the task placed in the three-dimensional space to construct the cost function,which obtains the place position and the start time of the greatest value of the cost function and enables the task scheduling even more compact,reducing the waste of the system resources to improve the degree of parallelismThe simulation results show that this algorithm has a higher chip utilization and acceptance rate of tasks compared with the MSG-4V algorithm and the Stuffing algorithm
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Research on Real-Time Task Scheduling Algorithm for Hybrid Reconfigurable System
TL;DR: This paper presents a VLSCA algorithm which considers the placement according to the vertex position of hardware task and the adjacent units numbers of temporal dimension, which makes the task more compacter, reduce the waste of system resources and promote management efficiency.
4
References
Research on Real-Time Task Scheduling Algorithm for Hybrid Reconfigurable System
TL;DR: This paper presents a VLSCA algorithm which considers the placement according to the vertex position of hardware task and the adjacent units numbers of temporal dimension, which makes the task more compacter, reduce the waste of system resources and promote management efficiency.
4