... The original EDF algorithm assumed that the tasks are preemptable with zero preemption cost a... more ... The original EDF algorithm assumed that the tasks are preemptable with zero preemption cost and showed that tasks can be scheduled by EDF if and only if the task utiliza-tion Pn i=1 ci=pi < 1. Current disks are however not pre-emptable. ... 2 SCAN-EDF scheduling algorithm ...
Abstract An N-point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete... more Abstract An N-point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a 2N-point DFT.
... The original EDF algorithm assumed that the tasks are preemptable with zero preemption cost a... more ... The original EDF algorithm assumed that the tasks are preemptable with zero preemption cost and showed that tasks can be scheduled by EDF if and only if the task utiliza-tion Pn i=1 ci=pi < 1. Current disks are however not pre-emptable. ... 2 SCAN-EDF scheduling algorithm ...
Abstract An N-point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete... more Abstract An N-point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a 2N-point DFT.
Uploads
Papers by sen pole