S-nets: a Petri net based model for performance evaluation of real-time scheduling algorithms

Balaji, S. ; Patnaik, L. M. ; Jenkins, Lawrence ; Goel, P. S. (1992) S-nets: a Petri net based model for performance evaluation of real-time scheduling algorithms Journal of Parallel and Distributed Computing, 15 (3). pp. 225-237. ISSN 0743-7315

Full text not available from this repository.

Official URL: http://linkinghub.elsevier.com/retrieve/pii/074373...

Related URL: http://dx.doi.org/10.1016/0743-7315(92)90005-8

Abstract

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called "oad index" and "balance index," which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:13089
Deposited On:11 Nov 2010 04:57
Last Modified:02 Jun 2011 07:44

Repository Staff Only: item control page