scispace - formally typeset
Z

Zhong Tang

Researcher at University of Tennessee

Publications -  12
Citations -  206

Zhong Tang is an academic researcher from University of Tennessee. The author has contributed to research in topics: Load balancing (computing) & Queue. The author has an hindex of 8, co-authored 12 publications receiving 204 citations.

Papers
More filters
Journal ArticleDOI

The effect of time delays on the stability of load balancing algorithms for parallel computations

TL;DR: The model is shown to be self consistent in that the queue lengths cannot go negative and the total number of tasks in all the queues and the network are conserved, and it is shown that using the proposed load balancing algorithms, the system is stable in the sense of Lyapunov.
Book ChapterDOI

Dynamic Time Delay Models for Load Balancing. Part I: Deterministic Models

TL;DR: A common architecture is the cluster of otherwise independent computers communicating through a shared network that helps to achieve performance that is not attainable on a single processor, or CE, computer.
Journal ArticleDOI

Linear time delay model for studying load balancing instabilities in parallel computations

TL;DR: A linear time-delay system is proposed to model load balancing in a cluster of computer nodes used for parallel computations and this model is compared with an experimental implementation of the algorithm on a parallel computer network.
Proceedings ArticleDOI

The effect of time delays in the stability of load balancing algorithms for parallel computations

TL;DR: The model is shown to be self consistent in that the queue lengths cannot go negative and the total number of tasks in all the queues are conserved, and it is shown that using the proposed load balancing algorithms, the system is stable.
Proceedings ArticleDOI

A time delay model for load balancing with processor resource constraints

TL;DR: The new model is shown to be self consistent in that the queue lengths cannot become negative and the total number of tasks in all the queues Is conserved, and to be (Lyapunov) stable for any input, but not necessarily asymptotically stable.