Biao Hu

Mr. Biao Hu


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2018 in Real-Time Systems
Verified
Journal Article
Closed access
PDF file
BHBiao Hu
Biao Hu
LTLothar Thiele
Lothar Thiele
PHPengcheng Huang
Pengcheng Huang
KHKai Huang
Kai Huang
CGChristoph Griesbeck
Christoph Griesbeck
AKAlois Knoll
Alois Knoll

13 October 2016 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
BHBiao Hu
Biao Hu
KHKai Huang
Kai Huang
GCGang Chen
Gang Chen
LCLong Cheng
Long Cheng
AKAlois Knoll
Alois Knoll
Due to the efficient resource usage of integrating tasks with different criticality onto a shared platform, the integration with mixed-criticality tasks is becoming an increasingly important trend in the design of real-time systems. One challenge in such a mixed-criticality system is to maximize the service for low-critical tasks, while meeting the timing constraints of high-critical tasks. In this article, we investigate how to adaptively manage the low-critical workload during runtime to meet both goals, that is, providing the service for low-critical tasks as much as possible and guaranteeing the hard real-time requirements for high-critical tasks. Unlike previous methods, which enforce an offline bound towards the low-critical workload, runtime adaptation approaches are proposed in which the incoming workload of low-critical tasks is adaptively regulated by considering the actual demand of high-critical tasks. This actual demand of the high-critical tasks, in turn, is adaptively updated using their historical arrival information. Based on this adaptation scheme, two scheduling policies—the priority-adjustment policy and the workload-shaping policy—are proposed to do the workload management. In order to reduce online management overhead, a lightweight scheme with O ( n · log ( n )) complexity is developed. Extensive simulation results are presented to demonstrate the effectiveness of our proposed workload management approaches.

7 August 2018 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
LCLong Chen
Long Chen
MCMingyue Cui
Mingyue Cui
FZFeihu Zhang
Feihu Zhang
BHBiao Hu
Biao Hu
KHKai Huang
Kai Huang
Scene flow is an essential part of stereo-based perception system for autonomous driving and mobile robotics. As in most of these platforms, the computing resource is limited but the computing requirement is high, embedded and parallelized algorithms are of vital importance for real-time tasks. This paper develops a cross-platform embedded scene flow algorithm by using an OpenCL (Open Computing Language) programming. Meanwhile, we propose a method to achieve a good performance by using a novel coarse-grained software pipeline for the embedded stream application. Experimental results show that the proposed algorithm can boost the average processing speed to 50 fps for different commercial-off-the-shelf (COTS) hardware, including desktop GPUs, FPGAs and mobile phone platforms. For certain GPUs the peak frame rates can also reach 1000 fps. By comparing the efficiency among the serial platform, we illustrate that with the help of OpenCL programming, COTS platforms can provide enough computing resources for the stereobased perception algorithm.

4 October 2017 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
KHKai Huang
Kai Huang
BHBiao Hu
Biao Hu
LCLong Chen
Long Chen
AKAlois Christian Knoll
Alois Christian Knoll
ZWZhihua Wang
Zhihua Wang
The concept of autonomous cars is driving a boost for car electronics and the size of automotive electronics market is foreseen to double by 2025. How to benefit from this boost is an interesting question. This article presents a case study to test the feasibility of using OpenCL as the programming language and COTS components as the underlying computing platforms for ADAS development. For representative ADAS applications, a scalable lane detection is developed that can tune the trade-off between detection accuracy and speed. Our OpenCL implementation is tested on 14 video streams from different data-sets with different road scenarios on 5 COTS platforms. We demonstrate that the COTS platforms can provide more than sufficient computing power for the lane detection in the meanwhile our OpenCL implementation can exploit the massive parallelism provided by the COTS platforms.

23 May 2016 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
BHBiao Hu
Biao Hu
KHKai Huang
Kai Huang
GCGang Chen
Gang Chen
LCLong Cheng
Long Cheng
AKAlois Knoll
Alois Knoll
Runtime monitoring is of great importance as a safeguard to guarantee the correctness of system runtime behaviors. Two state-of-the-art methods, dynamic counters and l -repetitive function, were recently developed to tackle the runtime monitoring for real-time systems. While both are reported to be efficient in monitoring arbitrary events, the monitoring performance between them has not yet been evaluated. This article evaluates both methods in depth, to identify their strengths and weaknesses. New methods are proposed to efficiently monitor the many-to-one connections that are abstracted as AND and OR components on multiple inputs. Representative scenarios are used as our case studies to quantitatively demonstrate the evaluations. Both methods are implemented in hardware F pga . The timing overhead and resource usages of implementing the two methods are evaluated.

3 August 2018 in Journal of Circuits, Systems and Computers
Verified
Journal Article
Closed access
PDF file
LCLong Cheng
Long Cheng
KHKai Huang
Kai Huang
GCGang Chen
Gang Chen
BHBiao Hu
Biao Hu
ZJZhuangyi Jiang
Zhuangyi Jiang
AKAlois Christian Knoll
Alois Christian Knoll