Online allocation for contention-free-routing NoCs

Stefan, Radu; Nejad, Ashkan Beyranvand; Goossens, Kees

doi:10.1145/2107763.2107767

Cited by 27 publications

(35 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The dynamic connection allocation techniques can be divided into two categories: i) centralized [6]- [10] and ii) distributed allocation [3], [11], [12]. The centralized allocation is done by a central module.…”

Section: Background and Related Workmentioning

confidence: 99%

Centralized parallel multi-path multi-slot allocation approach for TDM NoCs

Chen

Matúš

Fettweis

2016

2016 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)

View full text Add to dashboard Cite

The TDM-based NoC is an attractive technique for providing QoS in on-chip communication. However, fast, dynamic and robust path and slot allocation is still a challenging task particularly for networks with high connection request rates. A centralized resource allocation approach is presented in this paper, which enables multipath multislot allocation in parallelism at run-time. With full structured trellis graph that contains the full length stages, the allocation speed is ensured to be very fast. In contrast to previous works, the proposed method features:(1) high allocation speed requiring only two cycles for path searching; (2) improved success rate due to parallel multi-path search.Experimental results on real hardware models demonstrate two orders of magnitude improvement in allocation speed and ten times higher success rate against previous centralized solutions.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Centralized parallel multi-path multi-slot allocation approach for TDM NoCs

Chen

Matúš

Fettweis

2016

2016 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)

View full text Add to dashboard Cite

show abstract

“…In the considered hardware platform, other than the NoC, every other resource takes a short time(few hundred cycles) for reservation and allocation. For the NoC, we employ an online allocation algorithm presented in [22]. The worst case time for finding an allocation in a 4 × 4 mesh is 6394 cycles as reported in [22].…”

Section: A Experimental Setupmentioning

confidence: 99%

“…For the NoC, we employ an online allocation algorithm presented in [22]. The worst case time for finding an allocation in a 4 × 4 mesh is 6394 cycles as reported in [22]. The NoC in the considered platform is 2 × 1 mesh with even smaller allocation time.…”

Section: A Experimental Setupmentioning

confidence: 99%

Composable and Predictable Dynamic Loading for Time-Critical Partitioned Systems

Sinha

Koedam

Wijk

et al. 2014

2014 17th Euromicro Conference on Digital System Design

Self Cite

View full text Add to dashboard Cite

Abstract-In time-critical systems such as in avionics, for safety and timing guarantees, applications are isolated from each other. Resources are partitioned in time and space creating a partition per application. Such isolation allows fault containment and independent development, testing and verification of applications. Current partitioned systems do not allow dynamically adding applications. Applications are statically loaded in their respective partitions. However dynamic loading can be useful or even necessary for scenarios such as on-board software updates, dynamic reconfiguration or re-loading applications in case of a fault. In this paper we propose a software architecture to dynamically create and manage partitions and a method for composable dynamic loading which ensures that loading applications do not affect the running applications and vice versa. Furthermore the loading time is also predictable i.e. the loading time can be bounded a priori. We achieve this by splitting the loading process into parts, wherein only a small part which reserves minimum required resources is executed in the system partition and the other parts are executed in the allocated application partition which ensures isolation from other applications. We implement the software architecture for a SoC prototype on an FPGA board and demonstrate its composability and predictability properties. I. INTRODUCTIONTime-critical systems such as in the avionics domain have strict safety, real-time and fault tolerance constraints. To ensure these constraints and for fault-containment, applications are isolated from each other at the cycle-level. That is applications cannot affect each other even by a single cycle. With temporal and spatial partitioning, faults in an application cannot affect the rest of the system and applications can be developed, tested and verified independently. Without isolation, each small change to an application, requires the system and all applications to be re-verified. Allocating dedicated hardware to achieve isolation has disadvantages of increased cost and weight, therefore integrated architectures with shared resources are proposed in avionics with Integrated Modular Avionics (IMA) [1]. In IMA, resources are partitioned in time and space to create logical containers for each application. For commercial deployment, avionics industry has standardized partitioning with the ARINC 653 API [2] and AIR (ARINC in Space RTOS) [3] standards.The aforementioned partitioned systems are static systems, wherein all applications are integrated at design-time. In standards such as ARINC653 and AIR, applications are statically loaded in their respective partitions and the system iterates through a static Time Division Multiplexed (TDM) schedule at run time [4]. They do not cope with dynamic aspects such as adding new applications at run-time or on-board application software updates or dynamic reconfiguration in case of a fault.Consider the example of a spacecraft. The operation plan of a spacecraft can be changed to deal with u...

show abstract

“…The schedule which guarantees contention-free routing for an application is typically computed at design time, although computation at run-time is also possible [22], [30].…”

Section: Background: Contention-free Routingmentioning

confidence: 99%

A TDM NoC supporting QoS, multicast, and fast connection set-up

Stefan

Molnos

Ambrose

et al. 2012

2012 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE)

View full text Add to dashboard Cite

Abstract-Networks-on-Chip are seen as promising interconnect solutions, offering the advantages of scalability and high frequency operation which the traditional bus interconnects lack. Several NoC implementations have been presented in the literature, some of them having mature tool-flows and ecosystems. The main differentiating factor between the various implementations are the services and communication patters they offer to the enduser. In this paper we present dAElite, a TDM Network-on-Chip that offers a unique combinations of features, namely guaranteed bandwidth and latency per connection, built-in support for multicast, and a short connection set-up time. While our NoC was designed from the ground up, we leverage on existing tools for network dimensioning, analysis and instantiation. We have implemented and tested our proposal in hardware and we found it to compare favorably to the other NoCs in terms of hardware area. Compared with aelite, which is closest in terms of offered services our network offers connection set-up times faster by a factor of 10 network, traversal latencies decreased by 33%, and improved bandwidth.

show abstract

Online allocation for contention-free-routing NoCs

Cited by 27 publications

References 11 publications

Centralized parallel multi-path multi-slot allocation approach for TDM NoCs

Centralized parallel multi-path multi-slot allocation approach for TDM NoCs

Composable and Predictable Dynamic Loading for Time-Critical Partitioned Systems

A TDM NoC supporting QoS, multicast, and fast connection set-up

Contact Info

Product

Resources

About