Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Frame space distributing method and device

A distribution method and technology of distribution devices, which are applied in multi-programming devices, data exchange networks, data processing applications, etc., can solve the problems of inability to be moved, cannot be moved and merged to eliminate fragments, and achieve the possibility of less waste, The effect of increasing the overall utilization efficiency and reducing the possibility

Inactive Publication Date: 2007-11-14
SHANGHAI HEWLETT PACKARD
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] Therefore, compared with other space allocation schemes, the allocation of rack space has the following important differences. The allocated space can only be released, but not moved. Therefore, for the allocated space, it cannot be adjusted and merged. to modify
[0016] Therefore, for the allocation of rack space, it is required to consider how to reduce the possibility of fragmentation when allocating, and try to maintain a large continuous free space, because after the allocation, the fragmentation cannot be eliminated by moving and merging the space

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Frame space distributing method and device
  • Frame space distributing method and device
  • Frame space distributing method and device

Examples

Experimental program
Comparison scheme
Effect test

no. 1 example

[0064] Referring to FIG. 4A, it shows a rack space allocation method of an Internet data center according to the present invention, including the following steps:

[0065] 400. Determine a segment spatial threshold;

[0066] 402. Divide a segment space in the rack space;

[0067] 404. When receiving a service requesting rack space, judge whether the space requested by the service is smaller than the segment space threshold;

[0068] 406. If it is smaller than the fragment space threshold, allocate space from the fragment space to the service;

[0069] 408. If it is greater than the segment space threshold, allocate to the service from a space other than the segment space.

[0070] Referring to FIG. 5A , FIG. 5A shows the allocation status of the rack space allocated according to the allocation method shown in FIG. 4A . In the example shown in FIG. 5A , a rack space 500 with 20U is divided into two parts, a fragment space 501 of 5U and a remaining space 502 of 15U. Accordin...

no. 2 example

[0075] FIG. 4B is a flow chart of a second embodiment of the rack space allocation method according to the present invention. According to this embodiment, the method includes the following steps:

[0076] 410. Determine a segment spatial threshold;

[0077] 411. Divide a piece of space in the rack space;

[0078] 412. Determine a large spatial threshold;

[0079] 413. Divide a large space in the rack space, and the large space does not overlap with the fragment space;

[0080] 414. When receiving a service requesting rack space, judge whether the space requested by the service is smaller than the segment space threshold;

[0081] 415. If it is smaller than the segment space threshold, allocate space from the segment space to the service;

[0082] 416. If it is greater than the segment space threshold, further judge whether the space requested by the service is larger than the space threshold;

[0083] 417. If it is greater than the large space threshold, allocate space fr...

no. 3 example

[0091] FIG. 4C is a flow chart of a third embodiment of the rack space allocation method according to the present invention. According to this embodiment, the method includes the following steps:

[0092] 420. Determine a segment spatial threshold;

[0093] 421. Divide a piece of space in the rack space;

[0094] 422. Determine a large spatial threshold;

[0095] 423. Divide a large space in the rack space, and the large space does not overlap with the fragment space;

[0096] 424. Set the remaining space as general business space;

[0097] 425. When receiving a service requesting rack space, judge whether the space requested by the service is smaller than the fragment space threshold;

[0098] 426. If it is smaller than the fragment space threshold, allocate space from the fragment space to the service;

[0099] 427. If it is greater than the segment space threshold, further judge whether the space requested by the service is larger than the space threshold;

[0100] 428...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention reveals an internet data center rack space allocation method. Including: a fragment of space defined threshold; and rack space in a fragment of space which, when receiving the request rack space business. First of all the business judgment of the request for space fragment size is less than the threshold of space, if space is less than threshold fragments, fragments from space to space allocation in business. Use this invention, through small business will be placed in the special request of the fragment in space, thus avoiding the smaller business occupied the request of the state of the continuous space, which can effectively reduce rack space the possibility of the creation of space debris, and the larger space available for the larger business requests, and increased the overall use of rack space efficiency, improve the performance and reduce the possibility of the waste.

Description

technical field [0001] The present invention relates to space allocation technology, and more specifically, to a method and device for automatically allocating rack space in an Internet data center. Background technique [0002] In the data center of the Internet, racks are generally used to accommodate the customer's equipment (data). The rack has a rack space. The customer's equipment (data) is stored in the rack space. The customer's equipment (Data) is called business, and business needs to be stored in continuous free rack space. When a new business request occurs, it is necessary to inquire whether the continuous free space in the current rack space is greater than the space required by the business. When there is enough continuous space, the business can be accepted. [0003] Rack space is an expensive and rare resource. Usually, the size of the rack space is represented by a unit space (Unit Space). In the following description, the unit U will be used to represent ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/46H04L12/24
CPCG06Q10/06
Inventor 蔡军尤毅
Owner SHANGHAI HEWLETT PACKARD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com