BASIC CONCEPTS - Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications - page 40

Average response time:

n

1
n

t r = ( f i − a i )

i =1

Total completion time:

t c =max
i

( f i ) − min

i

( a i )

Weighted sum of completion times:

n

t w = w i f i

i =1

Maximum lateness:

L max =max
i

( f i − d i )

Maximum number of late tasks:

n

N late = miss ( f i )

i =1

where

miss ( f i )= 0

if f i ≤ d i

1 otherwise

Table 2.1 Example of cost functions.