In recent years, Network-on-Chip (NoC) based multicore systems have become popular for executing real-time applications. Mapping and scheduling of these applications are critical for system performance. The complexity of the problem increases for dynamic scenarios with real-time applications where new applications unknown at design-time, are submitted by users at runtime. Most of the existing works in this domain either ignore the allocation of communication workload or use estimated network contention while neglecting the impact on timing performance of tasks. In this work, we present an improved algorithm for dynamic task assignment and scheduling with link contention-awareness, which jointly allocates the tasks on the processors of NoC based multicore platform and schedules the communications on on-chip links. It minimizes communication latency and helps to satisfy the deadline of the tasks present in the allocated real-time applications. Experimental results show that the proposed approach achieves 25.3% and 45.6% improvement in task deadline satisfaction and communication latency compared to recent dynamic task allocation approaches while exhibiting 31.2% reduced runtime overhead.

近年来，基于片上网络（NoC）的多核系统已广泛用于执行实时应用程序。这些应用程序的映射和调度对于系统性能至关重要。对于具有实时应用程序的动态方案，问题的复杂性会增加，其中在设计时未知的新应用程序是由用户在运行时提交的。该领域中的大多数现有工作要么忽略了通信工作量的分配，要么使用估计的网络争用，而忽略了对任务计时性能的影响。在这项工作中，我们提出了一种具有链接竞争意识的动态任务分配和调度算法，该算法可以在基于NoC的多核平台的处理器上共同分配任务，并在片上链路上调度通信。它最大程度地减少了通信延迟，并有助于满足分配的实时应用程序中存在的任务的期限。实验结果表明，与最新的动态任务分配方法相比，该方法在任务截止日期满意度和通信延迟方面分别提高了25.3％和45.6％，同时减少了31.2％的运行时开销。