Hybrid Wireless Network-on-Chip (HWNoC) architecture has been introduced as a promising communication infrastructure for multicore systems. HWNoC-based multicore systems encounter extremely dynamic application workloads that are submitted at run-time. Mapping and scheduling of these applications are critical for system performance, especially for real-time applications. The existing resource allocation approaches either ignore the use of wireless links in task allocation on cores or ignore the timing characteristic of tasks. In this paper, we propose a new deadline-aware and energy-efficient dynamic task mapping and scheduling approach for the HWNoC-based multicore system. By using of core utilization threshold and tasks laxity time, the proposed approach aims to minimize communication energy consumption and satisfy the deadline of the real-time applications tasks. Through cycle-accurate simulation, the performance of the proposed approach has been compared with state-of-the-art approaches in terms of communication energy consumption, deadline violation rate, communication latency, and runtime overhead. The experimental results confirmed that the proposed approach is a very competitive approach among the alternative approaches.
22 October 2020 in International Journal of Information Technology & Decision Making
In Delay Tolerant Networks (DTNs), message forwarding is a challenging open problem because of low node density and lack of global information. Most of the previous forwarding methods select a node as a relay node with the best cumulative and global ability of contacting the destination without considering the maximum message acceptable delivery latency. However, if the network is composed of several communities, the cumulatively and globally calculated forwarding metric (and not in each community) will not have suitable estimation of contact between relay node and destination. Therefore, in this paper, we introduce and evaluate a novel forwarding method, which called Community-based Contact Prediction message forwarding method (CCPMFM). The CCPMFM exploits a semi-Markov process to explain and predict the node mobility between communities. The CCPMFM selects the relay node with regard to the maximum message acceptable delivery latency. To calculate the forwarding metric, CCPMFM considers the contact patterns of each community only for the same community and not for the entire network. CCPMFM also selects the relay node with regard to maximum message acceptable delivery latency. The evaluation results show that this method improves the delivery ratio and reduces the number of message forwardings and delivery latency with respect to prevalent DTNs forwarding methods.