Shulou(Shulou.com)06/01 Report--

This article introduces the relevant knowledge of "Python dynamic planning to achieve virtual machine deployment". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

Topic description

Considering that resource providers usually want to maximize their profits in virtual machine deployment, there is now a host with a total of x cpu and y GB memory. Users can apply to the resource provider for the use of virtual machine resources by their own quotation, such as paying w yuan to apply for a virtual machine with a cpu and b GB memory. Please design an algorithm so that resource providers can arrange virtual machines reasonably to maximize their own revenue.

Enter:

N x y

2 4 200

4 2 150

...

Note: n means there are n user quotation applications, and the host has a total of x cpu and y GB memory

The following n lines, each representing the amount of cpu and memory requested by the user, as well as the amount quoted by the user.

Algorithm thought

In order to find the global optimal solution, the idea of dynamic programming is adopted. Finding the maximum benefit is the ultimate problem, and the sub-problem of the best interest can be regarded as the maximum amount of each user that has been quoted, and the required number of CPU and memory are added to the total demand, which is compared with the number of CPU and memory capacity provided. For the users who have solved the current largest quotation, the next maximum quotation can be regarded as a sub-problem, but the CPU and memory capacity need to be subtracted from the allocated capacity, so repeatedly, until the CPU and memory capacity can not meet the requirements of any user, the optimal solution will be obtained.

Test result

Running result:

source code

Import sys print ("Please enter the number of users applying for virtual machines, cpu, memory capacity:") a = list (map (int, input (). Split () # use array a to store the number of users participating in the quote, the number of cpu to be stored in the cloud, capacity size A1 = a [0] # storage users To enter several lines of data a2 = a [1] # number of storage cpu a3 = a [2] # storage capacity b = [] cpu_num=0size_num=0money=0b1 = [0] * A1 # array b1 stores user quotes p1 = [0] * A1 # array p1 where the amount of the quote is recorded for i in range (A1): print ("Please enter the first order", item1 "number of CPU requests per user memory capacity quotation:") b.append (list (map (int, input (). Split () for k in range (A1): b1 [k] = b [k] [2] p1 [k] = k for i in range (0mema1-1): for j in range (1) A1Muri): if b1 [j] > b1 [j-1]: temp= b1 [j-1] b1 [j-1] = b1 [j] b1 [j] = temp temp= p1 [j-1] p1 [j-1] = p1 [j] P1 [j] = tempdef Fun (I): global cpu_num,size_num Money cpu_num=cpu_num+ b [p1 [I]] [0] size_num=size_num+ b [p1 [I]] [1] money=money+ b [p1 [I]] [2] if cpu_num > a2 or size_num > a3: money=money-b [p1 [I]] [2] cpu_num=cpu_num-b [p1 [I]] [0] size_num=size_num-b [p1 [I] [1] for i in Range (A1): Fun (I) print ("maximize revenue:" Money) "Python dynamic planning method for virtual machine deployment" ends here. Thank you for your reading. If you want to know more about the industry, you can follow the website, the editor will output more high-quality practical articles for you!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.