arXiv subjects

Haibo Zeng

Publications and source records attributed to Haibo Zeng.

15 recordsLinked to original sources

arXiv2026

Message-Level Scheduling for RLNC-Coded Multi-Source Traffic

This paper studies weighted decoding-delay minimization for multiple RLNC-coded message streams that compete for finite processing capacity at a destination. Packet arrivals are exogenous, while the scheduler only determines the processing order of packets already available at the destination. A trace-conditioned offline scheduling formulation shows that a batch-release subclass is strongly NP-hard even with a single processing unit. Message-Aware Innovation-Deficit Scheduling (MAIDS) is then developed to prioritize each serviceable message according to its weight and remaining decoding deficit. For a single processing unit, MAIDS is shown to be exactly optimal under nonblocking progressive arrivals with equal weights and under common activation with arbitrary positive weights, while the unrestricted weighted online problem admits no universal deterministic $O(1)$ competitive ratio. Simulation results on streaming and batch benchmarks show that MAIDS consistently reduces weighted decoding delay relative to the tested baselines, remains close to the offline optimum on average, and recovers the predicted exact performance boundaries.

cs.NI↗

arXiv2025

Theoretical Delay Analysis of Network Coding Enabled M-to-N Broadcasting in Ad-Hoc Networks

In this paper, we investigate the delay performance of ad hoc broadcast networks in which random linear network coding is used to support M-to-N information dissemination. Multiple source nodes may inject coded packets for the same message, while multiple destination nodes decode the message after collecting a sufficient number of innovative degrees of freedom. Because broadcast forwarding does not rely on predetermined end-to-end routes, the packet-level relay sequence is generally random and depends on propagation delay, queueing delay, and prior reception history. We first prove that, when queueing, contention, processing, and retransmission delays are ignored, the first-reception time under fastest-only broadcast is exactly equal to the multi-source shortest-path distance, which provides a lower bound on propagation delay. We then develop an equivalent fixed-route queueing approximation to estimate relay-node load, stability, and end-to-end delay under M/D/1 and G/D/1 models. To account for route diversity under congestion, we further introduce a congestion-cost path approximation that penalizes heavily loaded relays. Simulation results on random and structured topologies show that the proposed framework captures the main delay trends under different traffic intensities and network densities while remaining simple for tractable analytical evaluation.

cs.NI↗

arXiv2024

Real-Time Systems Optimization with Black-box Constraints and Hybrid Variables

When optimizing real-time systems, designers often face a challenging problem where the schedulability constraints are non-convex, non-continuous, or lack an analytical form to understand their properties. Although the optimization framework NORTH proposed in previous work is general (it works with arbitrary schedulability analysis) and scalable, it can only handle problems with continuous variables, which limits its application. In this paper, we extend the applications of the framework NORTH to problems with a hybrid of continuous and discrete variables. This is achieved in a coordinate-descent method, where the continuous and discrete variables are optimized separately during iterations. The new framework, NORTH+, improves around 20% solution quality than NORTH in experiments.

eess.SY↗

arXiv2024

Joint Optimization of Continuous Variables and Priority Assignments for Real-Time Systems with Black-box Schedulability Constraints

In real-time systems optimization, designers often face a challenging problem posed by the non-convex and non-continuous schedulability conditions, which may even lack an analytical form to understand their properties. To tackle this challenging problem, we treat the schedulability analysis as a black box that only returns true/false results. We propose a general and scalable framework to optimize real-time systems, named Numerical Optimizer with Real-Time Highlight (NORTH). NORTH is built upon the gradient-based active-set methods from the numerical optimization literature but with new methods to manage active constraints for the non-differentiable schedulability constraints. In addition, we also generalize NORTH to NORTH+, to collaboratively optimize certain types of discrete variables (e.g., priority assignments, categorical variables) with continuous variables based on numerical optimization algorithms. We demonstrate the algorithm performance with two example applications: energy minimization based on dynamic voltage and frequency scaling (DVFS), and optimization of control system performance. In these experiments, NORTH achieved $10^2$ to $10^5$ times speed improvements over state-of-the-art methods while maintaining similar or better solution quality. NORTH+ outperforms NORTH by 30% with similar algorithm scalability. Both NORTH and NORTH+ support black-box schedulability analysis, ensuring broad applicability.

eess.SY↗

arXiv2023

Roadmap on Perovskite Light-Emitting Diodes

In recent years, the field of metal-halide perovskite emitters has rapidly emerged as a new community in solid-state lighting. Their exceptional optoelectronic properties have contributed to the rapid rise in external quantum efficiencies (EQEs) in perovskite light-emitting diodes (PeLEDs) from <1% (in 2014) to approaching 30% (in 2023) across a wide range of wavelengths. However, several challenges still hinder their commercialization, including the relatively low EQEs of blue/white devices, limited EQEs in large-area devices, poor device stability, as well as the toxicity of the easily accessible lead components and the solvents used in the synthesis and processing of PeLEDs. This roadmap addresses the current and future challenges in PeLEDs across fundamental and applied research areas, by sharing the community's perspectives. This work will provide the field with practical guidelines to advance PeLED development and facilitate more rapid commercialization.

physics.optics↗

arXiv2023

Optimizing Logical Execution Time Model for Both Determinism and Low Latency

The Logical Execution Time (LET) programming model has recently received considerable attention, particularly because of its timing and dataflow determinism. In LET, task computation appears always to take the same amount of time (called the task's LET interval), and the task reads (resp. writes) at the beginning (resp. end) of the interval. Compared to other communication mechanisms, such as implicit communication and Dynamic Buffer Protocol (DBP), LET performs worse on many metrics, such as end-to-end latency (including reaction time and data age) and time disparity jitter. Compared with the default LET setting, the flexible LET (fLET) model shrinks the LET interval while still guaranteeing schedulability by introducing the virtual offset to defer the read operation and using the virtual deadline to move up the write operation. Therefore, fLET has the potential to significantly improve the end-to-end timing performance while keeping the benefits of deterministic behavior on timing and dataflow. To fully realize the potential of fLET, we consider the problem of optimizing the assignments of its virtual offsets and deadlines. We propose new abstractions to describe the task communication pattern and new optimization algorithms to explore the solution space efficiently. The algorithms leverage the linearizability of communication patterns and utilize symbolic operations to achieve efficient optimization while providing a theoretical guarantee. The framework supports optimizing multiple performance metrics and guarantees bounded suboptimality when optimizing end-to-end latency. Experimental results show that our optimization algorithms improve upon the default LET and its existing extensions and significantly outperform implicit communication and DBP in terms of various metrics, such as end-to-end latency, time disparity, and its jitter.

eess.SY↗

arXiv2023

Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness and Approximation Algorithm

Carbon footprint optimization (CFO) is important for sustainable heavy-duty e-truck transportation. We consider the CFO problem for timely transportation of e-trucks, where the truck travels from an origin to a destination across a national highway network subject to a deadline. The goal is to minimize the carbon footprint by orchestrating path planning, speed planning, and intermediary charging planning. We first show that it is NP-hard even just to find a feasible CFO solution. We then develop a $(1+\epsilon_F, 1+\epsilon_\beta)$ bi-criteria approximation algorithm that achieves a carbon footprint within a ratio of $(1+\epsilon_F)$ to the minimum with no deadline violation and at most a ratio of $(1+\epsilon_\beta)$ battery capacity violation (for any positive $\epsilon_F$ and $\epsilon_\beta$). Its time complexity is polynomial in the size of the highway network, $1/\epsilon_F$, and $1/\epsilon_\beta$. Such algorithmic results are among the best possible unless P=NP. Simulation results based on real-world traces show that our scheme reduces up to 11\% carbon footprint as compared to baseline alternatives considering only energy consumption but not carbon footprint.

cs.DS↗

arXiv2022

High-performance and Low-power Transistors Based on Anisotropic Monolayer $β$-TeO$_2$

Two-dimensional (2D) semiconductors offer a promising prospect for high-performance and energy-efficient devices especially in the sub-10 nm regime. Inspired by the successful fabrication of 2D $β$-TeO$_2$ and the high on/off ratio and high air-stability of fabricated field effect transistors (FETs) [Nat. Electron. 2021, 4, 277], we provide a comprehensive investigation of the electronic structure of monolayer $β$-TeO$_2$ and the device performance of sub-10 nm metal oxide semiconductors FETs (MOSFETs) based on this material. The anisotropic electronic structure of monolayer $β$-TeO$_2$ plays a critical role in the anisotropy of transport properties for MOSFETs. We show that the 5.2-nm gate-length n-type MOSFET holds an ultra-high on-state current exceeding 3700 μA/μm according to International Roadmap for Devices and Systems (IRDS) 2020 goals for high-performance devices, which is benefited by the highly anisotropic electron effective mass. Moreover, monolayer $β$-TeO$_2$ MOSFETs can fulfill the IRDS 2020 goals for both high-performance and low-power devices in terms of on-state current, sub-threshold swing, delay time, and power-delay product. This study unveils monolayer $β$-TeO$_2$ as a promising candidate for ultra-scaled devices in future nanoelectronics.

cond-mat.mes-hall↗

arXiv2021

Towards Computational Awareness in Autonomous Robots: An Empirical Study of Computational Kernels

The potential impact of autonomous robots on everyday life is evident in emerging applications such as precision agriculture, search and rescue, and infrastructure inspection. However, such applications necessitate operation in unknown and unstructured environments with a broad and sophisticated set of objectives, all under strict computation and power limitations. We therefore argue that the computational kernels enabling robotic autonomy must be scheduled and optimized to guarantee timely and correct behavior, while allowing for reconfiguration of scheduling parameters at run time. In this paper, we consider a necessary first step towards this goal of computational awareness in autonomous robots: an empirical study of a base set of computational kernels from the resource management perspective. Specifically, we conduct a data-driven study of the timing, power, and memory performance of kernels for localization and mapping, path planning, task allocation, depth estimation, and optical flow, across three embedded computing platforms. We profile and analyze these kernels to provide insight into scheduling and dynamic resource management for computation-aware autonomous robots. Notably, our results show that there is a correlation of kernel performance with a robot's operational environment, justifying the notion of computation-aware robots and why our work is a crucial step towards this goal.

cs.RO↗

arXiv2021

Software-Defined Edge Computing: A New Architecture Paradigm to Support IoT Data Analysis

The rapid deployment of Internet of Things (IoT) applications leads to massive data that need to be processed. These IoT applications have specific communication requirements on latency and bandwidth, and present new features on their generated data such as time-dependency. Therefore, it is desirable to reshape the current IoT architectures by exploring their inherent nature of communication and computing to support smart IoT data process and analysis. We introduce in this paper features of IoT data, trends of IoT network architectures, some problems in IoT data analysis, and their solutions. Specifically, we view that software-defined edge computing is a promising architecture to support the unique needs of IoT data analysis. We further present an experiment on data anomaly detection in this architecture, and the comparison between two architectures for ECG diagnosis. Results show that our method is effective and feasible.

cs.NI↗

arXiv2020

Detection of quantum geometric tensor by nonlinear optical response

Quantum geometric tensor (QGT), including a symmetric real part defined as quantum metric and an antisymmetric part defined as Berry curvature, is essential for understanding many phenomena. We studied the photogalvanic effect of a multiple-band system with time-reversal-invariant symmetry by theoretical analysis in this work. We concluded that the integral of gradient of the symmetric part of QGT in momentum space is related to the linearly photogalvanic effect, while the integral of gradient of Berry curvature is related to the circularly photogalvanic effect. Our work afforded an alternative interpretation for the photogalvanic effect in the view of QGT, and a simple approach to detect the QGT by nonlinear optical response.

cond-mat.mes-hall↗

arXiv2020

Nonlinear optical response from quantum kinetic equation

Motivated by the nonlinear Hall effect observed in topological semimetals, we studied the photocurrent by the quantum kinetic equation. We recovered the shift current and injection current discovered by Sipe et al., and the nonlinear Hall current induced by Berry curvature dipole (BCD) proposed by Inti Sodemann and Liang Fu. Especially, we further proposed that 3-form tensor can also induce photocurrent, in addition to the Berry curvature and BCD. This work will supplement the existing mechanisms for photocurrent. In contrast to the shift current induced by shift vector, all photocurrents induced by gradient/curl of Berry curvature, and high rank tensor require circularly polarized light and topologically non-trivial band structure, viz. non-vanishing Berry curvature.

cond-mat.mtrl-sci↗

arXiv2019

Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication

We consider the scenario where a sender periodically sends a batch of data to a receiver over a multi-hop network, possibly using multiple paths. Our objective is to minimize peak/average Age-of-Information (AoI) subject to throughput requirements. The consideration of batch generation and multi-path communication differentiates our AoI study from existing ones. We first show that our AoI minimization problems are NP-hard, but only in the weak sense, as we develop an optimal algorithm with a pseudo-polynomial time complexity. We then prove that minimizing AoI and minimizing maximum delay are "roughly" equivalent, in the sense that any optimal solution of the latter is an approximate solution of the former with bounded optimality loss. We leverage this understanding to design a general approximation framework for our problems. It can build upon any $α$-approximation algorithm of the maximum delay minimization problem, to construct an $(α+c)$-approximate solution for minimizing AoI. Here $c$ is a constant depending on the throughput requirements. Simulations over various network topologies validate the effectiveness of our approach.

cs.NI↗

arXiv2018

Network Utility Maximization under Maximum Delay Constraints and Throughput Requirements

We consider the problem of maximizing aggregate user utilities over a multi-hop network, subject to link capacity constraints, maximum end-to-end delay constraints, and user throughput requirements. A user's utility is a concave function of the achieved throughput or the experienced maximum delay. The problem is important for supporting real-time multimedia traffic, and is uniquely challenging due to the need of simultaneously considering maximum delay constraints and throughput requirements. We first show that it is NP-complete either (i) to construct a feasible solution strictly meeting all constraints, or (ii) to obtain an optimal solution after we relax maximum delay constraints or throughput requirements up to constant ratios. We then develop a polynomial-time approximation algorithm named PASS. The design of PASS leverages a novel understanding between non-convex maximum-delay-aware problems and their convex average-delay-aware counterparts, which can be of independent interest and suggest a new avenue for solving maximum-delay-aware network optimization problems. Under realistic conditions, PASS achieves constant or problem-dependent approximation ratios, at the cost of violating maximum delay constraints or throughput requirements by up to constant or problem-dependent ratios. PASS is practically useful since the conditions for PASS are satisfied in many popular application scenarios. We empirically evaluate PASS using extensive simulations of supporting video-conferencing traffic across Amazon EC2 datacenters. Compared to existing algorithms and a conceivable baseline, PASS obtains up to $100\%$ improvement of utilities, by meeting the throughput requirements but relaxing the maximum delay constraints that are acceptable for practical video conferencing applications.

cs.NI↗

arXiv2018

On the Min-Max-Delay Problem: NP-completeness, Algorithm, and Integrality Gap

We study a delay-sensitive information flow problem where a source streams information to a sink over a directed graph G(V,E) at a fixed rate R possibly using multiple paths to minimize the maximum end-to-end delay, denoted as the Min-Max-Delay problem. Transmission over an edge incurs a constant delay within the capacity. We prove that Min-Max-Delay is weakly NP-complete, and demonstrate that it becomes strongly NP-complete if we require integer flow solution. We propose an optimal pseudo-polynomial time algorithm for Min-Max-Delay, with time complexity O(\log (Nd_{\max}) (N^5d_{\max}^{2.5})(\log R+N^2d_{\max}\log(N^2d_{\max}))), where N = \max\{|V|,|E|\} and d_{\max} is the maximum edge delay. Besides, we show that the integrality gap, which is defined as the ratio of the maximum delay of an optimal integer flow to the maximum delay of an optimal fractional flow, could be arbitrarily large.

cs.DS↗