Skip to Main Content
This paper proposes a multiple task allocationmethod for networks-on-chip (NoC) architecture. The proposedmethod generates two integer linear programming models formultiple task allocation under the total memory size and availableI/O ports. The former model realizes multiple task allocation forNoC nodes to minimize the communication cost. The number ofcopies for each task is given as a constraint. This model is usefulto realize dual or triple execution of tasks for fault tolerance. On the other hand, the latter realizes multiple task allocationfor NoC nodes to maximize the number of executable failurepatterns with the minimization of the communication cost. Anexecutable failure pattern means a combination of failed NoCnodes such that a given application is executed correctly usingsurvived NoC nodes only. This model is useful to maximize faulttolerance even though the memory space is restricted. In theexperiments, for several benchmarks, this paper evaluates theproposed method in terms of the allocation time for both modelsand the number of executable failure patterns for the latter modelwhile changing the size of NoC model.