By Topic

Performance Optimization Based on Analytical Modeling in a Real-Time System with Constrained Time/Utility Functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kargahi, M. ; Sch. of Electr. & Comput. Eng., Univ. of Tehran, Tehran, Iran ; Movaghar, A.

We consider a single-processor firm real-time (FRT) system with exponential interarrival and execution times for jobs with relative deadlines following a general distribution. The scheduling policy of the system is first-come first-served (FCFS) and the capacity of the system is arbitrary. This system is subject to an arbitrary-shaped time/utility function (TUF), which determines the accrued utility of each job according to its completion time. It is considered that the system power consumption at different working states is predetermined for each processor speed. We have proposed an exact analytical method for the calculation of specific performance and power-related measures of the system. The resulting analytical formulations for the performance measures are functions of the processor speed and system capacity. These measures are optimized through appropriate selections of the speed using derivatives and the capacity employing numerical search methods. Some experimental results are presented for different unimodal TUFs in systems with deterministic and exponential relative deadlines. For the latter distribution, the results are compared against similar results obtained through simulation for the nonpreemptive earliest-deadline-first (NP-EDF) scheduling policy. The comparisons show that FCFS is superior to NP-EDF for some measures and TUFs.

Published in:

Computers, IEEE Transactions on  (Volume:60 ,  Issue: 8 )