Skip to main content

Bin Packing Assignment algorithm for EDF Scheduling

  1. This algorithm is for independent preemptible tasks.
  2. All the processors are identical. The tasks requires no resources except the processor time
  3. The period is equal to the relative deadline.
  4.  

    The sum of utilisations of the tasks assigned to a processor is always less than or equal to 1, the task set is EDF scheduled in that processor.

    So, the problme reduces to making task assignments with the property that the sum of the utilisations of the tasks assigned to a processor does not exceed to 1.

     

     

    T1

    T2

    T3

    T4

    T5

    T6

    T7

    T8

    T9

    T10

    T11

    ei

    5

    7

    3

    1

    10

    16

    1

    3

    9

    17

    21

    Pi

    10

    21

    22

    24

    30

    40

    50

    55

    70

    90

    95

    u(i)

    =ei/Pi

    0.50

    0.33

    0.14

    0.04

    0.33

    0.40

    0.02

    0.05

    0.13

    0.19

    0.22

     

    Arrange the tasks in the order of their utilisation

     

    So the order will be L={T1,T6,T2,T5,T11,T10,T3,T9,T8,T4,T7}

     

    style="border-style:solid;border-color:#A3A3A3;border-width:1pt; vertical-align:top;width:1.4701in;padding:4pt 4pt 4pt 4pt">

    0.33

    Tasks

    u(i) -> utilisation

    Processor pi

    Assignment Vector(U)

    T1

    0.50

    p1

    (0.50)

    T6

    0.40

    p1

    (0.90)

    T2

    0.33

    p2

    (0.90, 0.33)

    T5

    p2

    (0.90,0.66)

    T11

    0.22

    p2

    (0.90,0.88)

    T10

    0.19

    p3

    (0.90,0.88,0.19)

    T3

    0.14

    p3

    (0.90,0.88,0.33)

    T9

    0.13

    p3

    (0.90,0.88,0.46)

    T8

    0.05

    p1

    (0.95,0.88,0.46)

    T4

    0.04

    p1

    (0.99,0.88,0.46)

    T7

    0.02

    p2

    (0.99,0.90,0.46)

     

     

    Steps

  5. When T1 is scheduled, there is only one processor with utilisation 0.5, so T1 is allocated to p1
  6. When T6 comes, again p1 can accommodate as 0.5+0.4=0.9 which is again less than total utilisation factor 1.
  7. When T2 comes, its utilisation is 0.33 which cant be added to p1 since it will cross 1, so a new processor is added and it is p2.
  8. Like wise all other tasks are scheduled according to their utilisation factor.
  9.  


    >The Final schedule is given below

    p1=> T1, T6,T8,T4

    p2=> T2,T5,T11,T7

    p3 => T10,T3,T9

     

Comments

  1. xplain how processors are assigned tasks deeply...plz

    ReplyDelete

Post a Comment

Popular posts from this blog

Installing ns-3.34 in Ubuntu 20.04

This post shows how to install ns 3.34 in Ubuntu 20.04 LTS Prerequisites: Fresh installation of Ubuntu Version 20.04 LTS  ns3.34 can be downloaded from here Follow the video link for complete step by step instructions on the installation.  This version fixes the compilation issues of vanet-routing-compare.cc (bug in ns3.33)  Issue the following commands after opening a terminal  $ sudo apt update $ sudo apt install g++ python3 python3-dev python-dev pkg-config sqlite3 python3-setuptools git qt5-default gir1.2-goocanvas-2.0 python3-gi python3-gi-cairo python3-pygraphviz gir1.2-gtk-3.0 ipython3 openmpi-bin openmpi-common openmpi-doc libopenmpi-dev autoconf cvs bzr unrar openmpi-bin openmpi-common openmpi-doc libopenmpi-dev tcpdump wireshark libxml2 libxml2-dev Unzip or untar the ns-allinone-3.34.tar.bz2 in the home folder (in my case its /home/pradeepkumar) $ cd ns-allinone-3.34/ $ ./build.py --enable-examples --enable-tests  Once the installation is completed, you may get an output show

Installation of ns3 in Windows 10 and Windows 11 OS using WSL (Windows Subsystem for Linux)

This post shows how to install ns-3.33 in Windows 10 through WSL (Windows Subsystem for Linux) This posts works for Windows 11 also (I have tested it on a Windows 11 ISO and it works the Same way as mentioned in the following post.) This post will work for ns-3.3x version. Prerequisites : Install Windows Subsystem for Linux with GUI: Please refer the following video  System Information: OS used: Windows 10 and WSL (Ubuntu 20.04) GUI: XServer for Windows NS3 Version: ns-3.33 See the following complete video on how to install ns3 in Windows 10 Step 0 : Open XLaunch Step 1 :  Open WSL using PowerShell and open it as Administrator Command:/  wsl $ xfce4-session The GUI of Ubuntu Opens within Windows 10 OS. Step 2 : Download ns3 from nsnam.org website through Mozilla Firefox browser Step 3: Open a Terminal  $ sudo apt update $ sudo apt install build-essential autoconf automake libxmu-dev python3-pygraphviz cvs mercurial bzr git cmake p7zip-full python3-matplotlib python-tk python3-dev qt5-q

Installing NS-3.32 in Ubuntu 20.04

This is about installing ns version 3.32 in Ubuntu 20.04 LTS. #ns3 #ns3 .32 #networksimulation The commands used in the video are given here. $] sudo apt update $] sudo apt install build-essential autoconf automake libxmu-dev python3-pygraphviz cvs mercurial bzr git cmake p7zip-full python3-matplotlib python-tk python3-dev qt5-qmake qt5-default gnuplot-x11 wireshark Download the ns-allinone-3.32.tar.bz2 package from nsnam.org and copy it to /home/ folder See the full video for detailed instructions Extract it either in GUI or using command $] tar jxvf ns-allinone-3.32.tar.bz2 $] cd ns-allinone-3.32/ $] ./build.py --enable-examples --enable-tests The above command will take some time to install all the packages  You can see the output as shown below ns3 To check whether ns3 installed successfully, use the following commands. $] cd ns-3.32/ $] ./waf --run hello-simulator You should get the output as Hello Simulator $] ./waf --run first This is the example from the ns-3.32/exa