CN111580952B - Method and device for distributing multitasking set to cache way - Google Patents
Method and device for distributing multitasking set to cache way Download PDFInfo
- Publication number
- CN111580952B CN111580952B CN201910120227.2A CN201910120227A CN111580952B CN 111580952 B CN111580952 B CN 111580952B CN 201910120227 A CN201910120227 A CN 201910120227A CN 111580952 B CN111580952 B CN 111580952B
- Authority
- CN
- China
- Prior art keywords
- cache
- cache way
- way
- bits
- task
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000004590 computer program Methods 0.000 claims description 10
- 230000000694 effects Effects 0.000 abstract description 5
- 238000012544 monitoring process Methods 0.000 abstract description 4
- 230000008569 process Effects 0.000 abstract description 4
- 230000005856 abnormality Effects 0.000 abstract 2
- 238000010586 diagram Methods 0.000 description 13
- 230000002159 abnormal effect Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000002776 aggregation Effects 0.000 description 4
- 238000004220 aggregation Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012552 review 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
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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)
- Warehouses Or Storage Devices (AREA)
Abstract
The invention discloses a method and a device for distributing a multitasking set to a cache way, and relates to the field of warehouse logistics. One embodiment of the method comprises the following steps: applying for a cache way according to the task type of the multi-task set, and establishing a binding relation between the multi-task set and the cache way; acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to the bound cache way according to the number of the idle cache bits; judging whether the goods picking container contained in the multi-task set is completely issued to the bound cache channel, if so, releasing the binding relation between the multi-task set and the cache channel, and enabling the cache channel to enter a state to be bound. According to the method, the technical means of monitoring the number of idle buffer bits of the buffer channel in real time is adopted, so that the multitasking set is reasonably distributed to the buffer channel, the technical problems that buffer channel resources are wasted and abnormality occurs due to congestion of the buffer channel are solved, and the technical effects of improving the efficiency of a conveying line and reducing waiting time and process abnormality 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 multitasking set to a cache way.
Background
In the intelligent warehouse logistics, a push type is adopted in the previous cache way collection and alignment mode, and the method is specifically described as follows: when all the pick containers of the multi-set list (i.e., the multi-task set in the embodiment of the present invention) are collected in the collection area, it is necessary to determine whether there is an available free buffer track, and when it is determined that there is a free buffer track, all the pick containers under the set list are issued to the buffer track at one time. And then, performing rechecking operation in the cache way, and releasing the cache way when all the picking containers are rechecked, so that the new multi-collection list can be accepted.
In the process of implementing the present invention, the inventor finds that at least the following problems exist in the prior art:
1. One buffer track can only be occupied by one multi-collection list at a time, and if the quantity of the picking containers of the multi-collection list is small and the occupied quantity of the buffer track is large, a large quantity of buffer track empty spaces can be wasted.
2. After the rechecking is completed completely, the time for releasing the buffer channel wastes the buffer channel resources, so that the efficiency of the conveying line is quite low, and the congestion is often generated when the single quantity of the multiple collection list is larger.
3. If the number of the delivered picking containers is larger than the capacity of the cache way, the excessive picking containers cannot enter and overflow to remove the abnormal port.
4. The staff needs to wait for all the pick containers to reach the cache way before starting the review task.
Disclosure of Invention
In view of this, the embodiments of the present invention provide a method and an apparatus for allocating a multitasking set to a cache way, which can reasonably allocate the multitasking set to the cache way, so as to solve the problems that the cache way resources are wasted and the cache way is blocked.
To achieve the above object, according to one aspect of an embodiment of the present invention, there is provided a method for allocating a multitasking set to a cache way, including:
Applying for a cache way according to the task type of the multi-task set, and establishing a binding relation between the multi-task 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 multi-task set;
Acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to the bound cache way according to the number of the idle cache bits;
judging whether the goods picking container contained in the multi-task set is completely issued to the bound cache way, if yes, releasing the binding relation between the multi-task set and the cache way, and enabling the cache way to enter a state to be bound.
Optionally, applying for the cache way according to the task type of the multitasking set, and establishing the binding relationship between the multitasking 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 included in the multitasking set includes:
judging whether the multitasking set has a history binding cache way or not;
If yes, returning the history binding cache way, and establishing a binding relation between the multitasking set and the history binding cache way;
If not, determining a returned cache way in the cache way corresponding to the task type of the multi-task set according to the priority information of the cache way, and establishing a binding relation between the multi-task 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 multi-task set.
Optionally, the determining the returned cache way according to the priority information of the cache way includes:
determining priority information of the cache channels according to the number of the current idle cache bits, wherein the higher the number of the current idle cache bits is, the higher the priority of the cache channels is;
if the number of the current idle cache bits is the same, determining priority information of the cache ways according to the single-day arrival amount, wherein the priority of the cache ways is higher when the current single-day arrival amount is smaller;
And determining returned cache channels according to the priority information of the cache channels, wherein the number of the returned cache channels does not exceed the number of the multi-task sets of the cache channels currently applied.
Optionally, establishing a binding relationship between the multitasking 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 multitasking set, including:
Determining an absolute value of a difference between a current number of free cache bits in the returned cache way and a number of pick containers contained in the multitasking set;
and establishing a binding relation between the multi-task set and the cache track according to the sequence of the absolute value of the difference value from small to large, wherein the multi-task set and the cache track are bound one by one.
Optionally, the acquiring the number of idle cache bits of the cache way in real time, and issuing the picking 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 channel in real time according to the state of photoelectric equipment arranged on the cache bits;
Issuing a goods picking container which does not exceed the number of the idle buffer bits of the buffer channel to the bound buffer channel according to the number of the idle buffer bits of the buffer channel;
until the pick container contained by the multitasking collection is all issued to the bound cache way.
Optionally, before the applying for the cache way according to the task type of the multitasking set, the method further includes:
Presetting application time;
After the application time is reached, a multi-task set in which the pick container has all reached the staging area is determined, and task types of the multi-task set are determined.
According to another aspect of an embodiment of the present invention, there is provided an apparatus for allocating a multitasking set to a cache way, including:
a binding module for: applying for a cache way according to the task type of the multi-task set, and establishing a binding relation between the multi-task 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 multi-task set;
a issuing module, configured to: acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to the bound cache way according to the number of the idle cache bits;
The unbinding module is used for: judging whether the goods picking container contained in the multi-task set is completely issued to the bound cache way, if yes, releasing the binding relation between the multi-task set and the cache way, and enabling the cache way to enter a state to be bound.
Optionally, the binding module is further configured to:
judging whether the multitasking set has a history binding cache way or not;
if yes, returning the history binding cache way, and establishing a binding relation between the multitasking set and the history binding cache way;
If not, determining a returned cache way in the cache way corresponding to the task type of the multi-task set according to the priority information of the cache way, and establishing a binding relation between the multi-task 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 multi-task set.
Optionally, the binding module is further configured to:
determining priority information of the cache channels according to the number of the current idle cache bits, wherein the higher the number of the current idle cache bits is, the higher the priority of the cache channels is;
if the number of the current idle cache bits is the same, determining priority information of the cache ways according to the single-day arrival amount, wherein the priority of the cache ways is higher when the current single-day arrival amount is smaller;
And determining returned cache channels according to the priority information of the cache channels, wherein the number of the returned cache channels does not exceed the number of the multi-task sets of the cache channels currently applied.
Optionally, the binding module is further configured to:
Determining an absolute value of a difference between a current number of free cache bits in the returned cache way and a number of pick containers contained in the multitasking set;
and establishing a binding relation between the multi-task set and the cache track according to the sequence of the absolute value of the difference value from small to large, wherein the multi-task set and the cache track are bound one by one.
Optionally, the issuing module is further configured to:
Acquiring the number of idle cache bits of a cache channel in real time according to the state of photoelectric equipment arranged on the cache bits;
Issuing a goods picking container which does not exceed the number of the idle buffer bits of the buffer channel to the bound buffer channel according to the number of the idle buffer bits of the buffer channel;
until the pick container contained by the multitasking collection is all issued to the bound cache way.
Optionally, the binding module is further configured to:
Presetting application time;
After the application time is reached, a multi-task set in which the pick container has all reached the staging area is determined, and task types of the multi-task set are determined.
According to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus including: one or more processors; and 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 distributing the multi-task set to the cache way.
According to yet another 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 set of multiple tasks to a cache way 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 buffer bits of the buffer channel in real time is adopted, the multitasking set is reasonably distributed to the buffer channel, the technical problems that the buffer channel resources are wasted and the buffer channel is abnormal due to congestion are solved, and the technical effects of improving the efficiency of the conveying line and reducing the waiting time and the abnormal progress are achieved.
Further effects of the above-described non-conventional alternatives are 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 set of multiple tasks to a cache way according to an embodiment of the invention;
FIG. 2 is a schematic diagram of a preferred flow of a method of allocating a set of multiple tasks to a cache way according to an embodiment of the invention;
FIG. 3 is a schematic diagram of the basic modules of an apparatus for allocating a set of multiple tasks to a cache way according to an embodiment of the invention;
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
Fig. 5 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered 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.
Technical terms appearing in the embodiments of the present invention are explained as follows:
Cache way: the system binds the task type with the physical crossing number to generate a concept, and when the task is issued, the designated crossing can be screened according to the task type.
Aggregate sheet (i.e., multitasking aggregate): the multiple aggregate sheet represents an aggregate sheet containing a plurality of pick containers.
Cache bits: the buffer track is used for storing the position of the picking container.
Concentration area: the temporary storage area of the picking container is used for collecting the picking containers with multiple collection sheets in the collecting area, and the subsequent operation is carried out.
Single day arrival amount: the number of pick-up containers received one day by the current time cache.
History bound cache way: the single bound cache ways are aggregated.
FIG. 1 is a schematic diagram of a basic flow of a method for allocating a multitasking set to a cache way according to an embodiment of the invention, as shown in FIG. 1, a method for allocating a multitasking set to a cache way, comprising:
S101, applying for a cache way according to a task type of a multi-aggregate list (simply referred to as an aggregate list), and establishing a binding relation between the multi-aggregate 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 (simply referred to as containers) contained in the multi-aggregate list;
s102, acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to the bound cache way according to the number of the idle cache bits;
And S103, judging whether the goods picking container contained in the multi-set list is completely issued to the bound cache channel, if so, releasing the binding relation between the multi-set list and the cache channel, and enabling the cache channel to enter a state to be bound.
According to the embodiment of the invention, the technical means of monitoring the number of the idle buffer bits of the buffer channel in real time is adopted, so that the multi-aggregate list is reasonably distributed to the buffer channel, the technical problems that the buffer channel resources are wasted and the buffer channel is abnormal due to congestion are solved, and the technical effects of improving the efficiency of the conveying line and reducing the waiting time and the abnormal progress are achieved.
In step S101 of the embodiment of the present invention, the applying for the cache way according to the task type of the multi-aggregate list, and establishing a binding relationship between the multi-aggregate list and the cache way according to the number of current idle cache bits in the returned cache way and the number of pick containers included in the multi-aggregate list includes: judging whether the multi-set list has a history binding cache track or not; if yes, returning the history binding cache way, and establishing a binding relation between the multi-aggregate list and the history binding cache way; if not, determining a returned cache way in the cache way corresponding to the task type of the multi-set list according to the priority information of the cache way, and establishing a binding relation between the multi-set 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-set list.
Based on the foregoing embodiments, in the embodiment of the present invention, determining a returned cache way according to the priority information of the cache way includes: determining priority information of the cache channels according to the number of the current idle cache bits, wherein the higher the number of the current idle cache bits is, the higher the priority of the cache channels is; if the number of the current idle cache bits is the same, determining priority information of the cache ways according to the single-day arrival amount, wherein the priority of the cache ways is higher when the current single-day arrival amount is smaller; and determining returned cache channels according to the priority information of the cache channels, wherein the number of the returned cache channels does not exceed the number of the multi-set list of the cache channels currently applied. And determining the returned cache way according to the current priority information of the cache way, so that the allocation 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 list and a cache track according to the number of current idle cache bits in the returned cache track and the number of pick containers included in the multiple aggregate list includes: determining an absolute value of a difference between the number of currently free cache bits in the returned cache way and the number of pick containers contained in the multi-collection list; and establishing the binding relation between the multi-set list and the cache track according to the sequence of the absolute value of the difference value from small to large. The multi-set list and the cache way are bound one by one, namely one multi-set list and one cache way, and one cache way is also bound with one set list at a time. The binding relation is established according to the absolute value of the difference value, so that the distribution of the collection list is more reasonable.
In step S101 of the embodiment of the present invention, before the application of the cache way according to the task type of the multiple aggregate list, the method further includes: presetting application time; after the application time is reached, a multi-aggregate list of all the pick containers reaching the staging area is determined, and the task type of the multi-aggregate list is determined. After the concentration areas Ji Duo in the embodiment of the invention are combined to collect all the picking containers under a single unit, the cache way is applied in batches at fixed 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 acquiring, in real time, the number of idle buffer bits of the buffer track, and issuing the picking container to the bound buffer track according to the number of idle buffer bits includes: acquiring the number of idle cache bits of a cache channel in real time according to the state of photoelectric equipment arranged on the cache bits; issuing a goods picking container which does not exceed the number of the idle buffer bits of the buffer channel to the bound buffer channel according to the number of the idle buffer bits of the buffer channel; until the pick container contained in the multi-collection sheet is issued to the bound cache way. Because the buffer channel has the new characteristic of empty box position, even if the picking container is not moved down in time, the later overflow of the picking container can not happen, and the maximization of the conveying line efficiency is ensured. Because the buffer memory bits are provided with the corresponding photoelectric devices, when the photoelectric devices are changed, the devices can report to the WCS (logistics management system-base layer device logistics control automation system) in time, and the WCS can update the vacancy condition of the buffer memory channel at the first time. Thus, even if the picking container is not removed, the WMS (warehouse management system) can issue a specified number of container delivery tasks according to the real-time vacancy information of the WCS. In the normal condition of the system, the condition of overflowing of the container does not occur. And because the empty space is updated in real time, the binding relation can be released by the aggregation of the aggregation sheets, the next aggregation sheet can be bound at the first time, and the empty space of the previous aggregation sheet can be utilized in time.
In step S102 of the embodiment of the present invention, the method further includes: after the pick container is moved to the bound cache way, a review operation is performed on the pick container. And after each picking container reaches the cache way, the rechecking operation is carried out, so that staff does not need to care whether all the picking containers are gathered, and the rechecking speed is improved.
Fig. 2 is a schematic diagram of a preferred flow of a method for assigning a multi-task set to a cache way according to an embodiment of the present invention, as shown in fig. 2, in which arrival of pick-up containers in the same batch of collection sheets in a collection area is monitored, and each time a pick-up container arrives in the collection area, the arrival of the pick-up container is reported to a WMS, and the WMS determines whether all pick-up containers of one collection sheet are collected in the collection area. After judging that the task is completed, the WMS applies for a free cache way of a specified task type to the WCS. The WCS recommends a 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 pick containers under each collection sheet, and periodically determines whether there are collected collection sheets in the collection area, and periodically applies for available cache tracks in batches. The WCS can update the buffer channel vacancy fed back by the equipment in real time, so that the WMS can apply for a proper buffer channel in the first time. WMS applies for an idle cache way, WCS return cache way logic specifically is: the WMS transmits in the task type and the collection list number, and the WCS preferentially returns the buffer track bound by the collection list. If the buffer channel is not bound, the road junction with more vacancies and less arrival amount in a single day is preferentially allocated to return according to the corresponding task type. The returned crossing is locked in the system to prevent concurrent application, after that, the WMS distributes the applied buffer track by itself, and the WCS interface is called for binding relation according to the number of the vacant sites. The WCS feeds back whether the binding was successful. The WMS selects a cache way and applies for the relation binding of the collection list and the cache way to the WCS, so that other collection lists are prevented from being occupied. And the WMS issues a corresponding number of out-concentrated zone tasks to the WCS according to the number of the idle buffer bits. The WCS notification device outputs the corresponding pick container from the staging area to the designated cache crossing. And after each picking container arrives at the cache crossing, performing a rechecking operation, reporting the number of the arriving picking containers to the WMS by the equipment, judging whether all the picking containers under the collection list arrive at the cache crossing by the WMS, and releasing the cache after all the picking containers arrive at the cache crossing, wherein the cache can receive a new binding relation, so that the idle cache bit in the cache 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 multitasking set to a cache way according to an embodiment of the invention, as shown in FIG. 3, an apparatus for allocating a multitasking set to a cache way, comprising:
a binding module 301 for: applying for a cache way according to the task type of the multi-aggregate list, and establishing a binding relation between the multi-aggregate 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-aggregate list;
A issuing module 302, configured to: acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to the bound cache way according to the number of the idle cache bits;
Unbinding module 303, configured to: judging whether the goods picking container contained in the multi-collection list is completely issued to the bound cache channel, if so, releasing the binding relation between the multi-collection list and the cache channel to enable the cache channel to enter a to-be-bound state.
In the embodiment of the present invention, the binding module 301 is further configured to: judging whether the multi-set list has a history binding cache track or not; if so, returning the history bound cache way, and establishing a binding relation between the multi-aggregate list and the history bound cache way; if the task type of the multi-collection list does not exist, determining a returned cache way in the cache way corresponding to the task type of the multi-collection list according to the priority information of the cache way, and establishing a binding relation between the multi-collection 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-collection list.
In the embodiment of the present invention, the binding module 301 is further configured to: determining priority information of the cache channels according to the number of the current idle cache bits, wherein the higher the number of the current idle cache bits is, the higher the priority of the cache channels is; if the number of the current idle cache bits is the same, determining priority information of the cache ways according to the single-day arrival amount, wherein the priority of the cache ways is higher when the current single-day arrival amount is smaller; and determining returned cache channels according to the priority information of the cache channels, wherein the number of the returned cache channels does not exceed the number of the multi-set list of the cache channels currently applied.
In the embodiment of the present invention, the binding module 301 is further configured to: determining an absolute value of a difference between the number of currently free cache bits in the returned cache way and the number of pick containers contained in the multi-collection list; and establishing a binding relation between the multi-set list and the cache tracks according to the sequence of the absolute value of the difference value from small to large, wherein the multi-set list and the cache tracks are bound one by one.
In the embodiment of the present invention, the issuing module 302 is further configured to: acquiring the number of idle cache bits of a cache channel in real time according to the state of photoelectric equipment arranged on the cache bits; issuing a goods picking container which does not exceed the number of the idle buffer bits of the buffer channel to the bound buffer channel according to the number of the idle buffer bits of the buffer channel; until the pick container contained in the multi-collection sheet is issued to the bound cache way.
In the embodiment of the invention, the device further comprises a rechecking module for: after the pick container is moved to the bound cache way, a review operation is performed on the pick container.
In the embodiment of the present invention, the binding module 301 is further configured to: presetting application time; after the application time is reached, a multi-aggregate list of all the pick containers reaching the staging area is determined, and the task type of the multi-aggregate list is determined.
FIG. 4 illustrates an exemplary system architecture 400 of a method of multi-tasking set allocation to cache ways or an apparatus of multi-tasking 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 is used as a medium to provide communication links between the terminal devices 401, 402, 403 and the server 405. The network 404 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 405 via the network 404 using the terminal devices 401, 402, 403 to receive or send messages or the like. Various communication client applications, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, etc., may be installed on the terminal devices 401, 402, 403.
The terminal devices 401, 402, 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 405 may be a server providing various services, such as a background management server providing support for shopping-type websites browsed by the user using the terminal devices 401, 402, 403. The background management server can analyze and other data of the received 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-set list to the cache ways provided in the embodiment of the present invention is generally executed by the server 405, and accordingly, the apparatus for allocating the multi-set list to the cache ways 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.
According to an embodiment of the present invention, the present invention also provides an electronic device and a computer-readable storage medium.
An electronic device according to an embodiment of the present invention includes: one or more processors; and 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 are enabled to realize the method for distributing the multi-task set to the cache way.
A computer readable medium of an embodiment of the present invention has stored thereon a computer program which, when executed by a processor, implements the method for allocating a multitasking set to a cache way provided by the present invention.
Referring now to FIG. 5, there is illustrated a schematic diagram of a computer system 500 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 5 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU) 501, which 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 required for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other through 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 section 506 including a keyboard, a mouse, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; 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 drive 510 is also connected to the I/O interface 505 as needed. 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 needed so that a computer program read therefrom is mounted into the storage section 508 as needed.
In particular, according to embodiments of the present disclosure, the processes described above with reference to 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 shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 509, and/or installed from the removable media 511. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 501.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any 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 context of this document, 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, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. 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 flowcharts 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 involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules may also be provided in a processor, for example, as: a processor, a binding module, a issuing module and a unbinding module. The names of these modules do not in any way constitute a limitation on the module itself, for example, a binding module, and may also be described as "a module for establishing a binding relationship between the multi-aggregate list 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 present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include: applying for a cache way according to the task type of the multi-task set, and establishing a binding relation between the multi-task 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 multi-task set; acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container to the bound cache way according to the number of the idle cache bits; judging whether the goods picking container contained in the multi-task set is completely issued to the bound cache channel, if so, releasing the binding relation between the multi-task set and the cache channel, and enabling the cache channel to enter a state to be bound.
According to the technical scheme provided by the embodiment of the invention, the technical means of monitoring the number of idle buffer bits of the buffer channel in real time is adopted, so that the multitasking set is reasonably distributed to the buffer channel, the technical problems that the buffer channel resources are wasted and the buffer channel is abnormal due to congestion are solved, and the technical effects of improving the efficiency of the conveying line and reducing the waiting time and the abnormal progress are further achieved.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (12)
1. A method of assigning a set of multiple tasks to a cache way, comprising:
Applying for a cache way according to a task type of a multi-task set, and establishing a binding relation between the multi-task 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 multi-task set, wherein the binding relation comprises the following steps: determining an absolute value of a difference between a current number of free cache bits in the returned cache way and a number of pick containers contained in the multitasking set; establishing a binding relation between the multi-task set and the cache track according to the sequence of the absolute value of the difference value from small to large, wherein the multi-task set and the cache track are bound one by one;
Acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container which does not exceed the number of the idle cache bits of the cache way to a bound cache way according to the number of the idle cache bits until the goods picking container contained in the multi-task set is issued to the bound cache way;
judging whether the goods picking container contained in the multi-task set is completely issued to the bound cache way, if yes, releasing the binding relation between the multi-task set and the cache way, and enabling the cache way to enter a state to be bound.
2. The method of claim 1, wherein applying for a cache way according to a task type of a multi-task set, and establishing a binding relationship between the multi-task set and the cache way according to a current number of free cache bits in a returned cache way and a number of pick containers included in the multi-task set comprises:
judging whether the multitasking set has a history binding cache way or not;
If yes, returning the history binding cache way, and establishing a binding relation between the multitasking set and the history binding cache way;
If not, determining a returned cache way in the cache way corresponding to the task type of the multi-task set according to the priority information of the cache way, and establishing a binding relation between the multi-task 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 multi-task set.
3. The method of claim 2, wherein determining the returned cache way based on the priority information of the cache way comprises:
determining priority information of the cache channels according to the number of the current idle cache bits, wherein the higher the number of the current idle cache bits is, the higher the priority of the cache channels is;
if the number of the current idle cache bits is the same, determining priority information of the cache ways according to the single-day arrival amount, wherein the priority of the cache ways is higher when the current single-day arrival amount is smaller;
And determining returned cache channels according to the priority information of the cache channels, wherein the number of the returned cache channels does not exceed the number of the multi-task sets of the cache channels currently applied.
4. The method of claim 1, wherein the obtaining in real time the number of free cache bits of the cache way and issuing the pick container to the bound cache way based on the number of free cache bits comprises:
and acquiring the number of idle cache bits of the cache channel in real time according to the state of the photoelectric equipment arranged on the cache bits.
5. The method of claim 1, wherein prior to applying for cache ways according to task types of the multitasking collection, the method further comprises:
Presetting application time;
After the application time is reached, a multi-task set in which the pick container has all reached the staging area is determined, and task types of the multi-task set are determined.
6. An apparatus for assigning a set of multiple tasks to a cache way, comprising:
A binding module for: applying for a cache way according to a task type of a multi-task set, and establishing a binding relation between the multi-task 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 multi-task set, wherein the binding relation comprises the following steps: determining an absolute value of a difference between a current number of free cache bits in the returned cache way and a number of pick containers contained in the multitasking set; establishing a binding relation between the multi-task set and the cache track according to the sequence of the absolute value of the difference value from small to large, wherein the multi-task set and the cache track are bound one by one;
A issuing module, configured to: acquiring the number of idle cache bits of a cache way in real time, and issuing a goods picking container which does not exceed the number of the idle cache bits of the cache way to a bound cache way according to the number of the idle cache bits until the goods picking container contained in the multi-task set is issued to the bound cache way;
The unbinding module is used for: judging whether the goods picking container contained in the multi-task set is completely issued to the bound cache way, if yes, releasing the binding relation between the multi-task set and the cache way, and enabling the cache way to enter a state to be bound.
7. The apparatus of claim 6, wherein the binding module is further to:
judging whether the multitasking set has a history binding cache way or not;
If yes, returning the history binding cache way, and establishing a binding relation between the multitasking set and the history binding cache way;
If not, determining a returned cache way in the cache way corresponding to the task type of the multi-task set according to the priority information of the cache way, and establishing a binding relation between the multi-task 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 multi-task set.
8. The apparatus of claim 7, wherein the binding module is further to:
determining priority information of the cache channels according to the number of the current idle cache bits, wherein the higher the number of the current idle cache bits is, the higher the priority of the cache channels is;
if the number of the current idle cache bits is the same, determining priority information of the cache ways according to the single-day arrival amount, wherein the priority of the cache ways is higher when the current single-day arrival amount is smaller;
And determining returned cache channels according to the priority information of the cache channels, wherein the number of the returned cache channels does not exceed the number of the multi-task sets of the cache channels currently applied.
9. The apparatus of claim 6, wherein the issuing module is further configured to:
and acquiring the number of idle cache bits of the cache channel in real time according to the state of the photoelectric equipment arranged on the cache bits.
10. The apparatus of claim 6, wherein the binding module is further to:
Presetting application time;
After the application time is reached, a multi-task set in which the pick container has all reached the staging area is determined, and task types of the multi-task set are determined.
11. An electronic device, comprising:
One or more processors;
storage means for storing one or more programs,
When executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-5.
12. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910120227.2A CN111580952B (en) | 2019-02-18 | 2019-02-18 | Method and device for distributing multitasking set to cache way |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910120227.2A CN111580952B (en) | 2019-02-18 | 2019-02-18 | Method and device for distributing multitasking set to cache way |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111580952A CN111580952A (en) | 2020-08-25 |
| CN111580952B true CN111580952B (en) | 2024-07-16 |
Family
ID=72120458
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910120227.2A Active CN111580952B (en) | 2019-02-18 | 2019-02-18 | Method and device for distributing multitasking set to cache way |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111580952B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112455983B (en) * | 2020-10-15 | 2022-09-30 | 北京京东振世信息技术有限公司 | Method and device for delivering articles out of warehouse |
| CN113391899B (en) * | 2021-06-15 | 2023-09-05 | 北京京东振世信息技术有限公司 | Method and device for allocating cache ways |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (4)
| 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 |
| US9921974B2 (en) * | 2015-08-21 | 2018-03-20 | International Business Machines Corporation | Assigning cache control blocks and cache lists to multiple processors to cache and demote tracks in a storage system |
| CN206622328U (en) * | 2016-09-14 | 2017-11-10 | 上海极络智能科技有限公司 | It is layered goods radio frequency |
| 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/CN111580952B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111580952A (en) | 2020-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110866709B (en) | Method and device for merging orders | |
| CN111507651B (en) | Order data processing method and device applied to human-machine hybrid warehouse | |
| CN110826831A (en) | Method and device for restocking a picking zone of a warehouse | |
| CN107633358B (en) | Facility site selection and distribution method and device | |
| CN110889656B (en) | Warehouse rule configuration method and device | |
| CN111260240B (en) | Task allocation method and device | |
| CN110348650B (en) | Order converging method and device | |
| CN110796400B (en) | Goods caching method and device | |
| CN111580952B (en) | Method and device for distributing multitasking set to cache way | |
| CN111461583B (en) | Inventory checking method and device | |
| CN111597033A (en) | Task scheduling method and device | |
| CN109934427B (en) | Method and device for generating item distribution scheme | |
| CN111222810B (en) | Method and device for distributing grid openings in real time | |
| CN112101690B (en) | Article sorting method and device | |
| CN111950830A (en) | Task allocation method and device | |
| CN111832980A (en) | Method and device for allocating storage positions of multi-layer warehouse | |
| CN113762566B (en) | Method and device for calculating delivery time | |
| CN111582617A (en) | Distribution method and distribution system for picking task | |
| CN113780918A (en) | Task list distribution method and device | |
| CN112966992A (en) | Order production method and device | |
| CN112990806A (en) | Method and system for dispatch control of transportation equipment | |
| CN113762849B (en) | Method, device and system for managing inventory of stereoscopic warehouse | |
| CN110826752A (en) | Collection list distribution method and device | |
| CN113448719B (en) | Distributed task processing system | |
| CN111792248B (en) | Method and device for adjusting storage position of material box |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |