A new approach to the Population-Based Incremental Learning algorithm using virtual regions for task mapping on NoCs

Morales, Luis German Garcia; Cobo, José Edinson Aedo; Bagherzadeh, Nader

doi:10.1016/j.sysarc.2019.01.013

Cited by 3 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [30], a novel technique for task mapping termed Virtual Regions PBIL (VRPBIL-NoC) is introduced, which is based on the PBIL algorithm. This method divides the platform into virtual regions to support the search for high-quality solutions.…”

Section: Related Workmentioning

confidence: 99%

HyDra: Hybrid Task Mapping Application Framework for NOC-Based MPSoCs

et al. 2023

View full text Add to dashboard Cite

Multiprocessor System-On-Chip (MPSoCs) with Networks-on-Chip (NoCs) has been proposed to address the communication challenges in modern dynamic applications. One of the key aspects of design exploration in NoC-based MPSoC is application mapping, which is critical for the parallel execution of multiple applications. However, mapping for dynamic workloads becomes challenging due to the unpredictable arrival times of applications and the availability of resources. In this work, we propose a hybrid task mapping approach, HyDra, that combines design-time mapping and efficient runtime remapping to reduce communication and energy costs. The proposed approach generates multiple application mappings during the design phase by minimizing latency, energy, and communication costs. The diverse mapping possibilities produced at design time consider multiple performance metrics. However, we cannot predict the arrival time of applications and the availability of resources at design time. To further optimize the MPSoC performance, our dynamic mapping phase re-configures the design time mappings based on the runtime availability of resources and applications. The simulation results show that HyDra reduces communication costs by 14% while using 15% less energy for small and large NoCs compared to state-of-the-art task mapping techniques. Furthermore, our approach provides an average of 19% reduction in end-to-end latency for applications. Our hybrid task allocation and scheduling approach effectively addresses communication issues in NoC-based MPSoCs for dynamic workloads. HyDra achieves improved performance by combining design-time and runtime mapping, providing a promising solution for future MPSoC design.INDEX TERMS Hybrid application mapping, multiprocessors, network-on-chip, particle swarm optimization, simulated annealing, task graph for free, directed acyclic graph, dynamic task mapping, design-time mapping, K-means, elbow method.

show abstract

Section: Related Workmentioning

confidence: 99%

HyDra: Hybrid Task Mapping Application Framework for NOC-Based MPSoCs

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Simulation experiments [31] can easily obtain latency and communication costs, but it is difficult to obtain a delay bound. The network calculus fills the gap.…”

Section: Delay Bound Analysis Using Network Calculusmentioning

confidence: 99%

Delay Bound Optimization in NoC Using a Discrete Firefly Algorithm

Tian

et al. 2019

Electronics

View full text Add to dashboard Cite

The delay bound in system on chips (SoC) represents the worst-case traverse time of on-chip communication. In network on chip (NoC)-based SoC, optimizing the delay bound is challenging due to two aspects: (1) the delay bound is hard to obtain by traditional methods such as simulation; (2) the delay bound changes with the different application mappings. In this paper, we propose a delay bound optimization method using discrete firefly optimization algorithms (DBFA). First, we present a formal analytical delay bound model based on network calculus for both unipath and multipath routing in NoCs. We then set every flow in the application as the target flow and calculate the delay bound using the proposed model. Finally, we adopt firefly algorithm (FA) as the optimization method for minimizing the delay bound. We used industry patterns (video object plane decoder (VOPD), multiwindow display (MWD), etc.) to verify the effectiveness of delay bound optimization method. Experiments show that the proposed method is both effective and reliable, with a maximum optimization of 42.86%.

show abstract

“…To do this is necessary to use a technique that allows mapping the task graph of an application within the processing elements attached to the interconnection system of the SoC. Figure 2 shows the result of mapping the task network of an application using two different techniques [42]. The distribution made by each technique can significantly affect the traffic generated in the interconnection system.…”

mentioning

confidence: 99%

A Bandwidth Control Arbitration for SoC Interconnections Performing Applications with Task Dependencies

et al. 2020

View full text Add to dashboard Cite

Current System-on-Chips (SoCs) execute applications with task dependency that compete for shared resources such as buses, memories, and accelerators. In such a structure, the arbitration policy becomes a critical part of the system to guarantee access and bandwidth suitable for the competing applications. Some strategies proposed in the literature to cope with these issues are Round-Robin, Weighted Round-Robin, Lottery, Time Division Access Multiplexing (TDMA), and combinations. However, a fine-grained bandwidth control arbitration policy is missing from the literature. We propose an innovative arbitration policy based on opportunistic access and a supervised utilization of the bus in terms of transmitted flits (transmission units) that settle the access and fine-grained control. In our proposal, every competing element has a budget. Opportunistic access grants the bus to request even if the component has spent all its flits. Supervised debt accounts a record for every transmitted flit when it has no flits to spend. Our proposal applies to interconnection systems such as buses, switches, and routers. The presented approach achieves deadlock-free behavior even with task dependency applications in the scenarios analyzed through cycle-accurate simulation models. The synergy between opportunistic and supervised debt techniques outperforms Lottery, TDMA, and Weighted Round-Robin in terms of bandwidth control in the experimental studies performed.

show abstract

A new approach to the Population-Based Incremental Learning algorithm using virtual regions for task mapping on NoCs

Cited by 3 publications

References 31 publications

HyDra: Hybrid Task Mapping Application Framework for NOC-Based MPSoCs

HyDra: Hybrid Task Mapping Application Framework for NOC-Based MPSoCs

Delay Bound Optimization in NoC Using a Discrete Firefly Algorithm

A Bandwidth Control Arbitration for SoC Interconnections Performing Applications with Task Dependencies

Contact Info

Product

Resources

About