1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Step2247 [10]
3 years ago
10

1. Different algorithms are used to make decisions on load balancing. These include random allocation, round-robin, weighted rou

nd-robin, round-robin DNS load balancing, and others. Use the Internet to research load-balancing algorithms. Do any of these algorithms compromise security
Computers and Technology
1 answer:
jok3333 [9.3K]3 years ago
3 0

Answer:

The algorithms and their advantages-disadvantages are given below.

Explanation:

1. Least Connection

Advantage:

The load balances track the transfers constantly, as well as read the details.

Disadvantage:

Server efficiency is indeed not optimal because there are different application computing abilities.

2. Round robin:

Advantage:

Implementation is simple and easily understandable.

Disadvantage:

This methodology or algorithm seems to be suitable for more than just clusters composed of servers with similar specs.

3.  Least Loaded Algorithm

Advantage:

We relate to that as the base technique, and then use it as the basis for comparison with several other strategies results.

Disadvantage:

Such knowledge is almost always unclear when the demands appear, and therefore it is quite hard to accomplish to be using the standard algorithm.

4. Dynamic Round Robin

Advantage:

Easy to execute, it calculates almost all of the server pressures in real-time.

Disadvantage:

Might trigger one processor to overrun while some are underutilized.

5. Weighted Round-Robin Allocation

Advantage:

This is an evolved round-robin edition that removes the shortcomings of that algorithm in a straightforward round.

Disadvantage:

It doesn't quite recognize the specialized criteria for high availability, including response times for each application.

You might be interested in
(blank) is an expansion card that enables a computer to connect to a network:
laiz [17]

Answer:

A

Explanation:

7 0
2 years ago
What are the trinity of the computer system
zimovet [89]

Answer:

he Computer, the System, and the World. Simics is a great product for simulating computer systems that contain processors and execute code.

Explanation:

he Computer, the System, and the World. Simics is a great product for simulating computer systems that contain processors and execute code.

3 0
3 years ago
Imagine how the situation could be handled. Come up with as many ideas as possible: There's no one "right" answer! Then, highlig
Veseljchak [2.6K]

Answer:

there is no passage

Explanation:

6 0
3 years ago
how such a company can improve the focus and relationship with customers, and what they will benefit from this improvement.
aalyn [17]
They can work and talk with customers and see what customers want and tailor to some of the customers need. Ask for feed back and reviews and customers will be more likely to shop again if they feel the business cares what they think.
7 0
4 years ago
The maximum-valued element of an integer-valued array can be recursively calculated as follows: If the array has a single elemen
Tasya [4]

Solution :

#include <iostream>

using namespace std;

//Function Declaration

int max(int arr[],int size);

int main()

{

//Declaring variable

int size;

 

while(true)

{

cout<<"Enter the no of elements in the array :";

cin>>size;

if(size<=0)

{

  cout<<"Invalid.Must be greaterthan Zero"<<endl;

  continue;

  }

  else

  break;

  }

 

//Creating an array

int arr[size];

/* getting the inputs entered by

* the user and populate them into array

*/

for(int i=0;i<size;i++)

{

cout<<"Enter element#"<<i+1<<":";

cin>>arr[i];

}

//calling function

int maximum=max(arr,size);

//Displaying the output

cout<<"The maximum Element in the Array is :"<<maximum<<endl;

return 0;

}

/* Function implementation which finds

* the maximum element in the array and return it

*/

int max(int arr[],int size)

{

//Declaring the static variables

static int k=0,maximum=-999;

 

/* This if block will execute only if the value of k

* is less than the size of an array

*/

if(k==size-1)

{

   return arr[0];

  }

else if(size-1>k)

{

if(arr[k]>maximum)

maximum=arr[k];

 

//Incrementing the k value

k++;

 

//Calling the function

max(arr,size);

}

return maximum;

}

4 0
3 years ago
Other questions:
  • Consolidating a system's physical and time resources is known as ________________.
    13·1 answer
  • John just opened a savings account and wants to maximize the account of interest you earn which of the following actions would e
    13·1 answer
  • What does Tristan need to do to add a row at the<br> bottom of the table shown?
    6·1 answer
  • Which router feature, when enabled, helps computers on the local network automatically discover and communicate with services pr
    12·1 answer
  • Write a program to read a record from a binary file
    8·1 answer
  • When you evaluate the use of digital media, how has it affected the newspaper business? The rise of digital media has caused new
    15·1 answer
  • An eReader has a 956-pixel x 1290-pixel grayscale display with each pixel able to display 32 shades of gray. What is the KiB siz
    9·1 answer
  • Compute change
    15·1 answer
  • ILL GIVE BRAINLIEST TO FIRST ANSWER David is adopting an iOS app from a non-retina screen to a retina screen. The app currently
    13·1 answer
  • What is a computing event
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!