Skip to main content

Earliest Deadline First (EDF) Algorithm

  • It is an Optimal dynamic Priority Scheduling Algorithm
  • Priorities are assigned based on the absolute deadlines of the task, earlier the deadline, higher the priority.
  • It is also called as Deadline Monotonic Scheduling (DM).
  • If two tasks have the same deadline, then EDF randomly select  one to execute next.
  • The Schedulability condition for EDF is edf

where U is the processor Utilisation Factor and it never be greater than 1.

In practical, no processor will be utilised for more than 100%.

Comments

  1. buddha puneeth3 March 2011 at 06:31

    sir,
    This is buddha.As a part of my final year project i need to work on EDF algorithm.Can you provide me the code as soon as possible.

    ReplyDelete
  2. hiii ,i need the source code of edf energy saving algo..can someone plz mail d source code to me asap...

    ReplyDelete
  3. you should use linux for doing that...

    ReplyDelete
  4. heyy....plzz mail me the source code of edf algorithm

    ReplyDelete
  5. hi can u send me the code for this scheduling rms and edf

    ReplyDelete
  6. Shortly i wll update the coding to you

    ReplyDelete
  7. I am pretty sure on the point you said, "EDF also same as Deadline monotonic" and EDF handled as absolute deadlines of task set. If it deals with absolute deadline then how it could be dynamic priority scheduler.

    My arguments :
    1. Deadline monotonic is a spacial case of rate monotonic(RMS) where
    deadline < periodicity
    2. EDF runs with relative deadlines i.e at certain time intervals or specified trigger points it checks ( relative deadline = absolute deadline - present time ). so any task which will be closest to miss its deadline will get highest priority. this way the priority will be assigned DYNAMICALLY.
    Any good book or ieee article could prove this.

    ReplyDelete

Post a comment

Popular posts from this blog

Installing TexLive 2019 in Ubuntu 18.04

Installation of TexLive 2019 in Linux (Ubuntu 18.04 LTS)
TeX (Tech)

Installation of TexLive 2019

Please watch the video for full installation



I used .iso file to download, the Total size is 3.3GB for Linux,

and i used the torrent file to download, it took me just 20 min to download the entire .iso file

Extract the .iso file to a folder and open a terminal

$] sudo ./install-tl
(it goes into a terminal mode, which is faster compared to the GUI Mode)

$] sudo ./install-tl -gui
after the installation, set the PATH, MANPATH and INFOPATH as suggested by LATEX

export PATH=$PATH:/usr/local/texlive/2019/bin/x86_64-linux
export MANPATH=/usr/local/texlive/2019/texmf-dist/doc/man
export INFOPATH=/usr/local/texlive/2019/texmf-dist/doc/info

put these lines in to the /home/pradeepkumar/.bashrc

$] gedit /home/pradeepkumar/.bashrc
We have installed TexLive 2019 and texstudio.

To install texstudio

$] sudo apt install texstudio
The look and feel of TexStudio looks like this image.


texlive, it install everyt…

Implementing a new system call in Kernel version 2.6.32

A system call is used by application or user programs to request service from the operating systems. Since the user programs does not have direct access to the kernel whereas the OS has the direct access. OS can access the hardware through system calls only.The following files has to be modified for implementing a system call/usr/src/linux-2.6.32.5/arch/x86/kernel/syscall_table_32.S/usr/src/linux-2.6.32.5/arch/x86/include/asm/unistd_32.h/usr/src/linux-2.6.32.5/include/linux/syscalls.h/usr/src/linux-2.6.32.5/MakefileNew set of files to be createdCreate a new directory newcall/ inside the path “/usr/src/linux-2.6.32.5/” Create new files Makefile, newcall.c and put them in the /usr/src/linux-2.6.32.5/newcall/ folder Create new user files (in any folder of Linux) to test the system call
testnewcall.c, testnewcall.h (created in /home/pradeepkumar) syscall_table_32.S Find the file /usr/src/linux-2.6.32.5/arch/x86/kernel/syscall_table_32.S and add the following line at the end
"…

Electrical Machine Design (equations)

FactorsDC Machine Transformers Induction Machines Synchronous MachinesOutput EquationPa=CoD2Ln, where Pa=P/h for generators, Pa=P for motorsFor Single Phase
Q=2.22 f Bm Ai Kw Aw d10-3
For Three Phase
Q=3.33 f Bm Ai Kw Aw d 10-3Q=CoD2 L ns
KVA Input Q=
HP * 0.746 / Cos f * hQ=CoD2 L ns
KVA Input Q=
HP * 0.746 / Cos f * h
For Turbo alternators
Q=1.11Bavac KwsVa2 L 10-3/nsOutput CoefficientCo=Bav ac* 10-3where Bav-magnetic loading and ac - electric loadingDNACo=11 Kws Bav ac 10-3Co=11 Kws Bav ac 10-3 Choice of Magnetic LoadingFlux Density in Teeth Frequency of Flux Reversals Size of machineDNAMagnetizing current, Flux Density, Iron lossIron loss, Stability, Voltage Rating, Parallel Operation, Transient ShortCircuit current Choice of Electric LoadingTemperature rise,
speed of machine, Voltage, Armature reaction, CommutationDNAOverload Capacity, Copper losses, Temperature rise, Leakage ReactanceCopper loss, Synchronous reactance, Temperature rise, Stray Load losses,
Voltage rating Flux …