scholarly journals Sw/Hw Partitioning and Scheduling on Region-Based Dynamic Partial Reconfigurable System-on-Chip

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1362 ◽  
Author(s):  
Qi Tang ◽  
Biao Guo ◽  
Zhe Wang

A heterogeneous system-on-chip (SoC) integrates multiple types of processors on the same chip. It has great advantages in many aspects, such as processing capacity, size, weight, cost, power, and energy consumption, which result in it being widely adopted in many fields. The SoC based on region-based dynamic partial reconfigurable (DPR) FPGA plays an important role in the SoC field. However, delivering its powerful capacity to the consumer depends on the efficient Sw/Hw partitioning and scheduling technology that determines the resource volume of the DPR region, the mapping of the application to the DPR region and other processors, and the schedule of the task and its reconfiguration. This paper first proposes an exact approach based on the mixed integer linear programming (MILP) for the Sw/Hw partitioning and scheduling problem. The proposed MILP is able to solve the problem optimally; however, its scalability is poor, despite that we carefully designed its formulation and tried to make it as concise as possible. Therefore, a multi-step hybrid method that combines graph partitioning and MILP is proposed, which is able to reduce the time complexity significantly with the solution quality being degraded marginally. A set of experiments is carried out using a set of real-life applications, and the result demonstrates the effectiveness of the proposed methods.

2021 ◽  
pp. 1-12
Author(s):  
Arun Prasath Raveendran ◽  
Jafar A. Alzubi ◽  
Ramesh Sekaran ◽  
Manikandan Ramachandran

This Ensuing generation of FPGA circuit tolerates the combination of lot of hard and soft cores as well as devoted accelerators on a chip. The Heterogene Multi-Processor System-on-Chip (Ht-MPSoC) architecture accomplishes the requirement of modern applications. A compound System on Chip (SoC) system designed for single FPGA chip, and that considered for the performance/power consumption ratio. In the existing method, a FPGA based Mixed Integer Programming (MIP) model used to define the Ht-MPSoC configuration by taking into consideration the sharing hardware accelerator between the cores. However, here, the sharing method differs from one processor to another based on FPGA architecture. Hence, high number of hardware resources on a single FPGA chip with low latency and power targeted. For this reason, a fuzzy based MIP and Graph theory based Traffic Estimator (GTE) are proposed system used to define New asymmetric multiprocessor heterogene framework on microprocessor (AHt-MPSoC) architecture. The bandwidths, energy consumption, wait and transmission range are better accomplished in this suggested technique than the standard technique and it is also implemented with a multi-task framework. The new Fuzzy control-based AHt-MPSoC analysis proves significant improvement of 14.7 percent in available bandwidth and 89.8 percent of energy minimized to various traffic scenarios as compared to conventional method.


2018 ◽  
Vol 30 (4) ◽  
pp. 367-386 ◽  
Author(s):  
Liyang Xiao ◽  
Mahjoub Dridi ◽  
Amir Hajjam El Hassani ◽  
Wanlong Lin ◽  
Hongying Fei

Abstract In this study, we aim to minimize the total waiting time between successive treatments for inpatients in rehabilitation hospitals (departments) during a working day. Firstly, the daily treatment scheduling problem is formulated as a mixed-integer linear programming model, taking into consideration real-life requirements, and is solved by Gurobi, a commercial solver. Then, an improved cuckoo search algorithm is developed to obtain good quality solutions quickly for large-sized problems. Our methods are demonstrated with data collected from a medium-sized rehabilitation hospital in China. The numerical results indicate that the improved cuckoo search algorithm outperforms the real schedules applied in the targeted hospital with regard to the total waiting time of inpatients. Gurobi can construct schedules without waits for all the tested dataset though its efficiency is quite low. Three sets of numerical experiments are executed to compare the improved cuckoo search algorithm with Gurobi in terms of solution quality, effectiveness and capability to solve large instances.


Sign in / Sign up

Export Citation Format

Share Document