arXiv subjects

Zhenhua Han

Publications and source records attributed to Zhenhua Han.

25 records · Page 2Linked to original sources

arXiv2021

The Jet-Disk Coupling of Seyfert Galaxies from a Complete Hard X-ray Sample

We analyze the jet-disk coupling for different subsamples from a complete hard X-ray Seyfert sample to study the coupling indices and their relation to accretion rate. The results are: (1) the power-law coupling index ranges from nearly unity (linear correlation) for radio-loud Seyferts to significantly less than unity for radio-quiet ones. This declining trend of coupling index also holds from larger sources to compact ones; (2) the Seyferts with intermediate to high accretion rate (Eddington ratio $λ\sim$ 0.001 to 0.3) show a linear jet-disk coupling, but it shallows from near to super Eddington ($λ\sim$ 0.3 to 10), and the former is more radio loud than the latter; (3) the Seyfert 1s are slightly steeper than the Seyfert 2s, in the jet-disk correlation. In the linear coupling regime, the ratio of jet efficiency to radiative efficiency ($η/\varepsilon$) is nearly invariant, but in low accretion or super accretion regime, $η/\varepsilon$ varies with $λ$ in our model. We note that a radio-active cycle of accretion-dominated active galactic nuclei would be: from a weaker jet-disk coupling in $λ<0.001$ for low luminosity Seyferts, to a linear coupling in $0.001<λ<0.3$ for radio-loud luminous Seyferts and powerful radio galaxies/quasars, and to a weaker coupling in $0.3<λ<10$ ones.

astro-ph.HE↗

arXiv2020

Online Distributed Job Dispatching with Outdated and Partially-Observable Information

In this paper, we investigate online distributed job dispatching in an edge computing system residing in a Metropolitan Area Network (MAN). Specifically, job dispatchers are implemented on access points (APs) which collect jobs from mobile users and distribute each job to a server at the edge or the cloud. A signaling mechanism with periodic broadcast is introduced to facilitate cooperation among APs. The transmission latency is non-negligible in MAN, which leads to outdated information sharing among APs. Moreover, the fully-observed system state is discouraged as reception of all broadcast is time consuming. Therefore, we formulate the distributed optimization of job dispatching strategies among the APs as a Markov decision process with partial and outdated system state, i.e., partially observable Markov Decision Process (POMDP). The conventional solution for POMDP is impractical due to huge time complexity. We propose a novel low-complexity solution framework for distributed job dispatching, based on which the optimization of job dispatching policy can be decoupled via an alternative policy iteration algorithm, so that the distributed policy iteration of each AP can be made according to partial and outdated observation. A theoretical performance lower bound is proved for our approximate MDP solution. Furthermore, we conduct extensive simulations based on the Google Cluster trace. The evaluation results show that our policy can achieve as high as $20.67\%$ reduction in average job response time compared with heuristic baselines, and our algorithm consistently performs well under various parameter settings.

cs.NI↗

arXiv2019

Cooperative Job Dispatching in Edge Computing Network with Unpredictable Uploading Delay

In this paper, the cooperative jobs dispatching problem in an edge computing network with multiple access points (APs) and edge servers is considered. Due to the uncertain traffic in the network between APs and edge servers, the job uploading delay can not be predicted accurately. Specifically, the job arrivals at the APs, the job uploading delay from APs to edge servers and the job computation time at the edge servers are all modeled as random variables. Since each job dispatching decision will affect the system state in the future, we formulate the joint optimization of jobs dispatching at all the APs and all the scheduling time slots as an infinite-horizon Markov decision process (MDP). The minimization objective is a discounted measurement of the average processing time per job, including the uploading delay, the waiting time and the computation time at the edge servers. In this problem, the approximate MDP should be adopted to address the curse of dimensionality. Conventional low-complexity approximate solution of MDP is usually hard to predict the performance analytically. In this paper, a novel approximate MDP solution framework is proposed via one-step policy iteration over a baseline policy, where the analytical performance bound can be obtained. Moreover, since the expression of the approximate value function is derived, the value iteration in conventional methods can be eliminated, which can essentially reduce the computation complexity. It is shown by simulations that proposed low-complexity algorithm has significantly better performance than various benchmark schemes.

cs.NI↗

arXiv2016

Dynamic Virtual Machine Management via Approximate Markov Decision Process

Efficient virtual machine (VM) management can dramatically reduce energy consumption in data centers. Existing VM management algorithms fall into two categories based on whether the VMs' resource demands are assumed to be static or dynamic. The former category fails to maximize the resource utilization as they cannot adapt to the dynamic nature of VMs' resource demands. Most approaches in the latter category are heuristical and lack theoretical performance guarantees. In this work, we formulate dynamic VM management as a large-scale Markov Decision Process (MDP) problem and derive an optimal solution. Our analysis of real-world data traces supports our choice of the modeling approach. However, solving the large-scale MDP problem suffers from the curse of dimensionality. Therefore, we further exploit the special structure of the problem and propose an approximate MDP-based dynamic VM management method, called MadVM. We prove the convergence of MadVM and analyze the bound of its approximation error. Moreover, MadVM can be implemented in a distributed system, which should suit the needs of real data centers. Extensive simulations based on two real-world workload traces show that MadVM achieves significant performance gains over two existing baseline approaches in power consumption, resource shortage and the number of VM migrations. Specifically, the more intensely the resource demands fluctuate, the more MadVM outperforms.

cs.NI↗

arXiv2015

The physical fundamental plane of black hole activity: revisited

The correlation between the jet power and accretion disk luminosity is investigated for active galactic nuclei (AGNs) and black hole X-ray binaries (BHXBs) from the literature. The power-law correlation index is steep ($μ\sim$ 1.0--1.4) for radio loud quasars and the `outliers' track of BHXBs, and it is flatter ($μ\sim$ 0.3--0.6) for radio loud galaxies and the standard track of BHXBs. The steep-index groups are mostly at higher accretion rates (peaked at Eddington ratio $>$ 0.01) and the flatter-index groups are at relatively low accretion rates (peaked at Eddington ratio $<$ 0.01), implying that the former groups could be dominated by the inner disk accretion of black hole, while the jet in latter groups would be a hybrid production of the accretion and black hole spin. We could still have a fundamental plane of black hole activity for the BHXBs and AGNs with diverse (maybe two kinds of) correlation indices. It is noted that the fundamental plane of black hole activity should be referred to the correlation between the jet power and disk luminosity or equivalently to the correlation between jet power, Eddington ratio and black hole mass, rather than the jet power, disk luminosity and black hole mass.

astro-ph.GA↗

arXiv2014

On the relation of accretion rate and spin induced jet power in low luminosity AGN

From Liu and Han (2014), the accretion-dominated jet power has a linear proportionality with the accretion rate, whereas the power law index is <=0.5 at lower accretion rate. Attributing the jet power in low accretion rate AGN to the black hole spin, it implies that the jet power has a flatter spectrum than the accretion-dominated jet versus the accretion rate. The black hole must be spinning rapidly for producing such jet power efficiently, and this may allow us to find high-spin black holes in the radio-loud low-luminosity AGN.

astro-ph.GA↗

arXiv2014

Is radio jet power linearly proportional to the product of central black hole mass and Eddington ratio in AGN?

A model for the relation between radio jet power and the product of central black hole (BH) mass and Eddington ratio of AGN is proposed, and the model is examined with data from the literature. We find that radio jet power positively correlates but not linearly with the product of BH mass ($m$ in solar mass) and Eddington ratio ($λ$), and the power law indices ($μ$) are significantly less than unity for relatively low accretion ($λ<0.1$) AGN, $P_{j}\propto (λm)^μ$, in the radio galaxies and the Seyfert galaxies. This leads to a negative correlation between radio loudness and $λm$ for the low luminosity AGN, i.e. $R\propto (λm)^ρ$ with $ρ=(7/6)μ-1<0$, which may be attributed to a contribution of BH spin to total jet power assuming that the spin induced jet is gradually suppressed as the accretion rate increases. Whereas, for the high-z quasars which often show the slope $μ\geq1$, a positive correlation between the radio loudness and disc luminosity is predicted. We discuss that the jet powers of the high-z FRII quasars are likely dominated by the accretion disc rather than by the BH spin.

astro-ph.GA↗