AROMa: Aging-Aware Deadlock-Free Adaptive Routing Algorithm and Online Monitoring in 3D NoCs

Ghaderi, Zana; Alqahtani, Ayed; Bagherzadeh, Nader

doi:10.1109/tpds.2017.2780173

Cited by 11 publications

(10 citation statements)

References 62 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Suppose the reference trajectory is ŻR = f (z R , u R ). The reference trajectory is given by (1). Given the vehicle model in (24), we firstly linearize the system at certain point using Jacobi matrix:…”

Section: Hdv Model By Extended Kalman Filteringmentioning

confidence: 99%

See 1 more Smart Citation

Deadlock detection, cooperative avoidance and recovery protocol for mixed autonomous vehicles in unstructured environment

Song

Huang

et al. 2023

IET Intelligent Trans Sys

View full text Add to dashboard Cite

Deadlock is an extreme traffic flow operational state during rush hours. Many literatures have studied autonomous vehicle coordination under the umbrella of deadlock‐free conditions. These researches either assume the trajectories are fixed or state spaces are discrete and limited on structured road spaces or don't consider the influence of human‐driven vehicles (HDV), which are not controllable from the system's viewpoint. This manuscript relaxes the above limitations and proposes a method to detect, avoid, and recover from deadlock for mixed autonomous vehicles flow. Firstly, two types of deadlocks, weak and strong , are defined based on deadlock properties. Next, two detection algorithms based on evasion distance propagation are proposed. After that, we present a cooperative control method to avoid deadlock based on chain‐spillover‐free and loop‐free strategies. If a deadlock has already happened, cooperative protocols based on re‐routing and backward‐forward strategies are designed. The proposed model is tested in Carla. The results show that the deadlocks can be detected 13 seconds earlier than their occurrence, and it takes about 6 seconds to unlock the existing deadlock. The results also show that with the proposed deadlock avoidance algorithm, the traffic throughput can be increased by 35.7%, and with the proposed deadlock recovery protocol, the traffic throughput can be increased by another 18%.

show abstract

Section: Hdv Model By Extended Kalman Filteringmentioning

confidence: 99%

“…The three sequences are the optimization results based on certain unlock strategies, or generated from the deadlock detection process, if no deadlock is reported. A video that presents one real-world case of unlocking sequence can be found in github 1 . Below we present two strategies: re-route and backward-forward.…”

Section: Cooperative Recovery Protocolmentioning

confidence: 99%

Deadlock detection, cooperative avoidance and recovery protocol for mixed autonomous vehicles in unstructured environment

Song

Huang

et al. 2023

IET Intelligent Trans Sys

View full text Add to dashboard Cite

show abstract

“…The lack of deadlock literature brings room for further research. Actually deadlock, as a phenomenon exists, not only in transportation, but is found in many fields, such as software or hardware development [8], manufacturing systems [9,10], distributed systems [11], robots and automated guided vehicles [12,13], queuing networks [14], and more. The necessary conditions for such types of deadlock are summarized with four components [15,16]: (1) mutual exclusion: the resource cannot be occupied simultaneously by several tasks; (2) no pre-emption: resources cannot be removed until they have been used to completion; (3) hold and wait: tasks do not release resources while waiting for other resources; (4) circular wait: a circular chain of tasks exists, where each task requests a resource from another task in the chain.…”

Section: Literature Reviewmentioning

confidence: 99%

Intersection traffic deadlock formation and its probability: A petri net‐based modeling approach

Tang

et al. 2022

IET Intelligent Trans Sys

View full text Add to dashboard Cite

Although traffic deadlock at an intersection is a common phenomenon during rush hours, the deadlock formation metrics such as formation probability and duration have not been derived yet. As Petri Net (PN)‐based approach can formulate the deadlock formation in analytical form and has been applied in numerous traffic flow studies, the PN is employed to investigate the deadlock formation probability and duration. First, each of the four main components of an intersection is formulated, namely vehicle trajectory, traffic signal, vehicle arrivals, and conflict behaviour, as a Petri Net (or IntersectionPN), and name them CellularPN, TrafficLightPN, DemandPN, and ConflictPN, respectively. Together, the entire intersection becomes an IntersectionPN, on which the system's three classes of states are defined, namely the deadlock state, the trap state, and the live state. The deadlock occurrence is formulated as an integer programming problem, while the formation probability and duration are studied by constructing a reachability graph that leads to the Markov chain of the system. A case study shows that the developed model is able to reproduce an intersection deadlock, and that the focus is on two priority behaviours: “First Enter First Serve” and “Pure Stochastic”. The results show that different behaviours lead to different deadlock formation metrics and that, when the saturation flow rate degrades (due to events such as severe weather conditions), a deadlock will occur more quickly. The research results provide the analysis tool for probabilistic deadlock formation. It can also be applied to the intersection deadlock prevention and control.

show abstract

“…NoC also enhances performance in the form of throughput, latency and scalability compared to traditional interconnection architectures. However, thermal aggravation [2], transient and permanent defects [3], aging [4], high power density [5], and congestion [6] are some of the variables that contribute to NoC performance deterioration.…”

Section: Introductionmentioning

confidence: 99%

Interval Based Transaction Record Keeping Mechanism for Adaptive 3D Network-on-Chip Routing

2022

IJIES

View full text Add to dashboard Cite

Due to technology scaling, network-on-chip (NoC) become the viable solution for on-chip many-core systems. The most critical concern of NoC is congestion management caused due to heavy communication traffic between nodes. Without an appropriate congestion resolution strategy for reducing heavy in-network traffic, the efficiency of the entire network is damaged severely. In this paper, an interval based record-keeping mechanism is presented to reduce network traffic and congestion by maintaining a history table and previous packet transaction records at each node. Proposed method performs certain validity checks before allowing using previous transaction record from history table. The performance of the technique is investigated in terms of average delay and compared to the state-of-the-art routing algorithms using the Access Noxim simulator. The simulation results demonstrate that the proposed method has outperformed in terms of global average delay, with 8-12% improvement, the average number of hits is 26-61% greater than misses under different synthetic traffic. The proposed algorithm has been tested under various topological configurations for efficiency evaluations.

show abstract

AROMa: Aging-Aware Deadlock-Free Adaptive Routing Algorithm and Online Monitoring in 3D NoCs

Cited by 11 publications

References 62 publications

Deadlock detection, cooperative avoidance and recovery protocol for mixed autonomous vehicles in unstructured environment

Deadlock detection, cooperative avoidance and recovery protocol for mixed autonomous vehicles in unstructured environment

Intersection traffic deadlock formation and its probability: A petri net‐based modeling approach

Interval Based Transaction Record Keeping Mechanism for Adaptive 3D Network-on-Chip Routing

Contact Info

Product

Resources

About