Datapath Configuration Research Articles

Is Bare-metal I/O Performance with User-defined Storage Drives Inside VMs Possible? Benchmarking libvfio-user vs. Common Storage Virtualization Configurations

It is a critical concern for cloud computing providers to identify and adopt optimal virtual machine (VM) I/O storage paths. In Linux, these involve NVMe hardware, PCIe passthrough with vfio, and userspace drivers (e.g. SPDK). One project tying together these host-side improvements with the guests is vfio-user, a library and protocol for inter-process communication of I/O operations over sockets. QEMU/KVM VMs using vfio-user and SPDK are theoretically expected to attain low latencies due to mostly userspace processing, but this VM datapath configuration is still experimental and performance data is lacking in the literature.

ANALISIS KINERJA JARINGAN INTERNET FT-UNIMED DENGAN PROTOCOL ROUTING OPEN SHOTEST PATH FIRST (OSPF) DAN BORDER GATEWAY PROTOCOL (BGP)

The use of the internet network during the Corona Virus pandemic known as COVID-19 increased rapidly because learning had to be done online, one of which was experienced at Fakultas Teknik, Universitas Negeri Medan. Some network disturbances often occur because of the large data transmission requests from the data center. This problem occurs because the network being used is still using a static routing protocol where the data path configuration must be updated manually by the operator. The solution to this problem is proposed to change the routing protocol from static routing to dynamic routing. The proposed dynamic routing protocols are open shortest path first (OSPF) and border gateway protocol (BGP). The choice of these two types of protocols is because they have better performance and can be implemented on any type of hardware. In this article, we will discuss the analysis of the implementation of the OSPF and BGP protocols with simulations carried out using packet tracer software. The results obtained from the simulation are analyzed and it is known that the OSPF protocol has better performance than the previous protocol, namely static routing and BGP protocol. Based on the criteria of throughput, packet loss, delay and jitter, it is known that the OSPF protocol has better performance on throughput, delay and jitter.Keywords : Static routing, dynamic routing, OSPF, BGP

Exploring the Tradeoffs of Application-Specific Processing

Non-traditional processing schemes continue to grow in popularity as a means to achieve high performance with greater energy-efficiency. Data-centric processing is one such scheme that targets functional-specialization and memory bandwidth limitations, opening up small processors to wide memory IO. These functional-specific accelerators prove to be an essential component to achieve energy-efficiency and performance, but purely application-specific integrated circuit accelerators have expensive design overheads with limited reusability. We propose an architecture that combines existing processing schemes utilizing CGRAs for dynamic data path configuration as a means to add flexibility and reusability to data-centric acceleration. While flexibility adds a large energy overhead, performance can be regained through intelligent mappings to the CGRA for the functions of interest, while reusability can be gained through incrementally adding general purpose functionality to the processing elements. Building upon previous work accelerating sparse encoded neural networks, we present a CGRA architecture for mapping functional accelerators operating at 500 MHz in 32 nm. This architecture achieves a latency-per-function within $2{\times}$ of its function-specific counterparts with energy-per-operation increases between 21–188 $\times$ , and energy-per-area increases between 1.8–3.6 $\times$ .

Performance Scalability of Adaptive Processor Architecture

In this article, we evaluate the performance scalability of architectures called adaptive processors, which dynamically configure an application-specific pipelined datapath and perform a data-flow streaming execution. Previous works have examined the basics of the following: (1) a computational model that supports the swap-in/out of a partial datapath—namely, a virtual hardware is realized by hardware, without a host processor and its software; (2) an architecture that has shown a minimum pipeline requirement and a minimum component requirement; and (3) the characteristics of the execution phase and a stack shift that realizes the swap-in/out. However, these works did not explore the design space, particularly with respect to the following: (1) the clock cycle time on the adaptive processor, which must depend on a wire delay that is primarily used for the global communication of requests, acknowledgments, acquirements, releases, and so forth, and (2) a revised control system that can handle the out-of-order acknowledgment and in-order acquirement that guarantee the correct datapath configuration with a conditional branch for the configurations. This article explores the scaling of the ALU resources versus pipelining of the wires.

Exploration of k c ‐cycle transient fault‐secured datapath and loop unrolling factor for control data flow graphs during high‐level synthesis

Simultaneous design space exploration (DSE) of k c-cycle transient fault-secured datapath and loop unrolling factor (UF) for control data flow graphs (CDFGs) during high-level synthesis is an unsolved problem in the literature. The aforementioned problems are solved with the following specific contributions: (i) a novel DSE methodology that explores an optimal combination of transient fault-secured datapath configuration and loop UF using particle swarm optimisation for CDFG, and (ii) the novel k c-cycle fault secured algorithm. Finally, the proposed approach when tested on standard benchmarks yielded an optimal solution which minimises the fitness function and satisfies user constraints, as well as achieving significantly reduced cost of the final solution when compared with a recent fault-secured approach.