Bounds on the asymptotic buffer overflow probabilities of a parallel processing system

In queueing systems with heterogeneous processors and multiclass job flows, weighted queue length policies are known to achieve maximal throughput, that is, stabilize the system under the maximum possible arrival rates, when the buffers are of infinite capacity. However, very little is known regardi...

Full description

Bibliographic Details

Published in:	1998 Information Theory Workshop, Killarney, Ireland : Great Southern Hotel and Conference Centre, 22-26 June, 1998 pp. 145 - 146
Main Authors:	Akin, H.C., Wasserman, K.M.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 1998
Subjects:	Application software Buffer overflow Capacity planning Computer aided manufacturing Computer networks Delay H infinity control Job shop scheduling Processor scheduling Throughput
ISBN:	9780780344082, 0780344081
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!