# Review of Task-Scheduling Methods for Heterogeneous Chips
## 2 Overview of Task-Scheduling Method
### Task-Scheduling Method  
The heterogeneous chip task-scheduling method is a set of features of the heterogeneous chip architecture and the design of a task management strategy and algorithm system. It aims to efficiently assign many tasks to chips in different types of computing units and reasonably arrange the task execution order and time in order to realize the optimal utilization of resources and the maximization of system performance. The task-scheduling method can be divided into the scheduling framework and the scheduling algorithm according to the functional level and the division of responsibilities. Among them, the scheduling framework provides the necessary structure and interface for the scheduling algorithm. It defines the basic rules and mechanisms of task management and resource allocation. In contrast, the scheduling algorithm is implemented in this framework to realize the specific allocation and execution of tasks. The task-scheduling framework of heterogeneous chips is used for the overall planning and management of the software architecture system of task allocation and resource application in heterogeneous chips. Relying on various computing units as the core resources, it can accurately and reasonably allocate diversified tasks to the appropriate computing units with its built-in scheduling algorithm mechanism. The core objectives of the framework focus on maximizing resource utilization, significantly improving overall system performance, and effectively reducing in energy consumption [6; 7]. Figure 4 describes the scheduling framework and scheduling algorithm of the heterogeneous chip. As shown in the figure, the scheduling framework, as the key carrier for the effective operation of the scheduling algorithm, provides functional support for the smooth operation of the algorithm, including the task model and system model, to ensure the scheduling algorithm obtains an appropriate task list [8]. Task-scheduling algorithms are key techniques in heterogeneous chip systems that determine how to allocate and perform various computational tasks efficiently. The main goal of task-scheduling algorithms is to optimize the allocation of tasks between different computing resources to improve the overall performance and resource utilization of the system while reducing energy consumption [9]. Scheduling algorithms guide the framework on rationally assigning tasks to various computing units of heterogeneous chips through specific computation and decision rules. The heterogeneous task-scheduling method is an NP-hard problem called [10]. Figure 3: The framework of a heterogeneous chip. General task-scheduling methods are usually based on homogeneous computational resource assumptions, focusing on task execution order and resource allocation to optimize overall performance metrics. The heterogeneous chip integrates multiple types of processors, computing units of different architectures, and various storage hierarchies, and the task-scheduling method must consider the hardware heterogeneity deeply. In the task allocation stage, it is necessary to match the appropriate processor type according to the task calculation requirements and the data access mode and give full play to the advantages of different hardware resources. At the same time, heterogeneous chip task-scheduling must also deal with the complex inter-task communication overhead because the data transmission speed and delay between different processors vary greatly, and the task location and execution order need to be reasonably arranged to reduce the communication cost. The management of task synchronization and dependency is also more complex as we must ensure that tasks are performed correctly and orderly in a heterogeneous environment to avoid deadlock or performance bottlenecks caused by resource competition or communication delays.