CN111580952A - Method and apparatus for assigning a multi-tasking set to cache ways - Google Patents
Method and apparatus for assigning a multi-tasking set to cache ways Download PDFInfo
- Publication number
- CN111580952A CN111580952A CN201910120227.2A CN201910120227A CN111580952A CN 111580952 A CN111580952 A CN 111580952A CN 201910120227 A CN201910120227 A CN 201910120227A CN 111580952 A CN111580952 A CN 111580952A
- Authority
- CN
- China
- Prior art keywords
- cache
- cache way
- way
- bits
- multitask
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004590 computer program Methods 0.000 claims description 10
- 230000008569 process Effects 0.000 abstract description 9
- 230000000694 effects Effects 0.000 abstract description 5
- 238000012544 monitoring process Methods 0.000 abstract description 4
- 238000004220 aggregation Methods 0.000 description 18
- 238000010586 diagram Methods 0.000 description 13
- 238000004891 communication Methods 0.000 description 7
- 230000002776 aggregation Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000002159 abnormal effect Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000013102 re-test Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
Abstract
The invention discloses a method and a device for distributing a multitask set to a cache way, and relates to the field of warehouse logistics. One embodiment of the method comprises: applying for a cache way according to the task type of a multitask set, and establishing a binding relationship between the multitask set and the cache way; acquiring the number of idle cache bits of the cache way in real time, and issuing a picking container to the bound cache way according to the number of the idle cache bits; and judging whether the picking containers contained in the multitask set are all issued to the bound cache way, if so, removing the binding relation between the multitask set and the cache way, and enabling the cache way to enter a to-be-bound state. According to the implementation mode, the technical means of monitoring the number of idle cache bits of the cache way in real time is adopted, the multitask set is reasonably distributed to the cache way, the technical problems that cache way resources are wasted and abnormity occurs due to cache way congestion are solved, and the technical effects of improving the conveying line efficiency and reducing waiting time and process abnormity are achieved.
Description
Technical Field
The invention relates to the field of warehouse logistics, in particular to a method and a device for distributing a multitask set to a cache way.
Background
In wisdom storage commodity circulation, what the mode of the collection of buffer memory way adopted in the past is the promotion formula, and the concrete description is: when all the picking containers of the multi-aggregation collection sheet (i.e. the multi-task collection in the embodiment of the present invention) are collected in the concentration area, it needs to determine whether there is an available free cache way, and when it is determined that there is a free cache way, all the picking containers under the collection sheet are issued to the cache way at one time. After all the picking containers are checked, the cache way is released to accept new multi-combination collection lists.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
1. one cache way can only be occupied by one multi-combination bill at a time, and if the number of picking containers of the multi-combination bill is small and the occupied amount of the cache way is large, a large amount of cache way vacant spaces are wasted.
2. When all the cache ways are released, after rechecking is completed, cache way resources are wasted, so that the efficiency of a transmission line is low, and congestion often occurs when the single quantity of a multi-combination aggregate list is large.
3. If the number of the issued picking containers is larger than the capacity of the cache way, the excessive picking containers cannot enter and overflow to the abnormal port.
4. The staff member needs to wait for all the picking containers to reach the cache way, and then the rechecking task can be started.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for allocating a multitask set to a cache way, so as to reasonably allocate the multitask set to the cache way, and solve the problems of wasted cache way resources and abnormal situations caused by congestion of the cache way.
To achieve the above object, according to an aspect of the embodiments of the present invention, there is provided a method for allocating a multitask set to a cache way, including:
applying for a cache way according to the task type of the multitask set, and establishing a binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set;
acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to a bound cache way according to the number of the idle cache bits;
and judging whether the picking containers contained in the multitask set are all issued to the bound cache ways, if so, removing the binding relation between the multitask set and the cache ways, and enabling the cache ways to enter a to-be-bound state.
Optionally, the applying for a cache way according to the task type of the multitask set, and establishing a binding relationship between the multitask set and the cache way according to the number of current free cache bits in the returned cache way and the number of pick-up containers included in the multitask set includes:
judging whether a history binding cache way exists in the multitask set or not;
if so, returning the history bound cache way, and establishing the binding relationship between the multitask set and the history bound cache way;
if not, determining a returned cache way in the cache way corresponding to the task type of the multitask set according to the priority information of the cache way, and establishing the binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set.
Optionally, the determining, according to the priority information of the cache way, the returned cache way includes:
determining the priority information of the cache way according to the number of the current idle cache bits, wherein the cache way has higher priority when the number of the current idle cache bits is larger;
if the number of the current idle cache bits is the same, determining the priority information of the cache way according to the single-day arrival amount, wherein the priority of the cache way is higher when the current single-day arrival amount is less;
and determining the returned cache ways according to the priority information of the cache ways, wherein the number of the returned cache ways does not exceed the number of the multitask sets of the currently applied cache ways.
Optionally, establishing a binding relationship between the multitask set and the cache way according to the number of currently free cache bits in the returned cache way and the number of picking containers contained in the multitask set, including:
determining an absolute value of a difference between a current number of free cache bits in a returned cache way and a number of pick containers included in the multitasking set;
and establishing a binding relationship between the multitask set and the cache way according to the sequence of the absolute values of the difference values from small to large, wherein the multitask set and the cache way are bound one by one.
Optionally, the obtaining the number of free cache bits of the cache way in real time, and issuing the pick-up container to the bound cache way according to the number of free cache bits includes:
acquiring the number of idle cache bits of a cache way in real time according to the state of the photoelectric equipment arranged on the cache bits;
according to the number of the idle cache bits of the cache way, issuing goods picking containers which do not exceed the number of the idle cache bits of the cache way to the bound cache way;
and sending all the picking containers contained in the multitask set to the bound cache ways.
Optionally, before applying for a cache way according to a task type of the multitask set, the method further includes:
presetting application time;
and after the application time is reached, determining a multitask set of which all the picking containers reach a centralized area, and determining the task types of the multitask set.
According to another aspect of the embodiments of the present invention, there is provided an apparatus for allocating a multitask set to a cache way, including:
a binding module to: applying for a cache way according to the task type of the multitask set, and establishing a binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set;
the issuing module is used for: acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to a bound cache way according to the number of the idle cache bits;
an unbinding module to: and judging whether the picking containers contained in the multitask set are all issued to the bound cache ways, if so, removing the binding relation between the multitask set and the cache ways, and enabling the cache ways to enter a to-be-bound state.
Optionally, the binding module is further configured to:
judging whether a history binding cache way exists in the multitask set or not;
if yes, returning to the history bound cache way, and establishing a binding relation between the multitask set and the history bound cache way;
if not, determining a returned cache way in the cache way corresponding to the task type of the multitask set according to the priority information of the cache way, and establishing the binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set.
Optionally, the binding module is further configured to:
determining the priority information of the cache way according to the number of the current idle cache bits, wherein the cache way has higher priority when the number of the current idle cache bits is larger;
if the number of the current idle cache bits is the same, determining the priority information of the cache way according to the single-day arrival amount, wherein the priority of the cache way is higher when the current single-day arrival amount is less;
and determining the returned cache ways according to the priority information of the cache ways, wherein the number of the returned cache ways does not exceed the number of the multitask sets of the currently applied cache ways.
Optionally, the binding module is further configured to:
determining an absolute value of a difference between a current number of free cache bits in a returned cache way and a number of pick containers included in the multitasking set;
and establishing a binding relationship between the multitask set and the cache way according to the sequence of the absolute values of the difference values from small to large, wherein the multitask set and the cache way are bound one by one.
Optionally, the issuing module is further configured to:
acquiring the number of idle cache bits of a cache way in real time according to the state of the photoelectric equipment arranged on the cache bits;
according to the number of the idle cache bits of the cache way, issuing goods picking containers which do not exceed the number of the idle cache bits of the cache way to the bound cache way;
and sending all the picking containers contained in the multitask set to the bound cache ways.
Optionally, the binding module is further configured to:
presetting application time;
and after the application time is reached, determining a multitask set of which all the picking containers reach a centralized area, and determining the task types of the multitask set.
According to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; a storage device, configured to store one or more programs that, when executed by the one or more processors, cause the one or more processors to implement a method for allocating a multitask set to a cache way according to an embodiment of the present invention.
According to a further aspect of embodiments of the present invention, there is provided a computer readable medium having stored thereon a computer program which, when executed by a processor, implements a method of allocating a multitask set to cache ways as provided by embodiments of the present invention.
One embodiment of the above invention has the following advantages or benefits: because the technical means of monitoring the number of idle cache bits of the cache way in real time is adopted, the multitask set is reasonably distributed to the cache way, the technical problems that cache way resources are wasted and the cache way is blocked up to cause abnormity are solved, and the technical effects of improving the efficiency of a conveying line and reducing waiting time and process abnormity are achieved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of a basic flow of a method of allocating a multitask set to a cache way according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a preferred flow of a method of allocating a multitask set to a cache way according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating the basic modules of an apparatus for assigning a multitask set to a cache way, according to an embodiment of the present invention;
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 5 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The technical wording appearing in the embodiments of the present invention is explained as follows:
caching a channel: the system binds the task type and the physical crossing number to generate a concept, and when the task is issued, the specified crossing can be screened according to the task type.
Multi-up collection sheet (i.e., multitask collection): a multiple collection sheet represents a collection sheet containing multiple pick containers.
A cache bit: a location in the cache way for storing a pick container.
Concentration area: the goods picking containers with multiple gathering lists are gathered in the concentration area in the temporary storage area of the goods picking containers, and then follow-up operation is carried out.
Single day arrival volume: the number of picking containers received a day is cached by the current time.
Cache way of historical binding: the singly bound cache ways are aggregated.
Fig. 1 is a schematic diagram of a basic flow of a method for allocating a multitask set to a cache way according to an embodiment of the present invention, and as shown in fig. 1, a method for allocating a multitask set to a cache way includes:
s101, applying for a cache way according to the task type of a multi-aggregate collection sheet (collection sheet for short), and establishing the binding relationship between the multi-aggregate collection sheet and the cache way according to the current idle cache bit number in the returned cache way and the number of picking containers (containers for short) contained in the multi-aggregate collection sheet;
s102, acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to a bound cache way according to the number of the idle cache bits;
and S103, judging whether the picking containers contained in the multi-collection list are all issued to the bound cache ways, and if so, releasing the binding relationship between the multi-collection list and the cache ways to enable the cache ways to enter a to-be-bound state.
The embodiment of the invention reasonably distributes the multi-combination list to the cache way by adopting the technical means of monitoring the number of idle cache bits of the cache way in real time, overcomes the technical problems that the cache way resource is wasted and the exception occurs due to the cache way congestion, and further achieves the technical effects of improving the transmission line efficiency and reducing the waiting time and the process exception.
In step S101 of the embodiment of the present invention, applying for a cache way according to a task type of a multiple aggregation sheet, and establishing a binding relationship between the multiple aggregation sheet and the cache way according to a current free cache bit number in a returned cache way and a number of picking containers included in the multiple aggregation sheet includes: judging whether a history binding cache way exists in the multi-combination collection list; if so, returning the history bound cache way, and establishing the binding relationship between the multi-combination collection list and the history bound cache way; if not, determining a returned cache way in the cache way corresponding to the task type of the multi-aggregation list according to the priority information of the cache way, and establishing the binding relationship between the multi-aggregation list and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multi-aggregation list.
Based on the foregoing embodiment, in the embodiment of the present invention, determining the returned cache way according to the priority information of the cache way includes: determining the priority information of the cache way according to the number of the current idle cache bits, wherein the cache way has higher priority when the number of the current idle cache bits is larger; if the number of the current idle cache bits is the same, determining the priority information of the cache way according to the single-day arrival amount, wherein the priority of the cache way is higher when the current single-day arrival amount is less; and determining the returned cache ways according to the priority information of the cache ways, wherein the number of the returned cache ways does not exceed the number of the multi-combination lists of the currently applied cache ways. And determining the returned cache way according to the current priority information of the cache way, so that the distribution of the collection list is more reasonable.
In step S101 of the embodiment of the present invention, establishing a binding relationship between the multiple aggregate manifest and the cache way according to the number of currently idle cache bits in the returned cache way and the number of picking containers included in the multiple aggregate manifest, includes: determining an absolute value of a difference between a current number of free cache bits in a returned cache way and a number of pick containers contained in the multiple-aggregation manifest; and establishing the binding relationship between the multi-combination collection list and the cache way according to the sequence of the absolute values of the differences from small to large. The multiple-combination collection list is bound with the cache way one by one, namely one multiple-combination collection list is bound with one cache way, and meanwhile, one cache way is also bound with only one collection list at a time. And the binding relation is established according to the absolute value of the difference, so that the distribution of the collection list is more reasonable.
In step S101 of the embodiment of the present invention, before applying for a cache way according to a task type of a multi-aggregation menu, the method further includes: presetting application time; and after the application time is reached, determining the multi-item collection list of which the picking container completely reaches the centralized area, and determining the task type of the multi-item collection list. In the embodiment of the invention, after all the picking containers are collected in the collecting area under the multi-collection list, the cache way is applied in batches at regular time, and compared with the prior art, the method is more accurate and efficient.
In step S102 of the embodiment of the present invention, the obtaining the number of idle cache bits of the cache way in real time, and issuing the pick-up container to the bound cache way according to the number of idle cache bits includes: acquiring the number of idle cache bits of a cache way in real time according to the state of the photoelectric equipment arranged on the cache bits; according to the number of the idle cache bits of the cache way, issuing goods picking containers which do not exceed the number of the idle cache bits of the cache way to the bound cache way; and sending all the picking containers contained in the multi-collection list to the bound cache ways. Due to the new characteristic that the buffer channel has empty box positions, even if the goods picking containers are not moved down in time, the situation that the goods picking containers overflow from the subsequent goods picking containers does not occur, and meanwhile, the efficiency maximization of the conveying line is guaranteed. Because the cache bit is provided with corresponding photoelectric equipment, when the photoelectric equipment is changed, the equipment can report to a WCS (logistics management system-basic level equipment logistics control automation system) in time, and the WCS can update the vacancy condition of the cache way at the first time. Therefore, even if the goods picking container is not moved, the WMS (warehouse management system) can issue a specified number of container warehouse-out tasks according to the real-time vacancy information of the WCS. Under normal system conditions, no container overflow occurs. And because the vacancy is updated in real time, the binding relationship can be released by collecting the collection sheets, the next collection sheet can be bound at the first time, and the vacancy which is more than the previous collection sheet can be utilized in time.
In step S102 of the embodiment of the present invention, after acquiring the number of free cache bits of the cache way in real time and sequentially issuing the pick-up containers to the bound cache ways according to the number of free cache bits, the method further includes: and after the picking container is positioned to the bound cache way, performing rechecking operation on the picking container. And after each picking container reaches the cache way, the re-inspection operation is executed, and workers do not need to care whether all the picking containers are collected or not, so that the re-checking speed is increased.
Fig. 2 is a schematic diagram of a preferred process of allocating a multitask aggregation to a cache way according to an embodiment of the present invention, as shown in fig. 2, the arrival of picking containers in the same batch of aggregation sheets in a centralized area is monitored, and each time a picking container arrives in the centralized area, the picking containers are reported to the WMS, and the WMS determines whether all picking containers of an aggregation sheet are aggregated in the centralized area. After judging that the cache is collected, the WMS applies for a free cache way of the specified task type from the WCS. The WCS recommends the cache way to return to the WMS according to a preset rule (or priority information of the cache way). The WMS has the total number of the picking containers under each collection sheet, can regularly judge whether the concentration area has the collected collection sheets or not, and regularly applies for the available cache ways in batches. The WCS can update the buffer channel vacancy fed back by the equipment in real time, and the WMS can apply for a proper buffer channel at the first time. The WMS applies for an idle cache way, and the logic of the WCS for returning the cache way specifically comprises the following steps: the WMS transmits the task type and the collection list number, and the WCS preferentially returns the cache channel bound by the collection list. If no cache way is bound, preferentially distributing the way crossing with more empty spaces and less single-day arrival quantity to preferentially return according to the corresponding task type. And locking the returned crossing in the system to prevent concurrent application, then, automatically distributing the applied cache crossing by the WMS, and calling the WCS interface to perform binding relation according to the number of empty bits. The WCS feeds back whether the binding is successful. And the WMS selects the cache channel and applies for the WCS to bind the relationship between the collection sheet and the cache channel so as to prevent other collection sheets from being occupied. And the WMS issues corresponding amount of tasks in the export concentration area to the WCS according to the number of idle cache bits. The WCS informs the equipment to output the corresponding goods picking container from the centralized area to the appointed buffer road junction. And each picking container executes the retest operation after reaching the cache crossing, the equipment reports the number of the reached picking containers to the WMS, the WMS judges whether all the picking containers under the collection list reach the cache crossing, the cache crossing is released after all the picking containers reach the cache crossing, and the cache crossing can receive a new binding relationship so that the free cache position in the cache crossing can allow the picking containers under other collection lists to occupy.
Fig. 3 is a schematic diagram of basic modules of an apparatus for allocating a multitask set to a cache way according to an embodiment of the present invention, and as shown in fig. 3, an apparatus for allocating a multitask set to a cache way includes:
a binding module 301 configured to: applying for a cache way according to the task type of the multi-combination collection list, and establishing the binding relationship between the multi-combination collection list and the cache way according to the current idle cache bit number in the returned cache way and the number of picking containers contained in the multi-combination collection list;
the issuing module 302 is configured to: acquiring the number of idle cache bits of the cache way in real time, and issuing a picking container to the bound cache way according to the number of the idle cache bits;
an unbinding module 303 configured to: and judging whether the picking containers contained in the multi-collection list are all issued to the bound cache way, if so, removing the binding relation between the multi-collection list and the cache way, and enabling the cache way to enter a to-be-bound state.
In this embodiment of the present invention, the binding module 301 is further configured to: judging whether a history binding cache way exists in the multi-combination collection list; if yes, returning to the history bound cache way, and establishing the binding relation between the multi-combination collection list and the history bound cache way; if not, determining a returned cache way in the cache way corresponding to the task type of the multiple-aggregation collection sheet according to the priority information of the cache way, and establishing the binding relationship between the multiple-aggregation collection sheet and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multiple-aggregation collection sheet.
In this embodiment of the present invention, the binding module 301 is further configured to: determining the priority information of the cache way according to the number of the current idle cache bits, wherein the cache way has higher priority when the number of the current idle cache bits is larger; if the number of the current idle cache bits is the same, determining the priority information of the cache way according to the single-day arrival amount, wherein the priority of the cache way is higher when the current single-day arrival amount is less; and determining the returned cache ways according to the priority information of the cache ways, wherein the number of the returned cache ways does not exceed the number of the multi-combination lists of the currently applied cache ways.
In this embodiment of the present invention, the binding module 301 is further configured to: determining an absolute value of a difference between a current number of free cache bits in a returned cache way and a number of pick containers contained in the multiple-aggregation manifest; and establishing a binding relationship between the multi-combination collection list and the cache way according to the sequence of the absolute values of the difference values from small to large, wherein the multi-combination collection list and the cache way are bound one by one.
In this embodiment of the present invention, the issuing module 302 is further configured to: acquiring the number of idle cache bits of a cache way in real time according to the state of the photoelectric equipment arranged on the cache bits; according to the number of the idle cache bits of the cache way, issuing goods picking containers which do not exceed the number of the idle cache bits of the cache way to the bound cache way; and sending all the picking containers contained in the multi-collection list to the bound cache ways.
In an embodiment of the present invention, the apparatus further includes a rechecking module, configured to: and after the picking container is positioned to the bound cache way, performing rechecking operation on the picking container.
In this embodiment of the present invention, the binding module 301 is further configured to: presetting application time; and after the application time is reached, determining the multi-item collection list of which the picking container completely reaches the centralized area, and determining the task type of the multi-item collection list.
FIG. 4 illustrates an exemplary system architecture 400 of a method for multitask set allocation to cache ways or an apparatus for multitask set allocation to cache ways to which embodiments of the present invention may be applied.
As shown in fig. 4, the system architecture 400 may include terminal devices 401, 402, 403, a network 404, and a server 405. The network 404 serves as a medium for providing communication links between the terminal devices 401, 402, 403 and the server 405. Network 404 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 401, 402, 403 to interact with a server 405 over a network 404 to receive or send messages or the like. The terminal devices 401, 402, 403 may have various communication client applications installed thereon, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, and the like.
The terminal devices 401, 402, 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 405 may be a server that provides various services, such as a background management server that supports shopping websites browsed by users using the terminal devices 401, 402, and 403. The background management server can analyze and process the received data such as the product information inquiry request and feed back the processing result to the terminal equipment.
It should be noted that the method for allocating the multi-aggregation list to the cache way provided by the embodiment of the present invention is generally executed by the server 405, and accordingly, the apparatus for allocating the multi-aggregation list to the cache way is generally disposed in the server 405.
It should be understood that the number of terminal devices, networks, and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
The invention also provides an electronic device and a computer-readable storage medium according to the embodiments of the invention.
An electronic device of an embodiment of the present invention includes: one or more processors; the storage device is used for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors realize the method for allocating the multitask set to the cache way.
A computer readable medium of an embodiment of the present invention stores thereon a computer program, which when executed by a processor implements the method for allocating a multitask set to a cache way according to the present invention.
Referring now to FIG. 5, shown is a block diagram of a computer system 500 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU)501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 501.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor comprises a binding module, a sending module and an unbinding module. The names of these modules do not form a limitation on the module itself in some cases, for example, the binding module may also be described as a "module for establishing a binding relationship between the multi-union collection and the cache way".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: applying for a cache way according to the task type of the multitask set, and establishing a binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set; acquiring the number of idle cache bits of the cache way in real time, and issuing a picking container to the bound cache way according to the number of the idle cache bits; and judging whether the picking containers contained in the multitask set are all issued to the bound cache way, if so, removing the binding relation between the multitask set and the cache way, and enabling the cache way to enter a to-be-bound state.
According to the technical scheme of the embodiment of the invention, because the multitask set is reasonably distributed to the cache way by adopting the technical means of monitoring the number of idle cache bits of the cache way in real time, the technical problems that the cache way resource is wasted and the cache way is abnormal due to congestion are solved, and the technical effects of improving the transmission line efficiency and reducing the waiting time and process abnormity are achieved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (14)
1. A method for assigning a multitask set to a cache way, comprising:
applying for a cache way according to the task type of the multitask set, and establishing a binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set;
acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to a bound cache way according to the number of the idle cache bits;
and judging whether the picking containers contained in the multitask set are all issued to the bound cache ways, if so, removing the binding relation between the multitask set and the cache ways, and enabling the cache ways to enter a to-be-bound state.
2. The method of claim 1, wherein applying for a cache way according to task types of a multitask set, and establishing a binding relationship between the multitask set and the cache way according to the number of currently free cache bits in the returned cache way and the number of pick containers included in the multitask set comprises:
judging whether a history binding cache way exists in the multitask set or not;
if so, returning the history bound cache way, and establishing the binding relationship between the multitask set and the history bound cache way;
if not, determining a returned cache way in the cache way corresponding to the task type of the multitask set according to the priority information of the cache way, and establishing the binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set.
3. The method of claim 2, wherein determining the returned cache way according to the priority information of the cache way comprises:
determining the priority information of the cache way according to the number of the current idle cache bits, wherein the cache way has higher priority when the number of the current idle cache bits is larger;
if the number of the current idle cache bits is the same, determining the priority information of the cache way according to the single-day arrival amount, wherein the priority of the cache way is higher when the current single-day arrival amount is less;
and determining the returned cache ways according to the priority information of the cache ways, wherein the number of the returned cache ways does not exceed the number of the multitask sets of the currently applied cache ways.
4. The method of claim 1 or 2, wherein establishing the binding relationship between the multitask set and the cache way according to the current free cache bit number in the returned cache way and the number of picking containers contained in the multitask set comprises:
determining an absolute value of a difference between a current number of free cache bits in a returned cache way and a number of pick containers included in the multitasking set;
and establishing a binding relationship between the multitask set and the cache way according to the sequence of the absolute values of the difference values from small to large, wherein the multitask set and the cache way are bound one by one.
5. The method of claim 1, wherein the obtaining the number of free buffer bits of the buffer lane in real time and issuing the pick container to the bound buffer lane according to the number of free buffer bits comprises:
acquiring the number of idle cache bits of a cache way in real time according to the state of the photoelectric equipment arranged on the cache bits;
according to the number of the idle cache bits of the cache way, issuing goods picking containers which do not exceed the number of the idle cache bits of the cache way to the bound cache way;
and sending all the picking containers contained in the multitask set to the bound cache ways.
6. The method of claim 1, wherein prior to applying for a cache way according to a task type of the multitasking set, the method further comprises:
presetting application time;
and after the application time is reached, determining a multitask set of which all the picking containers reach a centralized area, and determining the task types of the multitask set.
7. An apparatus for assigning a multitask set to a cache way, comprising:
a binding module to: applying for a cache way according to the task type of the multitask set, and establishing a binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set;
the issuing module is used for: acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to a bound cache way according to the number of the idle cache bits;
an unbinding module to: and judging whether the picking containers contained in the multitask set are all issued to the bound cache ways, if so, removing the binding relation between the multitask set and the cache ways, and enabling the cache ways to enter a to-be-bound state.
8. The apparatus of claim 7, wherein the binding module is further configured to:
judging whether a history binding cache way exists in the multitask set or not;
if so, returning the history bound cache way, and establishing the binding relationship between the multitask set and the history bound cache way;
if not, determining a returned cache way in the cache way corresponding to the task type of the multitask set according to the priority information of the cache way, and establishing the binding relationship between the multitask set and the cache way according to the number of current idle cache bits in the returned cache way and the number of picking containers contained in the multitask set.
9. The apparatus of claim 8, wherein the binding module is further configured to:
determining the priority information of the cache way according to the number of the current idle cache bits, wherein the cache way has higher priority when the number of the current idle cache bits is larger;
if the number of the current idle cache bits is the same, determining the priority information of the cache way according to the single-day arrival amount, wherein the priority of the cache way is higher when the current single-day arrival amount is less;
and determining the returned cache ways according to the priority information of the cache ways, wherein the number of the returned cache ways does not exceed the number of the multitask sets of the currently applied cache ways.
10. The apparatus of claim 7 or 8, wherein the binding module is further configured to:
determining an absolute value of a difference between a current number of free cache bits in a returned cache way and a number of pick containers included in the multitasking set;
and establishing a binding relationship between the multitask set and the cache way according to the sequence of the absolute values of the difference values from small to large, wherein the multitask set and the cache way are bound one by one.
11. The apparatus of claim 7, wherein the issuing module is further configured to:
acquiring the number of idle cache bits of a cache way in real time according to the state of the photoelectric equipment arranged on the cache bits;
according to the number of the idle cache bits of the cache way, issuing goods picking containers which do not exceed the number of the idle cache bits of the cache way to the bound cache way;
and sending all the picking containers contained in the multitask set to the bound cache ways.
12. The apparatus of claim 7, wherein the binding module is further configured to:
presetting application time;
and after the application time is reached, determining a multitask set of which all the picking containers reach a centralized area, and determining the task types of the multitask set.
13. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
14. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910120227.2A CN111580952A (en) | 2019-02-18 | 2019-02-18 | Method and apparatus for assigning a multi-tasking set to cache ways |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910120227.2A CN111580952A (en) | 2019-02-18 | 2019-02-18 | Method and apparatus for assigning a multi-tasking set to cache ways |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111580952A true CN111580952A (en) | 2020-08-25 |
Family
ID=72120458
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910120227.2A Pending CN111580952A (en) | 2019-02-18 | 2019-02-18 | Method and apparatus for assigning a multi-tasking set to cache ways |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111580952A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112455983A (en) * | 2020-10-15 | 2021-03-09 | 北京京东振世信息技术有限公司 | Method and device for delivering articles out of warehouse |
| CN113391899A (en) * | 2021-06-15 | 2021-09-14 | 北京京东振世信息技术有限公司 | Method and device for allocating cache way |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH1063515A (en) * | 1996-08-26 | 1998-03-06 | Nippon Telegr & Teleph Corp <Ntt> | Scheduling method for multitask control |
| US20170052902A1 (en) * | 2015-08-21 | 2017-02-23 | International Business Machines Corporation | Assigning cache control blocks and cache lists to multiple processors to cache and demote tracks in a storage system |
| CN106997195A (en) * | 2017-03-22 | 2017-08-01 | 湖北九州通达科技开发有限公司 | A kind of logistics delivery line control method |
| CN107597603A (en) * | 2017-10-25 | 2018-01-19 | 顺丰速运有限公司 | A kind of ring-type sorting equipment and its application process |
| CN108133335A (en) * | 2018-01-30 | 2018-06-08 | 共享智能铸造产业创新中心有限公司 | A kind of logistics multitask control system and its control method based on AGV equipment |
-
2019
- 2019-02-18 CN CN201910120227.2A patent/CN111580952A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH1063515A (en) * | 1996-08-26 | 1998-03-06 | Nippon Telegr & Teleph Corp <Ntt> | Scheduling method for multitask control |
| US20170052902A1 (en) * | 2015-08-21 | 2017-02-23 | International Business Machines Corporation | Assigning cache control blocks and cache lists to multiple processors to cache and demote tracks in a storage system |
| CN106997195A (en) * | 2017-03-22 | 2017-08-01 | 湖北九州通达科技开发有限公司 | A kind of logistics delivery line control method |
| CN107597603A (en) * | 2017-10-25 | 2018-01-19 | 顺丰速运有限公司 | A kind of ring-type sorting equipment and its application process |
| CN108133335A (en) * | 2018-01-30 | 2018-06-08 | 共享智能铸造产业创新中心有限公司 | A kind of logistics multitask control system and its control method based on AGV equipment |
Non-Patent Citations (3)
| Title |
|---|
| YUN LIANG; HUYNH PHUNG HUYNH; KYLE RUPNOW; RICK SIOW MONG GOH; DEMING CHEN: "Efficient GPU Spatial-Temporal Multitasking", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS * |
| 周杰韩, 吴波, 杜润生, 杨叔子: "虚拟制造系统多任务仿真方案设计与实现", 中国机械工程, no. 07 * |
| 杨巨峰;张志杰;严锐;: "WMS与WCS系统交互数据结构设计", 物流技术, no. 06 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112455983A (en) * | 2020-10-15 | 2021-03-09 | 北京京东振世信息技术有限公司 | Method and device for delivering articles out of warehouse |
| WO2022078244A1 (en) * | 2020-10-15 | 2022-04-21 | 北京京东振世信息技术有限公司 | Outbound delivery method and device for articles |
| CN113391899A (en) * | 2021-06-15 | 2021-09-14 | 北京京东振世信息技术有限公司 | Method and device for allocating cache way |
| CN113391899B (en) * | 2021-06-15 | 2023-09-05 | 北京京东振世信息技术有限公司 | Method and device for allocating cache ways |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110371548B (en) | Goods warehousing method and device | |
| CN110866709A (en) | Order combination method and device | |
| CN110348650B (en) | Order converging method and device | |
| CN110826831A (en) | Method and device for restocking a picking zone of a warehouse | |
| CN104735095A (en) | Method and device for job scheduling of cloud computing platform | |
| CN110928905B (en) | Data processing method and device | |
| CN111260240B (en) | Task allocation method and device | |
| CN110826945A (en) | Order combining method and device for automatic warehouse | |
| CN110889656A (en) | Warehouse rule configuration method and device | |
| CN104363282A (en) | Cloud computing resource scheduling method and device | |
| CN110796400A (en) | Method and device for caching goods | |
| CN111580952A (en) | Method and apparatus for assigning a multi-tasking set to cache ways | |
| CN111222810B (en) | Method and device for distributing grid openings in real time | |
| CN111507651A (en) | Order data processing method and device applied to man-machine mixed warehouse | |
| CN110689293B (en) | Article delivery processing method and device | |
| CN109840815B (en) | System and method for order processing | |
| CN112052133A (en) | Service system monitoring method and device based on Kubernetes | |
| CN112101690A (en) | Article sorting method and device | |
| CN111582617A (en) | Distribution method and distribution system for picking task | |
| CN115525411A (en) | Method, device, electronic equipment and computer readable medium for processing service request | |
| CN115390958A (en) | Task processing method and device | |
| CN113762849A (en) | Stereoscopic warehouse inventory management method, device and system | |
| CN112441364B (en) | Container warehouse-in or warehouse-back method and device for automatic warehouse | |
| CN111792248B (en) | Method and device for adjusting storage position of material box | |
| CN113554373A (en) | Method and device for managing ex-warehouse of three-dimensional warehouse |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210302 Address after: Room a1905, 19 / F, building 2, No. 18, Kechuang 11th Street, Daxing District, Beijing, 100176 Applicant after: Beijing Jingdong Qianshi Technology Co.,Ltd. Address before: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant before: Beijing Jingbangda Trading Co.,Ltd. Effective date of registration: 20210302 Address after: 101, 1st floor, building 2, yard 20, Suzhou street, Haidian District, Beijing 100080 Applicant after: Beijing Jingbangda Trading Co.,Ltd. Address before: 100086 8th Floor, 76 Zhichun Road, Haidian District, Beijing Applicant before: BEIJING JINGDONG SHANGKE INFORMATION TECHNOLOGY Co.,Ltd. Applicant before: BEIJING JINGDONG CENTURY TRADING Co.,Ltd. |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |