CN112529260A - Distributed scheduling system based on competitiveness and scheduling method thereof - Google Patents
Distributed scheduling system based on competitiveness and scheduling method thereof Download PDFInfo
- Publication number
- CN112529260A CN112529260A CN202011354205.1A CN202011354205A CN112529260A CN 112529260 A CN112529260 A CN 112529260A CN 202011354205 A CN202011354205 A CN 202011354205A CN 112529260 A CN112529260 A CN 112529260A
- Authority
- CN
- China
- Prior art keywords
- producer
- resources
- consumer
- resource
- scheduling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000004519 manufacturing process Methods 0.000 claims abstract description 24
- 238000012546 transfer Methods 0.000 claims abstract description 10
- 230000008569 process Effects 0.000 claims description 16
- 230000001360 synchronised effect Effects 0.000 claims description 8
- 238000011156 evaluation Methods 0.000 claims description 6
- 230000004044 response Effects 0.000 claims description 5
- 230000002618 waking effect Effects 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 2
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000012384 transportation and delivery Methods 0.000 description 2
- 206010063385 Intellectualisation Diseases 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000033764 rhythmic process Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
- G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
- G16Y10/00—Economic sectors
- G16Y10/25—Manufacturing
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
- G16Y20/00—Information sensed or collected by the things
- G16Y20/30—Information sensed or collected by the things relating to resources, e.g. consumed power
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
- G16Y40/00—IoT characterised by the purpose of the information processing
- G16Y40/30—Control
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Educational Administration (AREA)
- Computing Systems (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Accounting & Taxation (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the technical field of distributed scheduling, in particular to a distributed scheduling system based on competitiveness and a scheduling method thereof, which comprises the following steps: the system comprises a consumer set, a producer set and a scheduling center, wherein the consumer set, the producer set and the scheduling center are responsible for communicating all consumers and producers and deciding to schedule resources of the producers to the consumers; the resource transfer control is responsible for transferring the resources of the consumers and the producers according to the instructions of the dispatching center, and comprises the following specific steps: s1, dynamically allocating tasks of the workstation; s2, competing production by a plurality of producers; s3, a plurality of consumers compete for resources; s4, configuring the current resources of the system to the optimal position, dividing the devices of the whole production line according to the producer, the consumer, the dispatching center and the transfer control function, utilizing the system architecture for synchronizing and managing the production and consumption relation of multiple devices in a competition-based mode, processing the double-door algorithm of the distributed concurrent information synchronization, and designing the virtual devices for adapting to the system robustness.
Description
Technical Field
The invention relates to the technical field of distributed scheduling, in particular to a distributed scheduling system based on competitiveness and a scheduling method thereof.
Background
At present, along with the perfection and popularization of Internet of things and big data infrastructure, production factories of flow lines begin to develop towards intellectualization and unmanned. The intelligent factory assembly line requires smooth information exchange among equipment, smooth automatic flow among objects and digital recording and management of all production and transportation links. More importantly, the intelligent system can intelligently manage and schedule the production and transportation links of the whole factory. In a production line, there are often times a process that can be handled by multiple workers, such as sorting tasks. In an unmanned intelligent plant, one person's location is replaced by a function-specific workstation. In order for multiple workstations to simultaneously process the same process, the scheduling system requires concurrent and synchronous management, scheduling, distribution, tasks and materials. Meanwhile, the working progress of each device and each sub-workstation can be monitored in real time, so that estimation is carried out according to each state of the whole production line, and a decision is made for the scheduling of the next resource and task. With the increase of the number of concurrent workstations, the amount of information that the scheduling system needs to synchronize a plurality of workstations increases synchronously, and the complexity geometry of summarizing and analyzing the overall data content increases. In this process, once a workstation fails to synchronize information, or other errors occur, analysis of the scheduling system poses a significant challenge. A mechanism is needed to process information concurrently to improve the robustness of the system.
Disclosure of Invention
In order to solve the above problems, the present invention provides a distributed scheduling system based on contention and a scheduling method thereof.
A distributed scheduling system based on competitiveness comprises an upper computer used for distributing tasks, and comprises:
a set of consumers, a set of multiple consumers, a device for applying for a resource;
the producer set is a set of a plurality of producers and is used for producing resources and applying for and waiting for equipment with the resources scheduled;
the dispatching center is responsible for communicating all consumers and producers and deciding to dispatch the resources of the producers to the consumers;
and the resource transfer control is responsible for transferring the resources of the consumers and the producers according to the instructions of the dispatching center.
The scheduling method of the distributed scheduling system based on the competitiveness comprises the following specific steps:
s1, dynamic allocation of workstation tasks:
a: the method comprises the following steps that firstly, an upper computer sends a task to a scheduling system at any time, the scheduling system broadcasts the task to all workstations after obtaining the task, the idle workstations determine whether to apply for the task according to self conditions, and the scores are calculated according to the demand degree;
b: the dispatching system obtains the demand scores of all the workstations applying for the task through a double-gate algorithm, makes a decision by taking the scores as a reference, selects the best workstation, informs the accepted workstation of obtaining the task, and dynamically allocates the tasks of the workstations;
s2, competing production by multiple producers:
a: the scheduling system acquires the resource transferring requests of production of all application producers through a double-gate algorithm;
b: informing the accepted producer that the request is accepted, deciding the best producer by the dispatching system through the request information of the producer, and immediately preparing and waiting for the resource to be carried away by the conveying equipment by the informed producer;
s3, multiple consumers competing for resources:
a: the scheduling system broadcasts the resource information to be received by the producer to be received, and the consumer requests the resource through a double-gate algorithm according to the self state;
b: the scheduling system decides the best consumer of the current resources according to the request information of the consumer and informs the accepted consumer that the resources can be obtained;
c: the consumer immediately prepares and waits for resources to be transferred to the material loading port by the conveying equipment, and then the dispatching system informs the conveying equipment to transfer the resources from the material loading port of the corresponding producer to the material loading port corresponding to the consumer;
and S4, configuring the current resources of the system to the optimal position.
The double-gate algorithm of step S1 is to implement the above one-to-many information exchange, information synchronization and information high response requirements, and the system synchronization information is to actively submit information to the mutually exclusive accessible memory of the system, i.e. the critical section, by the producer or the consumer.
The double-gate algorithm comprises the following steps:
defining critical sections: is an accessible shared resource which cannot be accessed by a plurality of threads or processes at the same time, and the critical section is denoted as M;
thread: the minimum unit capable of independently calculating and scheduling in the system can independently apply for and access resources in the scheduling system, a producer and a consumer are independent threads, and the set of all the threads is represented as P;
a system interception door: signals for intercepting, sleeping and waking up threads in the operating system, there are two groups of signals in the scheduling system, denoted as D1 and D2;
and (3) sleep in an incoming line: the incoming thread enters a sleep state, does not work any more and waits to be awakened;
and (3) line inlet procedure awakening: the incoming thread is awakened by the operating system and continues to work;
when threads enter critical sections of resources in sequence, here denoted as
～M。
The specific operation steps of the double-gate algorithm are as follows:
s1, initializing all threads, namely P0, P1 and p2.. pn belongs to P, and initializing a system synchronous interception gate D1, a system synchronous interception gate D2 and a critical zone M;
s2, intercepting all threads by a first gate D1, and entering a sleeping state;
s3, the system opens the first door D1, the awakened thread enters the critical zone in sequence to submit the competition score, namely,
m, meanwhile, the second door is in a closed state, and the thread accessing the critical area is intercepted and enters a sleep state;
s4, after the time t0, the system informs the winning thread of applying acceptance and the resources are about to be scheduled according to the voting score decision of all threads in the critical zone;
s5, the system closes the first door D1 and prepares to intercept the thread ready to enter the first door;
s6, the system opens a second door D2 and wakes up all threads to repeat the next cycle;
s7, the awakened thread continues to loop to step S2.
The request of step S2 includes information of the resource produced by the producer, a score evaluation of the urgent need degree of the producer for transferring the produced resource, and a specific blanking position class of the resource.
The request of step S3 includes the consumer information, the evaluation score of the urgency level of the consumer for the resource, and the loading position class of the resource to be requested.
The invention has the beneficial effects that: the invention divides the equipment of the whole production line according to the functions of a producer, a consumer, a dispatching center and a transfer control, utilizes a system architecture for synchronizing and managing the production and consumption relations of multiple equipment in a competition-based mode, processes a double-door algorithm of distributed concurrent information synchronization, and is designed for virtual equipment suitable for system robustness.
Drawings
The invention is further illustrated with reference to the following figures and examples.
FIG. 1 is a block diagram of a virtual device architecture of the present invention;
FIG. 2 is a block diagram of a scheduling system according to the present invention;
FIG. 3 is a block diagram of an abstraction process competition structure of the present invention;
FIG. 4 is a block diagram of a dual gate algorithm of the present invention;
FIG. 5 is a block diagram of a flow structure of a scheduling system according to the present invention.
Detailed Description
In order to make the technical means, the creation characteristics, the achievement purposes and the effects of the invention easy to understand, the invention is further explained below.
As shown in fig. 1 to 5, a distributed scheduling system based on contention, which includes an upper computer for distributing tasks, includes:
a set of consumers, a set of multiple consumers, a device for applying for a resource;
the producer set is a set of a plurality of producers and is used for producing resources and applying for and waiting for equipment with the resources scheduled;
the dispatching center is responsible for communicating all consumers and producers and deciding to dispatch the resources of the producers to the consumers;
and the resource transfer control is responsible for transferring the resources of the consumers and the producers according to the instructions of the dispatching center.
The following improvements and innovations are made in the scheduling system based on concurrency:
1) and (3) equipment identity classification: the devices are divided into producers, consumers and controlled devices, the producer can actively send a request to the scheduling system to send the ready resource to the delivery device, and the producer can either actively or passively give the resource to the delivery device as soon as it is approved by the system; the consumer may actively request the system to send the resource to itself, and once granted, the system immediately dispatches the current resource to the consumer. The controlled equipment provides a protocol interface and is called by other identity type equipment;
2) designing a resource competition system of the equipment: the producer and the consumer competitively produce and consume resources in a scoring mode according to the self urgent need degree and the self condition, the system orderly determines the current producer and consumer according to the scores submitted by each identity device and the system environment state, and essentially partially and simultaneously completes the system decision on each device, thereby reducing the complexity of the system decision;
3) setting up a virtual device: as shown in fig. 1, the virtual device is responsible for communicating with the scheduling system, managing data information of itself, synchronizing real hardware devices and device security detection, and the establishment of the virtual device is beneficial to improving the robustness of the system; when any equipment has a problem, the virtual system can continue to work, and alarm and submit records.
The scheduling system is an abstract process of one-time competition, and the abstract process is as follows:
through competition, the scheduling system finds the only optimal producer in the producer set;
the scheduling system broadcasts the production resource information of the unique optimal producer to the consumer set;
the consumer sets compete for the resources through competition, and the scheduling system determines the only optimal consumers;
the scheduling system transfers the resources from the current optimal producer to the current optimal consumer, and one complete competition is completed.
The competition mode of the dispatching system is completely embodied in a score form, and according to the rule, the producer/consumer with the highest competition score preferentially obtains the configuration right of the dispatching system.
The competition rules are determined according to the current production environment and the production target.
The design of the competition rules determines the operating efficiency of the current system.
The competition is completely quantified in a score mode, and the scheduling system determines a competition winner according to the score.
Consumers and producers who do not participate in the competition do not submit scores.
The information communication mode of the dispatching center and the consumers and the producers adopts one-to-many information communication, and the dispatching center often has one-to-many information communication mode with the consumers and the producers because the producers and the consumers are not unique and each device operates independently.
The dispatching center needs to synchronize producer information and consumer information sequentially, and in the process of synchronizing the producer information and the producer aggregate information, consumers are guaranteed to be silent so as to avoid the problem of information confusion and vice versa.
The dispatch center needs to maintain a state of high response from time to time with all consumers and producers, and when the dispatch center opens consumer competition, it needs to obtain the competitive response of all consumers in a short time.
The invention divides the equipment of the whole production line according to the functions of a producer, a consumer, a dispatching center and a transfer control, utilizes a system architecture for synchronizing and managing the production and consumption relations of multiple equipment in a competition-based mode, processes a double-door algorithm of distributed concurrent information synchronization, and is designed for virtual equipment suitable for system robustness.
The invention enables the subsystems in the system to participate in decision making according to the grasped local information, optimizes the efficiency of overall decision making, in a distributed system, each sub-node and subsystem, such as a single device, grasps the information of the sub-node and the subsystem most comprehensively, and a producer and a consumer in each device can actively calculate and give the demand degree of the subsystem to a scheduling system according to the identity and the state of the producer and the consumer like people. The central scheduling system optimizes the resource allocation according to the demand degree of the subsystems, so that the resource scheduling is more optimized and the decision is more efficient.
The scheduling method of the distributed scheduling system based on the competitiveness comprises the following specific steps:
s1, dynamic allocation of workstation tasks:
a: the method comprises the following steps that firstly, an upper computer sends a task to a scheduling system at any time, the scheduling system broadcasts the task to all workstations after obtaining the task, the idle workstations determine whether to apply for the task according to self conditions, and the scores are calculated according to the demand degree;
b: the dispatching system obtains the demand scores of all the workstations applying for the task through a double-gate algorithm, makes a decision by taking the scores as a reference, selects the best workstation, informs the accepted workstation of obtaining the task, and dynamically allocates the tasks of the workstations;
s2, competing production by multiple producers:
a: the scheduling system acquires the resource transferring requests of production of all application producers through a double-gate algorithm;
b: informing the accepted producer that the request is accepted, deciding the best producer by the dispatching system through the request information of the producer, and immediately preparing and waiting for the resource to be carried away by the conveying equipment by the informed producer;
s3, multiple consumers competing for resources:
a: the scheduling system broadcasts the resource information to be received by the producer to be received, and the consumer requests the resource through a double-gate algorithm according to the self state;
b: the scheduling system decides the best consumer of the current resources according to the request information of the consumer and informs the accepted consumer that the resources can be obtained;
c: the consumer immediately prepares and waits for resources to be transferred to the material loading port by the conveying equipment, and then the dispatching system informs the conveying equipment to transfer the resources from the material loading port of the corresponding producer to the material loading port corresponding to the consumer;
and S4, configuring the current resources of the system to the optimal position.
The double-gate algorithm of step S1 is to implement the above one-to-many information exchange, information synchronization and information high response requirements, and the system synchronization information is to actively submit information to the mutually exclusive accessible memory of the system, i.e. the critical section, by the producer or the consumer.
The scheduling system is more robust and extensible in operation, when a part of equipment of a producer and a consumer fails to work due to the fact that a part of equipment of the producer and the consumer fails to work, the subsystem does not participate in decision making and resource demanding, and the subsystem does not participate in production. And then the fault system is automatically eliminated outside the system, and the whole system is operated abnormally and is not influenced by the fault system. When the subsystem is cleared of faults, the subsystem continues to participate in decision making and resource application processes. Under the condition that the system is not stopped, any subsystem can participate and quit the production process of the system at will. Finally, the whole system has high robustness and expandability.
The invention has excellent concurrency processing capability, enables the dispatching system to quickly and effectively respond to the concurrent requirements of the subsystem and the sub-thread by increasing the design of the double-gate algorithm, and solves the problem of concurrent communication resource preemption in the algorithm.
The double-gate algorithm comprises the following steps:
defining critical sections: is an accessible shared resource which cannot be accessed by a plurality of threads or processes at the same time, and the critical section is denoted as M;
thread: the minimum unit capable of independently calculating and scheduling in the system can independently apply for and access resources in the scheduling system, a producer and a consumer are independent threads, and the set of all the threads is represented as P;
a system interception door: signals for intercepting, sleeping and waking up threads in the operating system, there are two groups of signals in the scheduling system, denoted as D1 and D2;
and (3) sleep in an incoming line: the incoming thread enters a sleep state, does not work any more and waits to be awakened;
and (3) line inlet procedure awakening: the incoming thread is awakened by the operating system and continues to work;
when threads enter critical sections of resources in sequence, here denoted as
～M。
The double-gate algorithm is that in the process of concurrent communication of the production system, a subsystem consumer may generate a repeated consumption problem and a synchronization problem of information of each thread. The double-gate algorithm orderly controls the thread information synchronization and solves the problem of resource repeated consumption by setting two 'gates' of the rhythm of accessing the resource critical area by the synchronous threads.
The specific operation steps of the double-gate algorithm are as follows:
s1, initializing all threads, namely P0, P1 and p2.. pn belongs to P, and initializing a system synchronous interception gate D1, a system synchronous interception gate D2 and a critical zone M;
s2, intercepting all threads by a first gate D1, and entering a sleeping state;
s3, the system opens the first door D1, the awakened thread enters the critical zone in sequence to submit the competition score, namely,
m, meanwhile, the second door is in a closed state, and the thread accessing the critical area is intercepted and enters a sleep state;
s4, after the time t0, the system informs the winning thread of applying acceptance and the resources are about to be scheduled according to the voting score decision of all threads in the critical zone;
s5, the system closes the first door D1 and prepares to intercept the thread ready to enter the first door;
s6, the system opens a second door D2 and wakes up all threads to repeat the next cycle;
s7, the awakened thread continues to loop to step S2.
The request of step S2 includes information of the resource produced by the producer, a score evaluation of the urgent need degree of the producer for transferring the produced resource, and a specific blanking position class of the resource.
The request of step S3 includes the consumer information, the evaluation score of the urgency level of the consumer for the resource, and the loading position class of the resource to be requested.
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are merely illustrative of the principles of the invention, but that various changes and modifications may be made without departing from the spirit and scope of the invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (7)
1. Distributed scheduling system based on competitiveness, including the host computer that is used for distributing the task, its characterized in that: the method comprises the following steps:
a set of consumers, a set of multiple consumers, a device for applying for a resource;
the producer set is a set of a plurality of producers and is used for producing resources and applying for and waiting for equipment with the resources scheduled;
the dispatching center is responsible for communicating all consumers and producers and deciding to dispatch the resources of the producers to the consumers;
and the resource transfer control is responsible for transferring the resources of the consumers and the producers according to the instructions of the dispatching center.
2. The scheduling method using the contention-based distributed scheduling system of claim 1, wherein: the method comprises the following specific steps:
s1, dynamic allocation of workstation tasks:
a: the method comprises the following steps that firstly, an upper computer sends a task to a scheduling system at any time, the scheduling system broadcasts the task to all workstations after obtaining the task, the idle workstations determine whether to apply for the task according to self conditions, and the scores are calculated according to the demand degree;
b: the dispatching system obtains the demand scores of all the workstations applying for the task through a double-gate algorithm, makes a decision by taking the scores as a reference, selects the best workstation, informs the accepted workstation of obtaining the task, and dynamically allocates the tasks of the workstations;
s2, competing production by multiple producers:
a: the scheduling system acquires the resource transferring requests of production of all application producers through a double-gate algorithm;
b: informing the accepted producer that the request is accepted, deciding the best producer by the dispatching system through the request information of the producer, and immediately preparing and waiting for the resource to be carried away by the conveying equipment by the informed producer;
s3, multiple consumers competing for resources:
a: the scheduling system broadcasts the resource information to be received by the producer to be received, and the consumer requests the resource through a double-gate algorithm according to the self state;
b: the scheduling system decides the best consumer of the current resources according to the request information of the consumer and informs the accepted consumer that the resources can be obtained;
c: the consumer immediately prepares and waits for resources to be transferred to the material loading port by the conveying equipment, and then the dispatching system informs the conveying equipment of transferring from the corresponding producer material unloading port to the material loading port corresponding to the consumer;
and S4, configuring the current resources of the system to the optimal position.
3. The method of claim 2, wherein: the double-gate algorithm of step S1 is to implement the above one-to-many information exchange, information synchronization and information high response requirements, and the system synchronization information is to actively submit information to the mutually exclusive accessible memory of the system, i.e. the critical section, by the producer or the consumer.
4. The method of claim 3, wherein: the double-gate algorithm comprises the following steps:
defining critical sections: is an accessible shared resource which cannot be accessed by a plurality of threads or processes at the same time, and the critical section is denoted as M;
thread: the minimum unit capable of independently calculating and scheduling in the system can independently apply for and access resources in the scheduling system, a producer and a consumer are independent threads, and the set of all the threads is represented as P;
a system interception door: signals for intercepting, sleeping and waking up threads in the operating system, there are two groups of signals in the scheduling system, denoted as D1 and D2;
and (3) sleep in an incoming line: the incoming thread enters a sleep state, does not work any more and waits to be awakened;
and (3) line inlet procedure awakening: the incoming thread is awakened by the operating system and continues to work;
when threads enter critical sections of resources in sequence, here denoted as
5. The method of claim 4, wherein the method comprises: the specific operation steps of the double-gate algorithm are as follows:
s1, initializing all threads, namely P0, P1 and p2.. pn belongs to P, and initializing a system synchronous interception gate D1, a system synchronous interception gate D2 and a critical zone M;
s2, intercepting all threads by a first gate D1, and entering a sleeping state;
s3, the system opens the first door D1, the awakened thread enters the critical zone in sequence to submit the competition score, namely,
meanwhile, the second door is in a closed state, and the thread accessing the critical area is intercepted and enters a sleep state;
s4, after the time t0, the system informs the winning thread of applying acceptance and the resources are about to be scheduled according to the voting score decision of all threads in the critical zone;
s5, the system closes the first door D1 and prepares to intercept the thread ready to enter the first door;
s6, the system opens a second door D2 and wakes up all threads to repeat the next cycle;
s7, the awakened thread continues to loop to step S2.
6. The method of claim 2, wherein: the request of step S2 includes information of the resource produced by the producer, a score evaluation of the urgent need degree of the producer for transferring the produced resource, and a specific blanking position class of the resource.
7. The method of claim 2, wherein: the request of step S3 includes the consumer information, the evaluation score of the urgency level of the consumer for the resource, and the loading position class of the resource to be requested.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011354205.1A CN112529260A (en) | 2020-11-26 | 2020-11-26 | Distributed scheduling system based on competitiveness and scheduling method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011354205.1A CN112529260A (en) | 2020-11-26 | 2020-11-26 | Distributed scheduling system based on competitiveness and scheduling method thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112529260A true CN112529260A (en) | 2021-03-19 |
Family
ID=74994280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011354205.1A Pending CN112529260A (en) | 2020-11-26 | 2020-11-26 | Distributed scheduling system based on competitiveness and scheduling method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112529260A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1339927A (en) * | 2001-10-15 | 2002-03-13 | 杨大成 | High efficiency mobile communication resource regulating method by using controlled feedback |
| US20070261057A1 (en) * | 2006-05-04 | 2007-11-08 | Sun Microsystems, Inc. | Multi-threaded shared state variable control |
| CN102298539A (en) * | 2011-06-07 | 2011-12-28 | 华东师范大学 | Method and system for scheduling shared resources subjected to distributed parallel treatment |
| CN110062038A (en) * | 2019-04-09 | 2019-07-26 | 网宿科技股份有限公司 | A kind of data transmission scheduling method and system |
| CN111555957A (en) * | 2020-03-26 | 2020-08-18 | 孩子王儿童用品股份有限公司 | Kafka-based synchronous message service system and implementation method |
-
2020
- 2020-11-26 CN CN202011354205.1A patent/CN112529260A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1339927A (en) * | 2001-10-15 | 2002-03-13 | 杨大成 | High efficiency mobile communication resource regulating method by using controlled feedback |
| US20070261057A1 (en) * | 2006-05-04 | 2007-11-08 | Sun Microsystems, Inc. | Multi-threaded shared state variable control |
| CN102298539A (en) * | 2011-06-07 | 2011-12-28 | 华东师范大学 | Method and system for scheduling shared resources subjected to distributed parallel treatment |
| CN110062038A (en) * | 2019-04-09 | 2019-07-26 | 网宿科技股份有限公司 | A kind of data transmission scheduling method and system |
| CN111555957A (en) * | 2020-03-26 | 2020-08-18 | 孩子王儿童用品股份有限公司 | Kafka-based synchronous message service system and implementation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xie et al. | Sync or async: Time to fuse for distributed graph-parallel computation | |
| CN106843170B (en) | Method for scheduling task based on token | |
| CN105320561B (en) | Task management method and system | |
| CN109271015B (en) | Method for reducing energy consumption of large-scale distributed machine learning system | |
| CN102043675B (en) | Thread pool management method based on task quantity of task processing request | |
| CN104991830A (en) | YARN resource allocation and energy-saving scheduling method and system based on service level agreement | |
| CN104063279B (en) | Method for scheduling task, device and terminal | |
| US20130198755A1 (en) | Apparatus and method for managing resources in cluster computing environment | |
| CN108958157A (en) | Control process control dispatching method, device, computer equipment and storage medium | |
| KR20170116439A (en) | Apparatus for scheduling task | |
| CN103268258B (en) | A kind of satellite ground remote control is issued an order method of controlling security | |
| CN103927225A (en) | Multi-core framework Internet information processing and optimizing method | |
| CN106155794B (en) | A kind of event dispatcher method and device applied in multi-threaded system | |
| CN104090826B (en) | Task optimization deployment method based on correlation | |
| Shi et al. | HySync: Hybrid federated learning with effective synchronization | |
| CN103677959B (en) | A kind of virtual machine cluster migration method and system based on multicast | |
| CN112529260A (en) | Distributed scheduling system based on competitiveness and scheduling method thereof | |
| Li et al. | An adaptive cpu-gpu governing framework for mobile games on big. little architectures | |
| US20240004707A1 (en) | Methods and systems for energy-efficient scheduling of periodic tasks on a group of processing devices | |
| Yang et al. | Study on static task scheduling based on heterogeneous multi-core processor | |
| CN113238484B (en) | Parallel particle swarm method based on intelligent islands | |
| WO2021208240A1 (en) | Pull mode and push mode combined resource management and job scheduling method and system, and medium | |
| CN109144709A (en) | A kind of unbalanced method of processing big data platform YARN data distribution | |
| CN110347461B (en) | Airplane cockpit human-computer interface information scheduling system and method based on migration workflow | |
| CN109413489B (en) | Serial multi-thread bullet screen distribution method, device, equipment and storage medium |
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 |