Storage bin allocation scheduling method, device, electronic device and storage medium

Abstract

The present invention provides a storage bin allocation scheduling method, device, electronic device and storage medium. By constructing a circular queue and allocating a coordinate interval of the circular queue for the storage bin, when receiving a storage request for a wafer box to be stored corresponding to the same process node, the node number of the process node is converted into a first binary number with a preset number of bits, and a first shift bit number is determined based on the minimum value of the number of free storage units in each storage bin at present, so that for any wafer box to be stored, the first binary number corresponding to the node number of the process node is cyclically left shifted a random number of times to obtain a first random number, wherein the number of left shifts for each cyclic left shift is the first shift bit number, and based on the coordinates corresponding to the hash value of the first random number in the circular queue, the storage unit of the wafer box to be stored is determined, so that the load balance of each storage bin can be improved.

Description

Technical Field

[0001] The present invention relates to the field of scheduling technology, and in particular to a storage bin allocation scheduling method, device, electronic equipment and storage medium. Background Art

[0002] In the process production process of the semiconductor factory, storage bins are used to store wafer boxes loaded with wafers that have been processed by the same process flow, so that they can be used at any time when the corresponding wafers are needed during the operation of the process flow. Among them, each storage bin contains multiple storage units, which can be used to store wafer boxes. When storing wafer boxes, some storage instructions do not specify a storage bin, so a storage bin with free storage units can be automatically specified for the storage instruction according to the idle status of each storage bin for storage, while some storage instructions will execute a specific storage bin to store the wafer box corresponding to the corresponding instruction. Therefore, in order to avoid the problem that when the storage bin is specified by the wafer box, the storage bin has no storage space and cannot be stored, the load balancing condition will be considered when storing wafer boxes.

[0003] In existing solutions, space allocation schemes are usually designed to achieve load balancing based on the characteristics of the storage bin itself, such as the current idle rate of the storage bin or the idle rate in a certain period of time in the future. However, this scheme can only ensure to a certain extent that when the wafer box is put in, it is placed in a relatively idle storage bin as much as possible. However, when the wafer boxes that store wafers at the same process node in batches need to be stored in the storage bin, this scheme may store most of the wafer boxes in the storage units of the same storage bin. Due to the characteristics of the semiconductor process flow in the semiconductor factory, when entering a certain semiconductor process node, it is necessary to take out many wafers of the same specification (i.e., at the same process node). The above scheme may cause a large number of wafer boxes to be taken out from the same storage bin, resulting in the phenomenon that the storage bin load is unbalanced during the wafer box removal process. Therefore, it is necessary to provide a new storage bin allocation scheduling scheme to ensure that load balancing can be achieved during the process of constantly putting in and taking out the wafer boxes. Summary of the invention

[0004] The present invention provides a storage bin allocation scheduling method, device, electronic device and storage medium, which are used to solve the defect of the prior art that storage bin load imbalance is easily caused.

[0005] The present invention provides a storage bin allocation scheduling method, comprising:

[0006] Based on the total amount of storage units of all storage bins in the repository, a circular queue is constructed, and a coordinate interval of the circular queue is allocated to the storage bin;

[0007] Upon receiving a storage request for a wafer box to be stored corresponding to the same process node, converting the node number of the process node into a first binary number of a preset number of bits; determining a first shift bit number based on the minimum value of the number of free storage units in each storage bin at present; for any wafer box to be stored, performing a random number of cyclic left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts for each cyclic left shift is the first shift bit number, and determining the storage unit of any wafer box to be stored based on the coordinates corresponding to the hash value of the first random number in the circular queue;

[0008] Among them, the difference between a new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node to the left by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

[0009] According to a storage bin allocation scheduling method provided by the present invention, the coordinates corresponding to the hash value of the first random number in the circular queue are determined to determine any storage unit to be stored in the wafer box, including:

[0010] Determine, based on the coordinates corresponding to the hash value of the first random number in the circular queue, a storage unit corresponding to the coordinates;

[0011] If the state of the storage unit corresponding to the coordinate is occupied, the coordinates after the coordinate are traversed in sequence until the state of the storage unit corresponding to the current coordinate is free, and the storage unit corresponding to the current coordinate is determined to be any storage unit to be stored in the wafer box;

[0012] Otherwise, it is determined that the storage unit corresponding to the coordinate is any storage unit to be stored in the wafer box.

[0013] According to a storage warehouse allocation scheduling method provided by the present invention, the random number is determined based on the current random interval; the upper limit value of the current random interval is determined based on the number of wafer boxes currently stored in the storage warehouse, and the more wafer boxes currently stored in the storage warehouse, the larger the upper limit value of the current random interval.

[0014] According to a storage bin allocation scheduling method provided by the present invention, when a batch wafer box removal request corresponding to the same process node is received, the node number of the process node is converted into a second binary number of the preset number of bits; based on the minimum value of the number of free storage units in each storage bin at present, the second shift bit number is determined; for any wafer box removal request, the second binary number corresponding to the node number of the process node is cyclically left-shifted a random number of times to obtain a second random number, wherein the number of left shifts for each cyclic left shift is the second shift bit number, and based on the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong, the storage unit address of the wafer box to be removed corresponding to any wafer box removal request is determined;

[0015] Among them, the difference between a new binary number obtained by cyclically shifting the second binary number corresponding to the node number of any process node to the left by the second shift bit number and the second binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

[0016] According to a storage bin allocation scheduling method provided by the present invention, the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong belongs is determined, and the storage unit address of the wafer box to be taken out corresponding to any wafer box take-out request is determined, including:

[0017] Determining a process node corresponding to each wafer box stored in each occupied storage unit in the storage bin;

[0018] A storage unit address whose process node corresponding to the wafer box stored in the storage bin is consistent with the process node corresponding to any wafer box removal request is randomly selected as the storage unit address of the wafer box to be removed corresponding to any wafer box removal request.

[0019] According to a storage bin allocation scheduling method provided by the present invention, the step of allocating the coordinate interval of the circular queue to the storage bin includes:

[0020] Allocating a coordinate interval of the circular queue to the storage bin based on the distance of the storage bin from the storage bin exit;

[0021] Among them, the storage bin that is closer to the storage bin exit has a coordinate interval that is closer to the front in the circular queue, and the length of the coordinate interval corresponding to the storage bin in the circular queue corresponds to the number of storage units in the corresponding storage bin.

[0022] According to a storage bin allocation scheduling method provided by the present invention, the preset number of bits is the minimum number of binary bits that can represent the length of the circular queue.

[0023] The present invention also provides a storage bin allocation and scheduling device, comprising:

[0024] A queue allocation unit, configured to construct a circular queue based on the total amount of storage units of all storage bins in the storage repository, and allocate a coordinate interval of the circular queue to the storage bin;

[0025] A wafer box storage unit is used to, upon receiving a storage request for a wafer box to be stored corresponding to the same process node, convert the node number of the process node into a first binary number with a preset number of bits; determine a first shift bit number based on the minimum value of the number of free storage units in each storage bin at present; for any wafer box to be stored, perform a random number of cyclic left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts for each cyclic left shift is the first shift bit number, and determine the storage unit of any wafer box to be stored based on the coordinates corresponding to the hash value of the first random number in the circular queue;

[0026] Among them, the difference between a new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node to the left by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

[0027] The present invention also provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, it implements any of the storage bin allocation and scheduling methods described above.

[0028] The present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements any of the storage bin allocation and scheduling methods described above.

[0029] The present invention also provides a computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the storage bin allocation scheduling method as described above is implemented.

[0030] The present invention provides a storage bin allocation scheduling method, device, electronic device and storage medium. By constructing a circular queue and allocating a coordinate interval of the circular queue for the storage bin, when receiving a storage request for a wafer box to be stored corresponding to the same process node, the node number of the process node is converted into a first binary number of preset bits, and a first shift bit number is determined based on the minimum value of the number of free storage units in each storage bin at present, wherein the difference between a new binary number obtained by circularly shifting the first binary number corresponding to the node number of any process node to the left by the first shift bit number and the first binary number corresponding to the node number of the process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present, Therefore, for any wafer box to be stored, the first binary number corresponding to the node number of the process node is cyclically left-shifted a random number of times to obtain a first random number, wherein the number of left shifts in each cyclic left shift is the first number of shifts, and based on the coordinates corresponding to the hash value of the first random number in the circular queue, the storage unit of the wafer box to be stored is determined, which can ensure that wafer boxes loaded with wafers at the same process node will be dispersed and stored in different storage bins. Combined with the corresponding wafer box removal method, even if a lot of wafers of the same specification need to be taken out when entering a certain semiconductor process flow node later, it can be ensured that the taken-out wafer boxes are located in different storage bins, and the loads of each storage bin are balanced after they are taken out. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0032] Figure 1 It is a flow chart of a storage bin allocation and scheduling method provided by the present invention;

[0033] Figure 2 It is a schematic diagram of the cyclic left shift of a binary number provided by the present invention;

[0034] Figure 3 It is a structural schematic diagram of a storage bin allocation and scheduling device provided by the present invention;

[0035] Figure 4 It is a structural schematic diagram of the electronic device provided by the present invention. DETAILED DESCRIPTION

[0036] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0037] Figure 1 It is a flowchart of a storage bin allocation and scheduling method provided by the present invention, such as Figure 1 As shown, the method includes:

[0038] Step 110, constructing a circular queue based on the total amount of storage units of all storage bins in the storage repository, and allocating a coordinate interval of the circular queue to the storage bin;

[0039] Step 120, upon receiving a storage request for a wafer box to be stored corresponding to the same process node, converting the node number of the process node into a first binary number with a preset number of bits; determining a first shift bit number based on the minimum value of the number of free storage units in each storage bin at present; for any wafer box to be stored, performing a random number of cyclic left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts for each cyclic left shift is the first shift bit number, and determining the storage unit of any wafer box to be stored based on the coordinates corresponding to the hash value of the first random number in the circular queue;

[0040] Among them, the difference between a new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node to the left by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

[0041] Here, a circular queue of a preset length (assuming a decimal number M) can be designed first, where the length of the circular queue is the total number of storage units of all storage bins in the storage repository. Subsequently, a coordinate interval of the circular queue is allocated to each storage bin, and the length of the coordinate interval corresponding to the circular queue of any storage bin is the same as the number of storage units of the storage bin, so each coordinate in the coordinate interval corresponding to the storage bin corresponds to a storage unit in the storage bin. In some embodiments, when allocating a coordinate interval of the circular queue to each storage bin, it can be set based on the distance of each storage bin from the storage bin exit. For example, the closer the storage bin is to the storage bin exit, the closer the corresponding coordinate interval in the circular queue is, so that the wafer boxes corresponding to some of the front process nodes stored in a subsequent manner will be stored in the storage bin close to the storage bin exit, thereby improving the efficiency of taking out the wafer boxes corresponding to these front process nodes.

[0042] When receiving a storage request for a wafer box to be stored corresponding to the same process node, the node number of the process node (the node number can be preset) can be converted into a first binary number of a preset number of bits. Wherein, the node number of the process node is decimal, and the node number of a specific process node can be converted into a binary number of a preset number of bits by using the conversion method between decimal and binary to obtain its corresponding first binary number. Here, the preset number of bits is the minimum binary number that can represent the length of the circular queue M. For example, if M is 1000, the preset number of bits is 10; if M is 1025, the preset number of bits is 11 (because the maximum number of 10-bit binary numbers is 1023). Subsequently, based on the minimum value of the number of free storage units in each storage bin at present, the first shift number is determined. Wherein, the difference between the new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node by the first shift number and the first binary number corresponding to the node number of the process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present. Here, different values ​​of the first shift bit numbers may be tested in sequence for the first binary number corresponding to the node number of the process node, so as to find the first shift bit number that meets the conditions.

[0043] For any wafer box to be stored, the first binary number corresponding to the node number of the process node can be cyclically shifted left a random number of times to obtain a first random number, wherein the number of left shifts in each cyclic left shift is the first number of shifts. Figure 2 As shown, assuming that the first shift bit is 5, the binary number x n x n-1 ...x1x0 After a circular left shift, the new binary number obtained is x n-5 x n-6 ...x n-3 x n-4. Subsequently, based on the coordinates corresponding to the hash value of the first random number in the circular queue, the storage unit to be stored in the wafer box is determined. Among them, the first random number x can be converted into a decimal number x', and the hash value of x' is taken as hash(x')=x'mod(M). In some embodiments, the random number of the above-mentioned circular left shift is determined based on the current random interval, and the upper limit value of the current random interval is determined based on the number of wafer boxes currently stored in the storage library, wherein the more the number of wafer boxes currently stored in the storage library, the greater the upper limit value of the current random interval. After obtaining the coordinates corresponding to the hash value of the above-mentioned first random number in the circular queue, based on the coordinates corresponding to the hash value of the first random number in the circular queue, the storage unit corresponding to the coordinate is determined. If the state of the storage unit corresponding to the coordinate is occupied, the coordinates after the coordinate are traversed in sequence until the state of the storage unit corresponding to the current coordinate is idle, then the storage unit corresponding to the current coordinate is determined to be the storage unit to be stored in the wafer box; otherwise, the storage unit corresponding to the coordinate is determined to be the storage unit to be stored in the wafer box.

[0044] By determining the storage unit of each wafer box to be stored corresponding to the same process node through the above method, it can be ensured that the wafer boxes loaded with wafers at the same process node (even if stored in batches) will be dispersed and stored in different storage bins. In this way, even if a lot of wafers of the same specification need to be taken out when entering a certain semiconductor process flow node later, it can be ensured that the taken-out wafer boxes are located in different storage bins, and the load of each storage bin is balanced after taking them out.

[0045] Accordingly, when a batch wafer box removal request corresponding to the same process node is received, the node number of the process node can be converted into a second binary number of preset bits. It should be noted that the first binary number and the second binary number of the same process node are the same, and the first / second is only used to distinguish the wafer box storage link and the wafer box removal link. The subsequent first / second random number and the first / second shift number are also similar, which will not be repeated here. The second shift number is determined based on the minimum value of the number of free storage units in each storage bin at present. Among them, the second shift number is determined in a similar manner to the first shift number. The difference between the new binary number obtained by cyclically shifting the second binary number corresponding to the node number of any process node by the second shift number and the second binary number corresponding to the node number of the process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

[0046] For any wafer box removal request, the second binary number corresponding to the node number of the process node is cyclically left shifted a random number of times to obtain a second random number, wherein the number of left shifts for each cyclic left shift is the second number of shifts, and then based on the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong, the storage unit address of the wafer box to be removed corresponding to the wafer box removal request is determined. Among them, the process node corresponding to the wafer box stored in each occupied storage unit in the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong can be determined, and the storage unit address of the process node corresponding to the wafer box stored in the storage bin that is consistent with the process node corresponding to the wafer box removal request is randomly selected as the storage unit address of the wafer box to be removed corresponding to the wafer box removal request. In this way, the wafer boxes corresponding to the same process node can be removed in a dispersed manner, ensuring that the load of each storage bin is also balanced after the wafer boxes are taken out in batches.

[0047] In summary, the method provided by the embodiment of the present invention constructs a circular queue and allocates a coordinate interval of the circular queue to the storage bin. When receiving a storage request for a wafer box to be stored corresponding to the same process node, the node number of the process node is converted into a first binary number of a preset number of bits, and the first shift number of bits is determined based on the minimum value of the number of free storage units in each storage bin at present, wherein the difference between a new binary number obtained by circularly shifting the first binary number corresponding to the node number of any process node to the left by the first shift number of bits and the first binary number corresponding to the node number of the process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present, thereby The wafer box is stored, and the first binary number corresponding to the node number of the process node is cyclically left-shifted a random number of times to obtain a first random number, wherein the number of left shifts in each cyclic left shift is the first number of shifts, and based on the coordinates corresponding to the hash value of the first random number in the circular queue, the storage unit to be stored in the wafer box is determined, which can ensure that wafer boxes loaded with wafers at the same process node will be dispersed and stored in different storage bins. Combined with the corresponding wafer box removal method, even if a lot of wafers of the same specification need to be taken out when entering a certain semiconductor process flow node later, it can be ensured that the taken-out wafer boxes are located in different storage bins, and the loads of each storage bin are balanced after they are taken out.

[0048] A storage bin allocation and scheduling device provided by the present invention is described below. The storage bin allocation and scheduling device described below and the storage bin allocation and scheduling method described above can be referenced to each other.

[0049] Based on any of the above embodiments, Figure 3 Schematic diagram of a storage bin allocation and scheduling device provided by the present invention. Figure 3 As shown, the device comprises:

[0050] A queue allocation unit 310, configured to construct a circular queue based on the total amount of storage units of all storage bins in the storage repository, and allocate a coordinate interval of the circular queue to the storage bin;

[0051] The wafer box storage unit 320 is used to convert the node number of the process node into a first binary number with a preset number of bits when receiving a storage request for a wafer box to be stored corresponding to the same process node; determine a first shift bit number based on the minimum value of the number of free storage units in each storage bin at present; for any wafer box to be stored, perform a random number of cyclic left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts for each cyclic left shift is the first shift bit number, and determine the storage unit of any wafer box to be stored based on the coordinates corresponding to the hash value of the first random number in the circular queue;

[0052] Among them, the difference between a new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node to the left by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

[0053] The device provided by the embodiment of the present invention constructs a circular queue and allocates a coordinate interval of the circular queue to a storage bin. When receiving a storage request for a wafer box to be stored corresponding to the same process node, the node number of the process node is converted into a first binary number of a preset number of bits, and a first shift number of bits is determined based on the minimum value of the number of free storage units in each storage bin at present, wherein the difference between a new binary number obtained by circularly shifting the first binary number corresponding to the node number of any process node to the left by the first shift number of bits and the first binary number corresponding to the node number of the process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present, thereby The wafer box performs a random number of cyclic left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts in each cyclic left shift is the first number of shifts, and determines the storage unit to be stored in the wafer box based on the coordinates corresponding to the hash value of the first random number in the circular queue. This ensures that wafer boxes loaded with wafers at the same process node will be dispersedly stored in different storage bins. Combined with the corresponding wafer box removal method, even if a lot of wafers of the same specification need to be taken out when entering a certain semiconductor process flow node later, it can ensure that the taken-out wafer boxes are located in different storage bins, and the loads of each storage bin are balanced after they are taken out.

[0054] Based on any of the above embodiments, determining any storage unit to be stored in the wafer box based on the coordinates corresponding to the hash value of the first random number in the circular queue includes:

[0055] Determine, based on the coordinates corresponding to the hash value of the first random number in the circular queue, a storage unit corresponding to the coordinates;

[0056] If the state of the storage unit corresponding to the coordinate is occupied, the coordinates after the coordinate are traversed in sequence until the state of the storage unit corresponding to the current coordinate is free, and the storage unit corresponding to the current coordinate is determined to be any storage unit to be stored in the wafer box;

[0057] Otherwise, it is determined that the storage unit corresponding to the coordinate is any storage unit to be stored in the wafer box.

[0058] Based on any of the above embodiments, the random number is determined based on the current random interval; the upper limit value of the current random interval is determined based on the number of wafer boxes currently stored in the repository, and the more wafer boxes currently stored in the repository, the larger the upper limit value of the current random interval.

[0059] Based on any of the above embodiments, when a batch wafer box removal request corresponding to the same process node is received, the node number of the process node is converted into a second binary number of the preset number of bits; based on the minimum value of the number of free storage units in each storage bin at present, the second shift bit number is determined; for any wafer box removal request, the second binary number corresponding to the node number of the process node is cyclically left-shifted a random number of times to obtain a second random number, wherein the number of left shifts in each cyclic left shift is the second shift bit number, and based on the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong, the storage unit address of the wafer box to be removed corresponding to any wafer box removal request is determined;

[0060] Among them, the difference between a new binary number obtained by cyclically shifting the second binary number corresponding to the node number of any process node to the left by the second shift bit number and the second binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

[0061] Based on any of the above embodiments, the determining the storage unit address of the wafer box to be taken out corresponding to any wafer box take-out request based on the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong, includes:

[0062] Determining a process node corresponding to a wafer box stored in each occupied storage unit in the storage bin;

[0063] A storage unit address whose process node corresponding to the wafer box stored in the storage bin is consistent with the process node corresponding to any wafer box removal request is randomly selected as the storage unit address of the wafer box to be removed corresponding to any wafer box removal request.

[0064] Based on any of the above embodiments, allocating a coordinate interval of the circular queue to the storage bin includes:

[0065] Allocating a coordinate interval of the circular queue to the storage bin based on the distance of the storage bin from the storage bin exit;

[0066] Among them, the storage bin that is closer to the storage bin exit has a coordinate interval that is closer to the front in the circular queue, and the length of the coordinate interval corresponding to the storage bin in the circular queue corresponds to the number of storage units in the corresponding storage bin.

[0067] Based on any of the above embodiments, the preset number of bits is the minimum number of binary bits that can represent the length of the circular queue.

[0068] Figure 4 is a schematic diagram of the structure of the electronic device provided by the present invention, such as Figure 4 As shown, the electronic device may include: a processor (processor) 410, a memory (memory) 420, a communication interface (Communications Interface) 430 and a communication bus 440, wherein the processor 410, the memory 420, and the communication interface 430 communicate with each other through the communication bus 440. The processor 410 can call the logic instructions in the memory 420 to execute a storage bin allocation scheduling method, which includes: constructing a circular queue based on the total number of storage units of all storage bins in the storage library, and allocating a coordinate interval of the circular queue to the storage bin; when receiving a storage request for a wafer box to be stored corresponding to the same process node, converting the node number of the process node into a first binary number with a preset number of bits; determining a first shift bit number based on the minimum number of free storage units in each storage bin at present; for any wafer box to be stored, performing a random number of circular left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts for each circular left shift is the first shift bit number, and determining any storage unit to be stored in the wafer box based on the coordinate corresponding to the hash value of the first random number in the circular queue; wherein the difference between a new binary number obtained by circularly shifting the first binary number corresponding to the node number of any process node by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum number of free storage units in each storage bin at present.

[0069] In addition, the logic instructions in the above-mentioned memory 420 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0070] On the other hand, the present invention also provides a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer can execute a storage bin allocation scheduling method provided by the above methods, the method including: constructing a circular queue based on the total number of storage units of all storage bins in the storage library, and allocating coordinate intervals of the circular queue to the storage bins; upon receiving a storage request corresponding to a wafer box to be stored in the same process node, converting the node number of the process node into a first binary number of a preset number of bits; based on the maximum number of free storage units in each storage bin at present, a small value, determining a first shift bit number; for any wafer box to be stored, performing a random number of cyclic left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts for each cyclic left shift is the first shift bit number, and determining any storage unit to be stored in the wafer box based on the coordinates corresponding to the hash value of the first random number in the circular queue; wherein the difference between a new binary number obtained by cyclically left shifting the first binary number corresponding to the node number of any process node by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each current storage bin.

[0071] On the other hand, the present invention also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which is implemented when the processor executes the above-mentioned storage bin allocation scheduling method, the method comprising: constructing a circular queue based on the total number of storage units of all storage bins in the storage library, and allocating a coordinate interval of the circular queue to the storage bin; upon receiving a storage request for a wafer box to be stored corresponding to the same process node, converting the node number of the process node into a first binary number with a preset number of bits; determining a first shift number based on the minimum number of free storage units in each storage bin at present; for any wafer box to be stored, A circular box, performs a random number of cyclic left shifts on the first binary number corresponding to the node number of the process node to obtain a first random number, wherein the number of left shifts for each cyclic left shift is the first number of shifts, and determines any storage unit to be stored in the wafer box based on the coordinates corresponding to the hash value of the first random number in the circular queue; wherein the difference between a new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node by the first number of shifts is greater than or equal to the minimum number of free storage units in each storage bin.

[0072] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0073] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0074] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A storage warehouse allocation and scheduling method, characterized in that: include: Based on the total amount of storage units of all storage bins in the repository, a circular queue is constructed, and a coordinate interval of the circular queue is allocated to the storage bin; When receiving a storage request for a wafer box to be stored corresponding to the same process node, converting the node number of the process node into a first binary number of a preset number of bits; Determine the first shift number based on the minimum value of the number of free storage units in each storage bin at present; For any wafer box to be stored, a first binary number corresponding to the node number of the process node is cyclically left-shifted a random number of times to obtain a first random number, wherein the number of left shift bits of each cyclic left shift is the first shift bit number, and based on the coordinates corresponding to the hash value of the first random number in the circular queue, the storage unit of any wafer box to be stored is determined; The difference between a new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node to the left by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present; The determining of any storage unit to be stored in the wafer box based on the coordinates corresponding to the hash value of the first random number in the circular queue comprises: Determine, based on the coordinates corresponding to the hash value of the first random number in the circular queue, a storage unit corresponding to the coordinates; If the state of the storage unit corresponding to the coordinate is occupied, the coordinates after the coordinate are traversed in sequence until the state of the storage unit corresponding to the current coordinate is free, and the storage unit corresponding to the current coordinate is determined to be any storage unit to be stored in the wafer box; Otherwise, it is determined that the storage unit corresponding to the coordinate is any storage unit to be stored in the wafer box.

2. A storage warehouse allocation and scheduling method according to claim 1, characterized in that: The random number is determined based on the current random interval; the upper limit value of the current random interval is determined based on the number of wafer boxes currently stored in the repository, and the more wafer boxes currently stored in the repository, the larger the upper limit value of the current random interval.

3. A storage warehouse allocation and scheduling method according to claim 1, characterized in that: When receiving a batch wafer box removal request corresponding to the same process node, converting the node number of the process node into a second binary number of the preset number of bits; Based on the minimum value of the number of free storage units in each storage bin at present, determining the second shift bit number; for any wafer box take-out request, performing a random number of cyclic left shifts on the second binary number corresponding to the node number of the process node to obtain a second random number, wherein the number of left shifts for each cyclic left shift is the second shift bit number, and based on the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong, determining the storage unit address of the wafer box to be taken out corresponding to any wafer box take-out request; Among them, the difference between a new binary number obtained by cyclically shifting the second binary number corresponding to the node number of any process node to the left by the second shift bit number and the second binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present.

4. A storage warehouse allocation and scheduling method according to claim 3, characterized in that: The determining, based on the storage bin to which the coordinates corresponding to the hash value of the second random number in the circular queue belong, a storage unit address of the wafer box to be taken out corresponding to any wafer box take-out request comprises: Determining a process node corresponding to a wafer box stored in each occupied storage unit in the storage bin; A storage unit address whose process node corresponding to the wafer box stored in the storage bin is consistent with the process node corresponding to any wafer box removal request is randomly selected as the storage unit address of the wafer box to be removed corresponding to any wafer box removal request.

5. A storage warehouse allocation and scheduling method according to any one of claims 1 to 4, characterized in that: The allocating the coordinate interval of the circular queue to the storage bin includes: Allocating a coordinate interval of the circular queue to the storage bin based on the distance of the storage bin from the storage bin exit; Among them, the storage bin that is closer to the storage bin exit has a coordinate interval that is closer to the front in the circular queue, and the length of the coordinate interval corresponding to the storage bin in the circular queue corresponds to the number of storage units in the corresponding storage bin.

6. A storage warehouse allocation and scheduling method according to any one of claims 1 to 4, characterized in that: The preset number of bits is the minimum number of binary bits that can represent the length of the circular queue.

7. A storage warehouse allocation and scheduling device, characterized in that: include: A queue allocation unit, configured to construct a circular queue based on the total amount of storage units of all storage bins in the storage repository, and allocate a coordinate interval of the circular queue to the storage bin; A wafer box storage unit is used to convert the node number of the process node into a first binary number of preset bits when receiving a storage request for a wafer box to be stored corresponding to the same process node; Determine the first shift number based on the minimum value of the number of free storage units in each storage bin at present; For any wafer box to be stored, a first binary number corresponding to the node number of the process node is cyclically left-shifted a random number of times to obtain a first random number, wherein the number of left shift bits of each cyclic left shift is the first shift bit number, and based on the coordinates corresponding to the hash value of the first random number in the circular queue, the storage unit of any wafer box to be stored is determined; The difference between a new binary number obtained by cyclically shifting the first binary number corresponding to the node number of any process node to the left by the first shift bit number and the first binary number corresponding to the node number of any process node is greater than or equal to the minimum value of the number of free storage units in each storage bin at present; The determining of any storage unit to be stored in the wafer box based on the coordinates corresponding to the hash value of the first random number in the circular queue includes: Determine, based on the coordinates corresponding to the hash value of the first random number in the circular queue, a storage unit corresponding to the coordinates; If the state of the storage unit corresponding to the coordinate is occupied, the coordinates after the coordinate are traversed in sequence until the state of the storage unit corresponding to the current coordinate is free, and the storage unit corresponding to the current coordinate is determined to be any storage unit to be stored in the wafer box; Otherwise, it is determined that the storage unit corresponding to the coordinate is any storage unit to be stored in the wafer box.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, a storage bin allocation scheduling method as described in any one of claims 1 to 6 is implemented.

9. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, it implements a storage bin allocation scheduling method as described in any one of claims 1 to 6.

Images