Task Scheduling and Resource Management for Multi-DAG Systems

1. Critical Path Algorithm: This approach identifies the critical path of each DAG and prioritizes the scheduling of nodes along this path to minimize the overall execution time.
2. Execution Group Algorithm: Here, the algorithm calculates the maximum number of accesses required for each resource and forms execution groups based on these accesses. Nodes sharing a resource are grouped together, and each execution group is scheduled on a dedicated core.
3. Heterogeneous Algorithm: This method divides the nodes into two distinct categories, A and B, and assigns a dedicated set of cores to each group for scheduling, optimizing resource usage and balancing workloads. Our ongoing work aims to analyze and compare the performance of these algorithms in terms of resource utilization, task completion time, and system throughput. The results will provide insights into the trade-offs between the algorithms and their effectiveness in multi-core realtime systems with shared global resources.