ePrints

Multiprocessor Systems with Preemptive Priorities

Lookup NU author(s): Emeritus Professor Isi Mitrani

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

A system with N processors and R job classes subject to a preemptive priority scheduling discipline is considered. Exact analysis is presented for the case R = 2, under Markovian assumptions. That analysis suggests a method for obtaining approximate solutions for arbitrary R. The implementation of the methods is discussed and numerical results for some special cases are given.

Publication metadata

Author(s): Mitrani I, King PJB

Publication type: Article

Publication status: Published

Journal: Performance Evaluation

Year: 1981

Volume: 1

Issue: 2

Pages: 118-125

ISSN (print): 0166-5316

ISSN (electronic): 1872-745X

Publisher: Elsevier BV

URL: http://dx.doi.org/10.1016/0166-5316(81)90014-6

DOI: 10.1016/0166-5316(81)90014-6

Altmetrics

Share