Managing multiple disjoint priority orders in priority queues

Yann-Hang Lee, Kiran J. Achyutuni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In communication and computer systems, autonomous sources may assign priorities to their messages or jobs locally and independently. When a remote service (e.g., message transmission or RPC) is requested at a shared server, the server cannot use priority scheduling schemes effectively unless it can make a comparison between priorities defined by individual sources. In this paper, we investigate the strategies under which the service received by requests of one source is not affected by the priority assignments at other sources. The first approach is a combination of processor-sharing and priority queue strategies. The second approach is to map locally defined priorities onto a global priority system. The performance of these approaches is examined in terms of the average response time of all requests, the average response time of the highest priority requests and a fairness measure.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Editors Anon
PublisherIEEE
Pages1183-1190
Number of pages8
Volume3
StatePublished - 1994
Externally publishedYes
EventProceedings of the IEEE INFOCOM'94. Part 2 (of 3) - Toronto, Ont, Can
Duration: Jun 12 1994Jun 16 1994

Other

OtherProceedings of the IEEE INFOCOM'94. Part 2 (of 3)
CityToronto, Ont, Can
Period6/12/946/16/94

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Managing multiple disjoint priority orders in priority queues'. Together they form a unique fingerprint.

Cite this