169 / 2016-12-02 19:06:14
Improvised Provision for Load Balancing in Content Delivery Networks
11986,7131,11987,11988,11989,11990,11991
Draft Accepted
chetana Bhagat / Jawaharlal Nehru Engineering College Aurangabad
Dilip Budhwant / ME Computer Science and Engineering
This paper presents how four load balancing algorithms affect the total execution time of the parallel job using JPPF (Java Parallel Processing Framework). JPPF is Open Source tool that enables applications with large processing power requirements to be run on any number of nodes, in order to reduce their processing time . The algorithms differ in the way of balancing scheduling tasks between the nodes. One of the algorithms uses the fixed (static) number of tasks given by a user. The other three algorithms use some form of the adaptive load balancing. There are two sets of the measurements presented using these four algorithms for executing a parallel job of matrix multiplication. The results of these measurements led to the conclusion that the static load balancing algorithms spend less time on communication between server and a nodes compared to the other.
Important Date
  • Conference Date

    Mar 22

    2017

    to

    Mar 24

    2017

  • Feb 15 2017

    Draft paper submission deadline

  • Feb 20 2017

    Draft Paper Acceptance Notification

  • Feb 22 2017

    Final Paper Deadline

  • Mar 24 2017

    Registration deadline