1:** Input:** Let be the accepted tasks in the |

ready queue, and let be the expected execution time of |

. Let current time be and let be the task currently |

being executed, expected execution time of is . Let |

the expected utility density threshold be . |

2: |

3:** if** A new task, that is, arrives **then** |

4: Accept if ; |

5: Reject if ; |

6: Remove in the ready queue end if ; |

7: **end if** |

8: |

9: **If ** is completed **then** |

10: Choose with the largest system utility density, that is, |

. |

11: Remove in the ready queue if ; |

12: **end if** |

13: |

14: **If ** = the critical time of **then** |

15: Abort immediately; |

16: Choose with the largest system utility density, that is, |

. |

17: Remove in the ready queue if ; |

18: **end if** |