Balaji, S and Patnaik, LM and Jenkins, Lawrence and Goel, PS (1992) S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms. In: Journal of Parallel and Distributed Computing, 15 (3). pp. 225-237.
S_Nets_A_Petri_Net.pdf - Published Version
Restricted to Registered users only
Download (1384Kb) | Request a copy
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 ï¿½load 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:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier science.|
|Department/Centre:||Division of Electrical Sciences > Electrical Engineering
|Date Deposited:||30 May 2011 08:56|
|Last Modified:||30 May 2011 08:56|
Actions (login required)