CN113504933A - Workshop machine updating method and system - Google Patents
Workshop machine updating method and system Download PDFInfo
- Publication number
- CN113504933A CN113504933A CN202110595018.0A CN202110595018A CN113504933A CN 113504933 A CN113504933 A CN 113504933A CN 202110595018 A CN202110595018 A CN 202110595018A CN 113504933 A CN113504933 A CN 113504933A
- Authority
- CN
- China
- Prior art keywords
- updated
- machines
- machine
- updating
- update
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
- G06F8/65—Updates
- G06F8/656—Updates while running
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
Abstract
The invention provides a workshop machine updating method, which comprises the steps of determining assembly lines arranged in a workshop and machines correspondingly arranged on each assembly line, and distinguishing the machines to be updated from all the machines in the workshop; detecting the current updating type of the machine to be updated; wherein the current update type is one of all synchronous, all asynchronous and synchronous; and obtaining the updating time consumption according to the current updating type of the machine to be updated and by combining the preset data transmission time and the preset single machine updating time, and finishing the corresponding updating of all the machines to be updated in the workshop according to the updating time consumption. The invention also provides a workshop machine updating system. By implementing the invention, the problem of updating the scale workshop machine program can be solved, the non-stop updating is realized, and the time and the labor are saved.
Description
Technical Field
The invention relates to the technical field of equipment maintenance, in particular to a workshop machine updating method and a workshop machine updating system.
Background
With the continuous expansion of the size of enterprise workshops, when machines in the workshops face program updating problems, a large amount of time and labor are expected to be consumed, and particularly when a production line cannot be stopped for updating, a large amount of time is consumed for program updating commands, and updating plans need to be arranged reasonably and the machine size needs to be updated.
Therefore, there is a need for a workshop machine updating method, which can solve the problem of scale workshop machine program updating, realize non-stop updating, and save time and labor.
Disclosure of Invention
The technical problem to be solved by the embodiments of the present invention is to provide a workshop machine updating method and system, which can solve the problem of scale workshop machine program updating, realize non-stop updating, and save time and labor.
In order to solve the above technical problem, an embodiment of the present invention provides a method for updating a workshop machine, where the method includes the following steps:
s1, determining a production line arranged in the workshop and machines correspondingly arranged in each production line, and distinguishing the machines to be updated from all the machines in the workshop;
s2, detecting the current update type of the machine to be updated; wherein the current update type is one of all synchronous, all asynchronous and synchronous;
and S3, obtaining the updating time consumption according to the current updating type of the machine to be updated and by combining the preset data transmission time and the preset single machine updating time, and completing the corresponding updating of all the machines to be updated in the workshop according to the updating time consumption.
Wherein, the step S3 specifically includes:
and if the current updating types of the machines to be updated are all synchronous, accumulating the preset data transmission time and the preset single machine updating time, taking the sum as the updating consumption time, and completing the synchronous updating of all the machines to be updated in the workshop by using the updating consumption time.
Wherein the method further comprises:
acquiring the bandwidth of data transmission required by a single machine and the number of machines to be updated when all the machines to be updated are updated synchronously, multiplying the bandwidth of the data transmission required by the single machine and the number of the machines to be updated when all the machines to be updated are updated synchronously, and taking the obtained product as the network bandwidth occupied by all the machines to be updated when all the machines to be updated are updated synchronously; and
and acquiring the number of machines which can be used for production when all the machines to be updated are updated synchronously, dividing the acquired number of machines which can be used for production when all the machines to be updated are updated synchronously by the total number of all the machines in the workshop, and acquiring the quotient as the production efficiency when all the machines to be updated are updated synchronously.
Wherein, the step S3 further specifically includes:
if the current update types of the machines to be updated are all asynchronous, determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop, assigning values to each machine to be updated and each machine which does not need to be updated to form a first assignment matrix, further multiplying the first assignment matrix by the sum of the preset data transmission time and the preset single machine update time in an accumulation mode, taking the obtained product as the update consumption time, and completing the asynchronous update of all the machines to be updated in the workshop according to the update consumption time.
Wherein the method further comprises:
acquiring the bandwidth of data transmission required by a single machine when the machine to be updated is completely asynchronous, and directly taking the acquired bandwidth of the data transmission required by the single machine as the network bandwidth occupied by the machine to be updated when the machine to be updated is completely asynchronous; and
and acquiring the number of machines which can be used for production when all the machines to be updated are asynchronously updated, dividing the acquired number of machines which can be used for production when all the machines to be updated are asynchronously updated by the total number of all the machines in the workshop, and acquiring a quotient which is the production efficiency when all the machines to be updated are asynchronously updated.
Wherein, the step S3 further specifically includes:
if the current update type of the machine to be updated is synchronous and asynchronous mixed update, determining each machine to be updated and each machine which does not need to be updated in all machines in a workshop, assigning values to each machine to be updated and each machine which does not need to be updated to form a second assignment matrix, multiplying the second assignment matrix by the sum of the accumulation of the preset data transmission time and the preset single machine update time, further comparing the obtained product with the sum of the accumulation of the preset data transmission time and the preset single machine update time to obtain the maximum update consumption time, and finishing the synchronous and asynchronous mixed update of all the machines to be updated in the workshop by using the update consumption time.
Wherein the method further comprises:
acquiring the bandwidth of data transmission required by a single machine and the number of asynchronously updated machines in the machine to be updated during the mixed update of the machine to be updated and the asynchronization, multiplying the acquired bandwidth of the data transmission required by the single machine and the acquired number of the asynchronously updated machines after adding one, and taking the obtained product as the network bandwidth occupied by the machine to be updated and the asynchronization mixed update; and
the method comprises the steps of obtaining the number of machines which can be used for production when the machines to be updated and the asynchronous mixed update are asynchronously updated, dividing the obtained number of machines which can be used for production when the machines to be updated and the asynchronous mixed update are asynchronously updated by the total number of all machines in a workshop, and obtaining a quotient which is the production efficiency when the machines to be updated and the asynchronous mixed update are asynchronously updated; and the number of the machines to be updated which can be used for production during asynchronous update of the asynchronous mixed machine is the difference obtained by subtracting the obtained number of the machines to be updated and adding one to the total number of all the machines in the workshop.
The embodiment of the invention also provides a workshop machine updating system, which comprises:
the device comprises a to-be-updated machine determining unit, a to-be-updated machine determining unit and a to-be-updated machine determining unit, wherein the to-be-updated machine determining unit is used for determining the assembly lines arranged in the workshop and the machines correspondingly arranged in each assembly line, and distinguishing the to-be-updated machines from all the machines in the workshop;
the updating type detecting unit is used for detecting the current updating type of the machine to be updated; wherein the current update type is one of all synchronous, all asynchronous and synchronous;
and the updating unit is used for obtaining the updating consumption time according to the current updating type of the machine to be updated and by combining the preset data transmission time and the preset single machine updating time, and completing the corresponding updating of all the machines to be updated in the workshop according to the updating consumption time.
Wherein the update unit includes:
the synchronous updating module is used for accumulating the preset data transmission time and the preset single machine updating time if the current updating types of the machines to be updated are all synchronous, taking the sum as the updating consumption time, and completing the synchronous updating of all the machines to be updated in the workshop according to the updating consumption time;
the asynchronous updating module is used for determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop if the current updating type of the machine to be updated is completely asynchronous, assigning values to each machine to be updated and each machine which does not need to be updated to form a first assignment matrix, further multiplying the first assignment matrix by the sum of the preset data transmission time and the preset single machine updating time, taking the obtained product as the updating consumption time, and completing the asynchronous updating of all the machines to be updated in the workshop according to the updating consumption time;
and the synchronous and asynchronous mixed updating module is used for determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop if the current updating type of the machine to be updated is synchronous and asynchronous mixed updating, assigning values to each machine to be updated and each machine which does not need to be updated to form a second assignment matrix, multiplying the second assignment matrix by the sum of the accumulation of the preset data transmission time and the preset single machine updating time, comparing the obtained product with the sum of the accumulation of the preset data transmission time and the preset single machine updating time to obtain the maximum update consumption time, and finishing synchronous and asynchronous mixed updating of all machines to be updated in the workshop according to the update consumption time.
The embodiment of the invention has the following beneficial effects:
when the scale workshop machine faces the program updating problem, the invention can adopt an updating mode of synchronous updating, asynchronous updating or synchronous and asynchronous mixed updating, issues an updating command to the workshop machine, transmits data and finally completes the updating, thereby solving the program updating problem of the scale workshop machine, realizing the non-stop updating and saving time and labor.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is within the scope of the present invention for those skilled in the art to obtain other drawings based on the drawings without inventive exercise.
FIG. 1 is a flowchart of a workshop machine update method according to an embodiment of the present invention;
fig. 2 is a diagram of a physical topology network of a scale workshop machine in the workshop machine updating method according to the embodiment of the present invention;
fig. 3 is an application scenario diagram of a large-scale workshop machine in the workshop machine updating method according to the embodiment of the present invention;
fig. 4 is a schematic diagram of an update structure of a workshop machine according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the accompanying drawings.
As shown in fig. 1, in an embodiment of the present invention, a method for updating a workshop machine is provided, where the method includes the following steps:
step S1, determining a production line arranged in the workshop and machines respectively and correspondingly arranged in each production line, and distinguishing the machines to be updated from all the machines in the workshop;
step S2, detecting the current update type of the machine to be updated; wherein the current update type is one of all synchronous, all asynchronous and synchronous;
and step S3, obtaining the updating consumption time according to the current updating type of the machine to be updated and by combining the preset data transmission time and the preset single machine updating time, and completing the corresponding updating of all the machines to be updated in the workshop according to the updating consumption time.
The specific process is that in step S1, the flow lines set inside the workshop and the machines set corresponding to each flow line are determined, and the machines to be updated are distinguished from all the machines in the workshop. For example, as shown in fig. 2, inside the plant a, there are m pipelines, n machines are placed on each pipeline, and among the mxn machines, k machines to be updated are distributed on one or more different pipelines.
In step S2, when the scale plant machine faces the program update problem, the update mode of synchronous update, asynchronous update or asynchronous-synchronous mixed update may be adopted, so it is necessary to detect that the current update type of the machine to be updated is one of all synchronous, all asynchronous and asynchronous-synchronous mixed.
In step S3, when the inter-plant device is updated, the data transfer time from the source device to the target device is not set to ttranAnd the single machine update time of the single machine is tupdateThen the update elapsed time to complete all machine updates in plant a can be calculated.
Since the current update types of the machines to be updated are classified into the above three types, they can be analyzed in detail in the following specific update modes:
(1) when using synchronous updates in plant A
Tsynchronous＝ttran+tupdate
In the above formula, on the premise of sufficient network bandwidth, the whole machines in the plant a complete the update, and the total time T is determined by the data transmission time and the single machine update time. The updating mode belongs to a shutdown updating mode, namely, in a synchronous updating state, each machine cannot operate, the requirement on network bandwidth is high, and the updating speed is high.
Therefore, if the current update types of the machines to be updated are all synchronous, the preset data transmission time t is settranWith a preset single-machine update time tupdateAccumulating to obtain the sum as the updated consumption time TsynchronousAnd with updating the elapsed time TsynchronousTo complete the synchronous update of all the machines to be updated in the workshop.
Furthermore, the network bandwidth B represents the network bandwidth occupied by the machine during updating, and the unit is Mb/s, and the bandwidth requirement during transmission of each machine is set as B Mb/s. Production efficiency of workshop
In the synchronous update mode, the update consumption time, the network bandwidth and the production efficiency are respectively represented as Tsynchronous、 BsynchronousAnd Rsynchronous。
Therefore, the bandwidth B of the data transmission required by a single machine and the number k of machines to be updated when all the machines to be updated are updated synchronously are obtained, the bandwidth B of the data transmission required by the single machine and the number k of the machines to be updated when all the machines to be updated are updated synchronously are multiplied, and the obtained product is used as the network bandwidth occupied by all the machines to be updated when all the machines to be updated are updated synchronously, namely BsynchronousK × b; and
obtaining the number of machines which can be used for production when all the machines to be updated are updated synchronously as 0, dividing the obtained number of machines which can be used for production when all the machines to be updated are updated synchronously by the total number mxn of all the machines in the workshop, and obtaining the quotient of the production efficiency when all the machines to be updated are updated synchronously, namely
(2) When using asynchronous updates in plant A
In the above equation, on the premise that the network bandwidth can only satisfy 1 machine, the number of machines or the scale of the machines involved in the update is required to determine the asynchronous update between the machines. The updating mode has the advantages that the machines can execute updating requirements in turn, the requirement on network bandwidth is low, and the production process of the single machine is not interrupted; the disadvantage is that the time consumed by updating is influenced by the number of machines, and the problem of overlong updating time exists. It should be noted that the machine to be updated does not need to be updated with 0 in the row, and the machine to be updated has 1 in the row.
Therefore, if the current update types of the machines to be updated are all asynchronous, each machine k to be updated and each machine mxn-k not to be updated are determined in all machines in the workshop, and a first assignment matrix is formed after assignment is carried out on each machine k to be updated and each machine mxn-k not to be updated
(e.g., each machine to be updated has a value of 1, and each machine not to be updated has a value of 0), and further assigning the first assignment matrix to the first machine
Multiplied by a predetermined data transmission time ttranWith a preset single-machine update time tupdateAnd accumulating the sums of the two, taking the obtained product as the update consumption time, and completing asynchronous update of all the machines to be updated in the workshop by using the update consumption time.
Furthermore, the network bandwidth B represents the network bandwidth occupied by the machine during updating, and the unit is Mb/s, and the bandwidth requirement during transmission of each machine is set as B Mb/s. Production efficiency of workshop
In the synchronous update mode, the update consumption time, the network bandwidth and the production efficiency are respectively represented as Tasynchronous、 BasynchronousAnd Rasynchronous；
Therefore, the bandwidth B of the transmission data needed by a single machine when the machines to be updated are all asynchronous is obtained, and the obtained bandwidth B of the transmission data needed by the single machine is directly used as the network bandwidth occupied when the machines to be updated are all asynchronous, namely B asynchronous1 × b; and
obtaining the number mxn-k of machines which can be used for production when all the machines to be updated are asynchronously updated, dividing the obtained number mxn-k of machines which can be used for production when all the machines to be updated are asynchronously updated by the total number mxn of all the machines in the workshop, and obtaining the quotient of the production efficiency when all the machines to be updated are asynchronously updated, namely the quotient
(3) When using synchronous and asynchronous mixed update in workshop A
In the above formula, a synchronous/asynchronous mixed update mode is adopted, in the workshop machines, a part of the specified machines use a synchronous update mode, the part of the specified machines are arranged in the row 0, the rest of the specified machines use an asynchronous update mode, the part of the specified machines are arranged in the row 1, and the total update time is determined by the synchronous update mode and the asynchronous update mode. The updating mode has the advantages that part of machines can be flexibly appointed to realize synchronous updating on the premise of not interrupting production, the requirement on network bandwidth is low, and the quantity of the machines in the two modes is coordinated in a mode of determining the updating determinant of the machines. It should be noted that no update machine is required to set 0 in the row.
Therefore, if the current update type of the machine to be updated is the same asynchronous mixed update, each machine k to be updated and each machine mxn-k not to be updated are determined in all machines in the workshop, and a second assignment matrix is formed after the assignment is carried out on each machine k to be updated and each machine mxn-k not to be updated
And assigning the second value matrix
Multiplied by a predetermined data transmission time ttranWith a preset single-machine update time tupdateThe sum of the two is added up to obtain the product
Further with a predetermined data transmission time ttranWith a preset single-machine update time tupdateThe sum (t) obtained by adding the twotran+tupdate) And taking the maximum value as the update consumption time, and completing the asynchronous mixed update of all the machines to be updated in the workshop by using the update consumption time.
Furthermore, the network bandwidth B represents the network bandwidth occupied by the machine during updating, and the unit is Mb/s, and the bandwidth requirement during transmission of each machine is set as B Mb/s. Production efficiency of workshop
In the synchronous and asynchronous mixed updating mode, the updating consumption time, the network bandwidth and the production efficiency are respectively expressed as Thybid、BhybidAnd Rhybid。
Therefore, the bandwidth b of the data transmission required by a single machine during the mixed update of the machine to be updated and the asynchronous update of the machine to be updated is obtained, and the number j of the asynchronously updated machines in the machine to be updated<k, multiplying the acquired bandwidth B of the data transmission required by the single machine and the acquired number j of the asynchronously updated machines after adding one, and taking the obtained product as the network bandwidth occupied by the asynchronously updated machine and the machine to be updated, namely BhybidBx (j + 1); and
obtaining the number of machines which can be used for production when the machines to be updated are asynchronously updated in the same asynchronous mixed mode, dividing the obtained number of machines which can be used for production when the machines to be updated are asynchronously updated in the same asynchronous mixed mode by the total number mxn of all machines in a workshop, and obtaining the quotient of the number of machines which can be used for production when the machines to be updated are asynchronously updated in the same asynchronous mixed mode and the total number mxn of all machines in the workshopProduction efficiency at the time of step-mix renewal, i.e.
And the number of the machines which can be used for production when the machine to be updated and the asynchronous mixed asynchronous update are updated is the difference value obtained by subtracting the obtained number of the machines which are asynchronously updated and adding one from the total number of all the machines in the workshop, namely mxn- (j + 1).
As shown in fig. 3, an application scenario of the workshop machine updating method according to the embodiment of the present invention is further described:
there are 16 production machines in plant a in 4 rows and 4 columns, where white (i.e. no undertone) is the machine to be updated. Let t be the transmission time of data from a source machine to a target machinetranThe update time of a single machine is t 5supdateAll machine updates are done in shop a 60 s:
the update consumption time T is in the above environment in three modes:
Tsynchronous＝ttran+tupdate＝65s
the occupation of the network bandwidth B in the three modes is respectively:
Bsynchronous＝n×b＝8×10Mb·s-1＝80Mb·s-1
Basynchronous＝1×b＝10Mb·s-1
Bhybid＝n×b+1×b＝4×b+b＝50Mb·s-1
the production efficiency R in the three modes is respectively as follows:
it can be seen that the comparison relationship between the above three modes can be seen in the following table 1:
TABLE 1
| Mode(s) | Time consumption T(s) | Bandwidth consumption B (Mb/s) | Production efficiency R |
| Synchronization | 65 | 80 | 0 |
| Asynchronous | 520 | 10 | 0.5000 |
| Synchronous and asynchronous mixing | 260 | 5 | 0.6875 |
By observing the table 1, the method has the advantages that the loan consumption and the production efficiency can be well coordinated by adopting the updating mode of mixing the same and asynchronous modes, the time consumption can be balanced, and the method is an updating mode with practical production significance.
As shown in fig. 4, in an embodiment of the present invention, a workshop machine update system is provided, including:
a to-be-updated machine determining unit 110, configured to determine a flow line set inside the workshop and machines respectively set in correspondence to each flow line, and distinguish the to-be-updated machine from all the machines in the workshop;
an update type detection unit 120, configured to detect a current update type of the machine to be updated; wherein the current update type is one of all synchronous, all asynchronous and synchronous;
the updating unit 130 is configured to obtain an update consumption time according to a current update type of the machine to be updated and by combining a preset data transmission time and a preset single machine update time, and complete corresponding updating of all machines to be updated in the workshop according to the update consumption time.
Wherein the updating unit 130 includes:
the synchronous updating module is used for accumulating the preset data transmission time and the preset single machine updating time if the current updating types of the machines to be updated are all synchronous, taking the sum as the updating consumption time, and completing the synchronous updating of all the machines to be updated in the workshop according to the updating consumption time;
the asynchronous updating module is used for determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop if the current updating type of the machine to be updated is completely asynchronous, assigning values to each machine to be updated and each machine which does not need to be updated to form a first assignment matrix, further multiplying the first assignment matrix by the sum of the preset data transmission time and the preset single machine updating time, taking the obtained product as the updating consumption time, and completing the asynchronous updating of all the machines to be updated in the workshop according to the updating consumption time;
and the synchronous and asynchronous mixed updating module is used for determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop if the current updating type of the machine to be updated is synchronous and asynchronous mixed updating, assigning values to each machine to be updated and each machine which does not need to be updated to form a second assignment matrix, multiplying the second assignment matrix by the sum of the accumulation of the preset data transmission time and the preset single machine updating time, comparing the obtained product with the sum of the accumulation of the preset data transmission time and the preset single machine updating time to obtain the maximum update consumption time, and finishing synchronous and asynchronous mixed updating of all machines to be updated in the workshop according to the update consumption time.
The embodiment of the invention has the following beneficial effects:
when the scale workshop machine faces the program updating problem, the invention can adopt an updating mode of synchronous updating, asynchronous updating or synchronous and asynchronous mixed updating, issues an updating command to the workshop machine, transmits data and finally completes the updating, thereby solving the program updating problem of the scale workshop machine, realizing the non-stop updating and saving time and labor.
It should be noted that, in the above system embodiment, each included unit is only divided according to functional logic, but is not limited to the above division as long as the corresponding function can be implemented; in addition, specific names of the functional units are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present invention.
It will be understood by those skilled in the art that all or part of the steps in the method for implementing the above embodiments may be implemented by relevant hardware instructed by a program, and the program may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc.
The above disclosure is only for the purpose of illustrating the preferred embodiments of the present invention, and it is therefore to be understood that the invention is not limited by the scope of the appended claims.
Claims (9)
1. A method of updating a workshop machine, the method comprising the steps of:
s1, determining a production line arranged in the workshop and machines correspondingly arranged in each production line, and distinguishing the machines to be updated from all the machines in the workshop;
s2, detecting the current update type of the machine to be updated; wherein the current update type is one of all synchronous, all asynchronous and synchronous;
and S3, obtaining the updating time consumption according to the current updating type of the machine to be updated and by combining the preset data transmission time and the preset single machine updating time, and completing the corresponding updating of all the machines to be updated in the workshop according to the updating time consumption.
2. The method for updating workshop machines of claim 1, wherein said step S3 specifically comprises:
and if the current updating types of the machines to be updated are all synchronous, accumulating the preset data transmission time and the preset single machine updating time, taking the sum as the updating consumption time, and completing the synchronous updating of all the machines to be updated in the workshop by using the updating consumption time.
3. The shop floor machine update method of claim 2, wherein the method further comprises:
acquiring the bandwidth of data transmission required by a single machine and the number of machines to be updated when all the machines to be updated are updated synchronously, multiplying the bandwidth of the data transmission required by the single machine and the number of the machines to be updated when all the machines to be updated are updated synchronously, and taking the obtained product as the network bandwidth occupied by all the machines to be updated when all the machines to be updated are updated synchronously; and
and acquiring the number of machines which can be used for production when all the machines to be updated are updated synchronously, dividing the acquired number of machines which can be used for production when all the machines to be updated are updated synchronously by the total number of all the machines in the workshop, and acquiring the quotient as the production efficiency when all the machines to be updated are updated synchronously.
4. The method for updating workshop machines of claim 1, wherein said step S3 further comprises:
if the current update types of the machines to be updated are all asynchronous, determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop, assigning values to each machine to be updated and each machine which does not need to be updated to form a first assignment matrix, further multiplying the first assignment matrix by the sum of the preset data transmission time and the preset single machine update time in an accumulation mode, taking the obtained product as the update consumption time, and completing the asynchronous update of all the machines to be updated in the workshop according to the update consumption time.
5. The shop floor machine update method of claim 4, wherein the method further comprises:
acquiring the bandwidth of data transmission required by a single machine when the machine to be updated is completely asynchronous, and directly taking the acquired bandwidth of the data transmission required by the single machine as the network bandwidth occupied by the machine to be updated when the machine to be updated is completely asynchronous; and
and acquiring the number of machines which can be used for production when all the machines to be updated are asynchronously updated, dividing the acquired number of machines which can be used for production when all the machines to be updated are asynchronously updated by the total number of all the machines in the workshop, and acquiring a quotient which is the production efficiency when all the machines to be updated are asynchronously updated.
6. The method for updating workshop machines of claim 1, wherein said step S3 further comprises:
if the current update type of the machine to be updated is synchronous and asynchronous mixed update, determining each machine to be updated and each machine which does not need to be updated in all machines in a workshop, assigning values to each machine to be updated and each machine which does not need to be updated to form a second assignment matrix, multiplying the second assignment matrix by the sum of the accumulation of the preset data transmission time and the preset single machine update time, further comparing the obtained product with the sum of the accumulation of the preset data transmission time and the preset single machine update time to obtain the maximum update consumption time, and finishing the synchronous and asynchronous mixed update of all the machines to be updated in the workshop by using the update consumption time.
7. The shop floor machine update method of claim 6, wherein the method further comprises:
acquiring the bandwidth of data transmission required by a single machine and the number of asynchronously updated machines in the machine to be updated during the mixed update of the machine to be updated and the asynchronization, multiplying the acquired bandwidth of the data transmission required by the single machine and the acquired number of the asynchronously updated machines after adding one, and taking the obtained product as the network bandwidth occupied by the machine to be updated and the asynchronization mixed update; and
the method comprises the steps of obtaining the number of machines which can be used for production when the machines to be updated and the asynchronous mixed update are asynchronously updated, dividing the obtained number of machines which can be used for production when the machines to be updated and the asynchronous mixed update are asynchronously updated by the total number of all machines in a workshop, and obtaining a quotient which is the production efficiency when the machines to be updated and the asynchronous mixed update are asynchronously updated; and the number of the machines to be updated which can be used for production during asynchronous update of the asynchronous mixed machine is the difference obtained by subtracting the obtained number of the machines to be updated and adding one to the total number of all the machines in the workshop.
8. A shop floor machine update system, comprising:
the device comprises a to-be-updated machine determining unit, a to-be-updated machine determining unit and a to-be-updated machine determining unit, wherein the to-be-updated machine determining unit is used for determining the assembly lines arranged in the workshop and the machines correspondingly arranged in each assembly line, and distinguishing the to-be-updated machines from all the machines in the workshop;
the updating type detecting unit is used for detecting the current updating type of the machine to be updated; wherein the current update type is one of all synchronous, all asynchronous and synchronous;
and the updating unit is used for obtaining the updating consumption time according to the current updating type of the machine to be updated and by combining the preset data transmission time and the preset single machine updating time, and completing the corresponding updating of all the machines to be updated in the workshop according to the updating consumption time.
9. The shop machine update system of claim 8, wherein the update unit includes:
the synchronous updating module is used for accumulating the preset data transmission time and the preset single machine updating time if the current updating types of the machines to be updated are all synchronous, taking the sum as the updating consumption time, and completing the synchronous updating of all the machines to be updated in the workshop according to the updating consumption time;
the asynchronous updating module is used for determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop if the current updating type of the machine to be updated is completely asynchronous, assigning values to each machine to be updated and each machine which does not need to be updated to form a first assignment matrix, further multiplying the first assignment matrix by the sum of the preset data transmission time and the preset single machine updating time, taking the obtained product as the updating consumption time, and completing the asynchronous updating of all the machines to be updated in the workshop according to the updating consumption time;
and the synchronous and asynchronous mixed updating module is used for determining each machine to be updated and each machine which does not need to be updated in all machines in the workshop if the current updating type of the machine to be updated is synchronous and asynchronous mixed updating, assigning values to each machine to be updated and each machine which does not need to be updated to form a second assignment matrix, multiplying the second assignment matrix by the sum of the accumulation of the preset data transmission time and the preset single machine updating time, comparing the obtained product with the sum of the accumulation of the preset data transmission time and the preset single machine updating time to obtain the maximum update consumption time, and finishing synchronous and asynchronous mixed updating of all machines to be updated in the workshop according to the update consumption time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110595018.0A CN113504933A (en) | 2021-05-28 | 2021-05-28 | Workshop machine updating method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110595018.0A CN113504933A (en) | 2021-05-28 | 2021-05-28 | Workshop machine updating method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113504933A true CN113504933A (en) | 2021-10-15 |
Family
ID=78008784
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110595018.0A Pending CN113504933A (en) | 2021-05-28 | 2021-05-28 | Workshop machine updating method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113504933A (en) |
Citations (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030078063A1 (en) * | 2000-01-27 | 2003-04-24 | Yvon Legallais | Method for isochronous resource management in a network based on hiperlan 2 techonology |
| CN1614933A (en) * | 2003-11-05 | 2005-05-11 | 华为技术有限公司 | Method for updating system apparatus |
| DE102009006121A1 (en) * | 2009-01-26 | 2010-08-05 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Upgrading kit for upgrading motor vehicle to hybrid vehicle, has control circuit adjusting electrical power for supply to electric machine, where power is stored in energy storage, drawn through conversion and provided at energy connection |
| CN103001985A (en) * | 2011-09-14 | 2013-03-27 | 腾讯科技（深圳）有限公司 | Method for controlling server bandwidth in software upgrading, upgrading configuration server and upgrading configuration system |
| CN103986771A (en) * | 2014-05-22 | 2014-08-13 | 浪潮电子信息产业股份有限公司 | High-availability cluster management method independent of shared storage |
| CN104244306A (en) * | 2014-09-15 | 2014-12-24 | 杭州华三通信技术有限公司 | Method and device for upgrading access point firmware |
| US9239711B1 (en) * | 2013-12-31 | 2016-01-19 | Google Inc. | Run benchmark or analysis tools against massive repository of archived webpages on machines in the cloud for continuous builds or AD-HOC requests |
| US10114582B1 (en) * | 2016-12-28 | 2018-10-30 | EMC IP Holdinig Company LLC | Dynamically selecting between sync and async replication modes |
| CN108881989A (en) * | 2018-06-12 | 2018-11-23 | 深圳国微视安科技有限公司 | A kind of quick plug-flow control method of live streaming TS program and system |
| CN109002305A (en) * | 2017-06-05 | 2018-12-14 | 深圳市海洋王照明工程有限公司 | A kind of update method and its system of device program |
| CN109214695A (en) * | 2018-09-18 | 2019-01-15 | 合肥工业大学 | Based on the high-end equipment research and development manufacture coordinated dispatching method and system for improving EDA |
| CN110830554A (en) * | 2019-10-14 | 2020-02-21 | 珠海金山网络游戏科技有限公司 | Method and system for asynchronously and concurrently updating distributed node mirror image |
| CN111399878A (en) * | 2020-03-10 | 2020-07-10 | 珠海格力电器股份有限公司 | Data transmission method and device and method and device for upgrading multi-connected cluster system unit |
| CN111708558A (en) * | 2020-06-10 | 2020-09-25 | 深圳大漠大智控技术有限公司 | High-concurrency terminal firmware updating method and updating system |
| CN111736875A (en) * | 2020-06-28 | 2020-10-02 | 深圳前海微众银行股份有限公司 | Version updating monitoring method, device, equipment and computer storage medium |
| CN112099823A (en) * | 2020-08-31 | 2020-12-18 | 新华三信息技术有限公司 | Firmware upgrading method, device, equipment and machine readable storage medium |
| CN112148333A (en) * | 2020-10-10 | 2020-12-29 | 上海聪链信息科技有限公司 | Block chain server firmware updating system |
| CN112181463A (en) * | 2020-09-29 | 2021-01-05 | 广州汽车集团股份有限公司 | ECU updating method and main node equipment |
-
2021
- 2021-05-28 CN CN202110595018.0A patent/CN113504933A/en active Pending
Patent Citations (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030078063A1 (en) * | 2000-01-27 | 2003-04-24 | Yvon Legallais | Method for isochronous resource management in a network based on hiperlan 2 techonology |
| CN1614933A (en) * | 2003-11-05 | 2005-05-11 | 华为技术有限公司 | Method for updating system apparatus |
| DE102009006121A1 (en) * | 2009-01-26 | 2010-08-05 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Upgrading kit for upgrading motor vehicle to hybrid vehicle, has control circuit adjusting electrical power for supply to electric machine, where power is stored in energy storage, drawn through conversion and provided at energy connection |
| CN103001985A (en) * | 2011-09-14 | 2013-03-27 | 腾讯科技（深圳）有限公司 | Method for controlling server bandwidth in software upgrading, upgrading configuration server and upgrading configuration system |
| US9239711B1 (en) * | 2013-12-31 | 2016-01-19 | Google Inc. | Run benchmark or analysis tools against massive repository of archived webpages on machines in the cloud for continuous builds or AD-HOC requests |
| CN103986771A (en) * | 2014-05-22 | 2014-08-13 | 浪潮电子信息产业股份有限公司 | High-availability cluster management method independent of shared storage |
| CN104244306A (en) * | 2014-09-15 | 2014-12-24 | 杭州华三通信技术有限公司 | Method and device for upgrading access point firmware |
| US10114582B1 (en) * | 2016-12-28 | 2018-10-30 | EMC IP Holdinig Company LLC | Dynamically selecting between sync and async replication modes |
| CN109002305A (en) * | 2017-06-05 | 2018-12-14 | 深圳市海洋王照明工程有限公司 | A kind of update method and its system of device program |
| CN108881989A (en) * | 2018-06-12 | 2018-11-23 | 深圳国微视安科技有限公司 | A kind of quick plug-flow control method of live streaming TS program and system |
| CN109214695A (en) * | 2018-09-18 | 2019-01-15 | 合肥工业大学 | Based on the high-end equipment research and development manufacture coordinated dispatching method and system for improving EDA |
| CN110830554A (en) * | 2019-10-14 | 2020-02-21 | 珠海金山网络游戏科技有限公司 | Method and system for asynchronously and concurrently updating distributed node mirror image |
| CN111399878A (en) * | 2020-03-10 | 2020-07-10 | 珠海格力电器股份有限公司 | Data transmission method and device and method and device for upgrading multi-connected cluster system unit |
| CN111708558A (en) * | 2020-06-10 | 2020-09-25 | 深圳大漠大智控技术有限公司 | High-concurrency terminal firmware updating method and updating system |
| CN111736875A (en) * | 2020-06-28 | 2020-10-02 | 深圳前海微众银行股份有限公司 | Version updating monitoring method, device, equipment and computer storage medium |
| CN112099823A (en) * | 2020-08-31 | 2020-12-18 | 新华三信息技术有限公司 | Firmware upgrading method, device, equipment and machine readable storage medium |
| CN112181463A (en) * | 2020-09-29 | 2021-01-05 | 广州汽车集团股份有限公司 | ECU updating method and main node equipment |
| CN112148333A (en) * | 2020-10-10 | 2020-12-29 | 上海聪链信息科技有限公司 | Block chain server firmware updating system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106649378B (en) | Data synchronization method and device | |
| CN105009110A (en) | Method for automated scaling of massive parallel processing (mpp) database | |
| CN102662639A (en) | Mapreduce-based multi-GPU (Graphic Processing Unit) cooperative computing method | |
| CN101887367A (en) | Multi-level parallel programming method | |
| CN106570027B (en) | Transactional task processing method and device | |
| CN105786405A (en) | Online upgrading method, device and system | |
| CN105183880A (en) | Hash join method and device | |
| CN104063361A (en) | Report design method and system | |
| CN106708620A (en) | Data processing method and system | |
| CN106209974B (en) | A kind of method of data synchronization, equipment and system | |
| CN111143368A (en) | Relational database data comparison method and system | |
| CN104871153A (en) | System and method for flexible distributed massively parallel processing (mpp) database | |
| Luo et al. | A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness | |
| CN112667612A (en) | Data quality checking method and device, electronic equipment and storage medium | |
| CN109753593A (en) | Spraying operation method for scheduling task and unmanned plane | |
| CN112256698A (en) | Automatic table relation association method based on multi-Hash function | |
| CN104951565A (en) | XML configuration maintenance method and system based on memory database | |
| CN106933512A (en) | The method and its equipment of a kind of reading and writing data | |
| CN114490586A (en) | Medical information safe storage cooperation system based on block chain | |
| CN113504933A (en) | Workshop machine updating method and system | |
| CN113434501A (en) | Storage method and device of relational database table and readable storage medium | |
| JP2001019129A (en) | Picking commodity arranging method | |
| CN106100897A (en) | A kind of device and method monitoring data autoplacement | |
| CN102929850B (en) | Report data treating apparatus and method for processing report data | |
| CN102306199A (en) | Data management device and data management method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |