, you will have to decide on which type of algorithm to implement and start to...

  

Transcribed Image Text:

, you will have to decide on which type of algorithm to implement and start to program the system. The language you will use is Java. Here, your round-robin or weighted round-robin algorithm will be running on the load balancing machine (i.e. the load balancing program will be working on a single machine in its own project) while a number of node programs will be running on each of the nodes (separate machines or on the same machine if none available). You will be expected to produce separate programs for: 1. The load balancer system. 2. General worker node. Do not hard code names, IP address, etc into this but instead have these passed in as parameters on the command line. The node program will be running multiple times (either on the same machine or on separate ones) 3. A program for sending jobs into the system. To potentially achieve a good mark in this assignment you will need to at least ensure your implementation considers: 1. having different programs / projects as stated above; 2. make use of multiple classes in each program; 3. ensure that the relevant functionality for the class is contained within it; 4. link classes together to form the overall algorithm; 5. use multi-threading where necessary; 6. send, receive and process messages as explained in the lectures (help will be given in the lecture on messaging systems and lab); 7. only use the main method for extracting information from the arguments passed in from the command line and to start your system to ensure that you are not hard-coding any system specific information; 8. do not provide a monolithic solution (e.g. all code in one class or main method); and, 9. do not introduce any form of OS scheduling techniques. As this is a coordination system, you will only need to consider how to deal with working out which worker node needs to be sent a job message. In addition, you should also consider the following functional aspects: 1. Separate standard/ weighted round-robin algorithm working on a designated server machine (the load balancer). 2. Each node will register with the load balancer by sending a message. 3. The scheduler will record node details. 4. Jobs require the load-balancer to assign the job to the next free node. The job information will detail the number of seconds that a job will take to run, rather than trying to include some form of code that is required to be executed. 5. The load balancer will need to store an ordered list of nodes. In the weighted round-robin strategy, the list could be ordered based on the node's workload (i.e. the number of jobs given to it already by the load balancer). The least weighted node (i.e. the one that has the least amount of work) will be the one that the job will be sent to. 6. Weighted information to determine the order of the nodes can be gained by remembering how many jobs are currently running on a node along with what its maximum load is. 7. The load balancer assigns the job to a node by sending it a message to work for X seconds. Nodes will receive job requests and wait for the required time. Once a job has finished on a node, a message will be sent back. You can provide a client (or a program to initiate and send messages into your system) that can be running on the same machine but as a separate program to the load balancer system. This will allow you to develop and test your distributed system on your home machine, or on multiple machines in the lab if lab access is possible. , you will have to decide on which type of algorithm to implement and start to program the system. The language you will use is Java. Here, your round-robin or weighted round-robin algorithm will be running on the load balancing machine (i.e. the load balancing program will be working on a single machine in its own project) while a number of node programs will be running on each of the nodes (separate machines or on the same machine if none available). You will be expected to produce separate programs for: 1. The load balancer system. 2. General worker node. Do not hard code names, IP address, etc into this but instead have these passed in as parameters on the command line. The node program will be running multiple times (either on the same machine or on separate ones) 3. A program for sending jobs into the system. To potentially achieve a good mark in this assignment you will need to at least ensure your implementation considers: 1. having different programs / projects as stated above; 2. make use of multiple classes in each program; 3. ensure that the relevant functionality for the class is contained within it; 4. link classes together to form the overall algorithm; 5. use multi-threading where necessary; 6. send, receive and process messages as explained in the lectures (help will be given in the lecture on messaging systems and lab); 7. only use the main method for extracting information from the arguments passed in from the command line and to start your system to ensure that you are not hard-coding any system specific information; 8. do not provide a monolithic solution (e.g. all code in one class or main method); and, 9. do not introduce any form of OS scheduling techniques. As this is a coordination system, you will only need to consider how to deal with working out which worker node needs to be sent a job message. In addition, you should also consider the following functional aspects: 1. Separate standard/ weighted round-robin algorithm working on a designated server machine (the load balancer). 2. Each node will register with the load balancer by sending a message. 3. The scheduler will record node details. 4. Jobs require the load-balancer to assign the job to the next free node. The job information will detail the number of seconds that a job will take to run, rather than trying to include some form of code that is required to be executed. 5. The load balancer will need to store an ordered list of nodes. In the weighted round-robin strategy, the list could be ordered based on the node's workload (i.e. the number of jobs given to it already by the load balancer). The least weighted node (i.e. the one that has the least amount of work) will be the one that the job will be sent to. 6. Weighted information to determine the order of the nodes can be gained by remembering how many jobs are currently running on a node along with what its maximum load is. 7. The load balancer assigns the job to a node by sending it a message to work for X seconds. Nodes will receive job requests and wait for the required time. Once a job has finished on a node, a message will be sent back. You can provide a client (or a program to initiate and send messages into your system) that can be running on the same machine but as a separate program to the load balancer system. This will allow you to develop and test your distributed system on your home machine, or on multiple machines in the lab if lab access is possible.

Answer rating: 100% (QA)

To implement the described load balancing system in Java youll need separate programs for the load balancer system general worker nodes and a program ... View the full answer