CN112561264A - Service method, service system and storage medium for enterprise content - Google Patents
Service method, service system and storage medium for enterprise content Download PDFInfo
- Publication number
- CN112561264A CN112561264A CN202011401112.XA CN202011401112A CN112561264A CN 112561264 A CN112561264 A CN 112561264A CN 202011401112 A CN202011401112 A CN 202011401112A CN 112561264 A CN112561264 A CN 112561264A
- Authority
- CN
- China
- Prior art keywords
- served
- task
- service
- target
- server
- 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 78
- 238000012545 processing Methods 0.000 claims description 89
- 230000008569 process Effects 0.000 claims description 34
- 238000004590 computer program Methods 0.000 claims description 15
- 239000000284 extract Substances 0.000 claims description 7
- 230000006870 function Effects 0.000 description 55
- 238000010586 diagram Methods 0.000 description 8
- 238000013475 authorization Methods 0.000 description 7
- 230000009193 crawling Effects 0.000 description 7
- 238000000605 extraction Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 4
- 238000006243 chemical reaction Methods 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 208000018910 keratinopathic ichthyosis Diseases 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000007704 transition 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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- 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/06—Energy or water supply
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Development Economics (AREA)
- Software Systems (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- General Business, Economics & Management (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- General Engineering & Computer Science (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application relates to a service method, a service system and a storage medium of enterprise content. The method is applied to a service system, and the service system comprises a scheduling server and a plurality of independently deployed function servers; the method comprises the following steps: the scheduling server receives a plurality of service requests sent by a plurality of function servers; the service request carries the identification of the functional server, and is used for indicating the target service type which is currently in a serviceable state in the functional server corresponding to the identification to the scheduling server; the scheduling server acquires a target task to be served from a preset table interface according to a preset service capturing strategy; and the scheduling server sends the target task to be served to the functional server corresponding to the identifier to serve the target service type. By adopting the method, when the service on one functional server is down, the service on other functional servers is not influenced, the robustness of the whole service system is improved, and the efficiency and the stability of the enterprise content service are further improved.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a service method, a service system, and a storage medium for enterprise content.
Background
The nuclear power design and engineering construction process has huge and complex electronic documents, and due to the particularity of the nuclear power engineering, the state has high quality and protection requirements on enterprise contents (including engineering letters, technical files, electronic files and the like) generated in the nuclear power business production process.
The content production of the nuclear power enterprise needs two stages of fronthaul control and backend control, wherein the fronthaul control stage comprises level-by-level editing, checking, auditing, approving and the like, and is focused on content management and control of the nuclear power enterprise; after the approval process in the current control stage is finished, the approval process enters a post-control stage, namely, the approval process is subjected to services such as coding, authorization, signing, format conversion, watermarking and the like in the post-control stage, and finally, the approval process is integrated and filed to complete the overall specification of the contents of the nuclear power industry enterprises.
In the traditional technology, the post-control stage in the content production of nuclear power enterprises depends on specific task types, and a single service system is used for servicing each task. However, when a certain service function module in a single service system fails to perform service, the service system cannot continue to perform other services, so that a single point of failure is easily formed, the services of other tasks are affected, and the system robustness is poor.
Disclosure of Invention
In view of the above, it is necessary to provide a service method, a service system and a storage medium for enterprise content in order to solve the above technical problems.
A service method of enterprise content is applied to a service system, wherein the service system comprises a scheduling server and a plurality of independently deployed function servers; the method comprises the following steps:
the scheduling server receives a plurality of service requests sent by a plurality of function servers; the service request carries an identifier of the functional server, and the service request is used for indicating a target service type which is currently in a serviceable state in the functional server corresponding to the identifier to the scheduling server;
the scheduling server acquires a target task to be served from a preset table interface according to a preset service capturing strategy;
and the scheduling server sends the target task to be served to the functional server corresponding to the identifier to serve the target service type.
In one embodiment, the method further includes:
the scheduling server acquires at least one piece of fronthaul approval content from the enterprise content management server; the fronthaul approval content comprises original data of a plurality of tasks to be served;
the scheduling server extracts information from the original data to obtain a plurality of tasks to be served, and stores the tasks to be served into the table interface; the task to be served carries the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the acquiring, by the scheduling server, the target task to be serviced from the preset table interface according to the preset service fetching policy includes:
the scheduling server acquires a target service type of the functional server corresponding to the identifier;
and the scheduling server acquires the target task to be served from the table interface according to the target service type, the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the step of acquiring, by the scheduling server, the target task to be serviced from the table interface according to the target service type and the task type of the task to be serviced includes:
the scheduling server acquires at least one candidate task to be served from a plurality of tasks to be served of the table interface according to the target service type; the task type of the candidate task to be served is the same as the target service type;
and the scheduling server determines a target task to be served from at least one candidate task to be served according to the processed state of the task to be served.
In one embodiment, the processed state includes that the candidate task to be served is not processed, fails to process and is in process;
the method for determining the target task to be served from the candidate tasks to be served by the scheduling server according to the processed state of the task to be served comprises the following steps:
the scheduling server determines whether the processed state of at least one candidate task to be served is in process;
and if so, the scheduling server determines a target task to be served from at least one candidate task to be served according to the next processing time of each candidate task to be served.
In one embodiment, the determining, by the scheduling server, a target task to be served from at least one candidate task to be served according to a next processing time of each candidate task to be served includes:
and the scheduling server selects a first candidate task to be served, the next processing time of which is closest to the current processing time, from at least one candidate task to be served as a target task to be served.
In one embodiment, the method further includes:
if not, the scheduling server determines whether the processed state of at least one candidate task to be served is unprocessed or not;
if yes, the scheduling server determines one of the candidate tasks to be served which are not processed as a target task to be served.
In one embodiment, the method further includes:
and if the processed state of at least one candidate task to be served is processing failure, determining a target task to be served from at least one candidate task to be served according to the processing failure times of each candidate task to be served and the next processing time.
In one embodiment, determining a target task to be served from at least one candidate task to be served according to the processing failure times of each candidate task to be served and the next processing time comprises:
selecting at least one second candidate task to be served, of which the next processing time is less than the current processing time, from the at least one candidate task to be served;
and selecting the second candidate task to be served with the minimum processing failure frequency from at least one second candidate task to be served as the target task to be served.
A service system, a scheduling server and a plurality of independently deployed function servers; the function server comprises a request sending module and a service execution module, and the scheduling server comprises a data receiving module, a service capturing module and a data sending module;
the data receiving module is used for receiving a plurality of service requests sent by the request sending module; the service request carries an identifier of the functional server and is used for indicating a target service type which is currently in a serviceable state in the functional server to the scheduling server;
the service grabbing module acquires a target task to be served from a preset table interface according to a preset service grabbing strategy;
and the data sending module sends the target task to be served to the functional server corresponding to the identifier, and the service execution module is used for performing service of the target service type on the target task to be served.
A service system includes a scheduling server and a plurality of independently deployed function servers;
the scheduling server receives a plurality of service requests sent by a plurality of function servers; the service request carries an identifier of the functional server and is used for indicating a target service type which is currently in a serviceable state in the functional server to the scheduling server;
the scheduling server acquires a target task to be served from a preset table interface according to a preset service capturing strategy;
and the scheduling server sends the target task to be served to the functional server corresponding to the identifier to serve the target service type.
A computer-readable storage medium, on which a computer program is stored which, when executed by a processor, carries out the steps of:
the scheduling server receives a plurality of service requests sent by a plurality of function servers; the service request carries an identifier of the functional server, and the service request is used for indicating a target service type which is currently in a serviceable state in the functional server corresponding to the identifier to the scheduling server;
the scheduling server acquires a target task to be served from a preset table interface according to a preset service capturing strategy;
and the scheduling server sends the target task to be served to the functional server corresponding to the identifier to serve the target service type.
According to the service method, the service system and the storage medium of the enterprise content, a scheduling server in the service system receives a plurality of service requests which are sent by a plurality of functional servers and carry the identifications of the functional servers, the service requests indicate the target service type which is currently in a service available state in the functional servers corresponding to the identifications to the scheduling server, the scheduling server acquires the target task to be served from a table interface according to a preset service capturing strategy, and then sends the target task to be served to the functional server corresponding to the identification to serve the target service type. Because the service system comprises the plurality of independently deployed functional servers, after the service on one functional server is down, the service on other functional servers is not influenced, the robustness of the whole service system is improved, and the efficiency and the stability of enterprise content service are further improved.
Drawings
FIG. 1 is a diagram of an application environment of a method for serving enterprise content in one embodiment;
FIG. 2 is a flow diagram that illustrates a method for serving enterprise content, under an embodiment;
FIG. 3 is a block diagram of the architecture of a service system and an enterprise content management server in one embodiment;
FIG. 4 is a flowchart illustrating obtaining tasks to be serviced in one embodiment;
FIG. 5 is a flowchart illustrating an embodiment of obtaining tasks to be serviced;
FIG. 6 is a flowchart illustrating a method for serving enterprise content in accordance with another embodiment;
FIG. 7 is a diagram illustrating a change in processing state of candidate tasks to be serviced in one embodiment;
FIG. 8 is a block diagram showing the construction of a service system in another embodiment;
fig. 9 is an internal structural diagram of a scheduling server/function server in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The service method of the enterprise content provided by the application can be applied to the service system shown in fig. 1. The service system includes a scheduling server 102 and a plurality of independently deployed function servers 104, and the scheduling server 102 and the function servers 104 communicate with each other through a network. The dispatch server 102 receives a plurality of service requests sent by a plurality of function servers 104. The service request carries an identifier of the function server, and the service request is used to indicate, to the scheduling server 102, a target service type currently in a serviceable state in the function server 104 corresponding to the identifier. The scheduling server 102 obtains the target task to be serviced from a preset table interface according to a preset service capturing strategy. The scheduling server 102 sends the target task to be served to the function server 104 corresponding to the identifier to perform the service of the target service type.
In an embodiment, as shown in fig. 2, an enterprise content service method is provided, which is described by taking the application of the method to the service system in fig. 1 as an example, and specifically, an enterprise content service method based on an SOA architecture includes the following steps:
s210, the dispatching server receives a plurality of service requests sent by a plurality of function servers.
The service request carries the identifier of the functional server, and the service request is used for indicating the target service type which is currently in a serviceable state in the functional server corresponding to the identifier to the scheduling server. Alternatively, the identification of the function server may be the number of the function server to uniquely determine the function server. Specifically, as shown in fig. 3, each function server is integrated with a function machine, and each function machine can perform various service types, such as number fetching, word updating, signature, PDF conversion, archiving, authorization, watermarking, and the like. The function machine in the service state actively sends a service request to the scheduling server to request the task to be served. For example, the function server number 001 transmits a service request authorizing a service currently in a serviceable state in the function server number 001 to the scheduling server.
Optionally, the types of services that can be performed by the function machines on the different function servers may be the same or different.
S220, the scheduling server acquires the target task to be served from a preset table interface according to a preset service capturing strategy.
As shown in fig. 3, a table interface, a task scheduling engine, and a fetcher (not shown) are integrated on the scheduling server, and the task scheduling engine, in response to the service request, acquires a target task to be served from the table interface in which a plurality of tasks to be served are stored by using the fetcher according to a preset service fetching policy.
Optionally, the fetcher takes the task sizes of the multiple tasks to be served stored in the table interface as the service fetching policy, and obtains the task to be served with the largest task size from the table interface as the target task to be served. The grabbing machine can also take the preset task type priority as the service grabbing strategy, and obtain the task to be served with the highest task type priority from the table interface as the target task to be served. And the scheduling server removes the captured target task to be served from the table interface and optionally puts the captured target task to be served into a historical table interface.
And S230, the scheduling server sends the target task to be served to the functional server corresponding to the identifier to serve the target service type.
Specifically, a task scheduling engine in the scheduling server sends the captured target task to be served to the functional server corresponding to the identifier, and the functional machine on the functional server performs service of target service operation. Continuing with the above example in which the function server with the number 001 sends the service request with the authorization service currently in a serviceable state in the function server with the number 001 to the scheduling server, the fetching machine in the scheduling server sends the target task to be serviced fetched from the table interface to the function server with the number 001, and the authorization service is performed through the function machine on the function server with the number 001.
In this embodiment, a scheduling server in a service system receives a plurality of service requests carrying identifiers of function servers sent by a plurality of function servers, the service requests indicate a target service type currently in a serviceable state in the function servers corresponding to the identifiers to the scheduling server, the scheduling server obtains a target task to be serviced from a table interface according to a preset service capture policy, and then sends the target task to be serviced to the function server corresponding to the identifier to perform a service of the target service type. Because the service system comprises the plurality of independently deployed functional servers, after the service on one functional server is down, the service on other functional servers is not influenced, the robustness of the whole service system is improved, and the efficiency and the stability of enterprise content service are further improved.
In one embodiment, to increase the application scope of the service of the enterprise content, as shown in fig. 4, the method further includes:
s410, the scheduling server acquires at least one piece of front process approval content from the enterprise content management server.
The fronthaul approval content comprises original data of a plurality of tasks to be served. The enterprise content management server is used for realizing the fronthaul approval of the enterprise content and obtaining the fronthaul approval content. For example, the enterprise content management server may be an office server in a company, and is used for performing daily office management, for example, an enterprise employee initiates a leave request service process to the office server, and the office server may perform a front-end approval process for performing layer-by-layer approval on the leave request service process, so as to obtain an electronic document of the leave request process, that is, front-end approval content.
And S420, the scheduling server extracts information from the original data to obtain a plurality of tasks to be served, and stores the tasks to be served into the table interface.
The task to be served carries the task type of the task to be served and the processed state of the task to be served.
Specifically, as shown in fig. 3, the scheduling server performs information extraction on original data of a plurality of tasks to be served, which is obtained by the enterprise content management server, to obtain a plurality of tasks to be served, which carry task types of the tasks to be served and processed state information of the tasks to be served, and stores the tasks to be served in the table interface.
Optionally, the extracted task to be served may specifically include field information in the following table:
table 1 extracts the fields in the task to be serviced
Optionally, the function server further includes a service monitoring platform to perform data monitoring on the tasks to be served in the table interface, so as to track service failure data of each task to be served. Optionally, as shown in fig. 4, the service monitoring platform may also be separately deployed on a service monitoring server, and communicate with the scheduling server through a network to monitor the table interface.
Optionally, the function machine in the function server is composed of a service factory and task operation modules, and is responsible for specific content tasks in post-control, including number fetching, word updating, signing, pdf conversion, archiving, authorization, and watermarking. And the service factory is responsible for reading the data scheduled by the task scheduling engine and executing the corresponding task function module. And various task operation modules perform data interaction with the table interface and the scheduling engine through an xml data format, and the task types can be dynamically configured.
In this embodiment, the scheduling server obtains at least one piece of fronthaul approval content from the enterprise content management server, and performs information extraction in a unified format on original data of a plurality of tasks to be served included in the fronthaul approval content to obtain the tasks to be served in the same format, so that the universality of the service system for the enterprise content management server is improved, and the application range of enterprise content services is expanded. And moreover, the tasks to be served are uniformly stored in the table interface, so that centralized management is facilitated. Furthermore, the data volume of each task to be served in the table interface is small, the formats are uniform, and when the service task types are increased in the later period, only the service function module in the corresponding format needs to be developed, so that the development period is shortened, and the cost is reduced.
In one embodiment, to improve the service efficiency, as shown in fig. 5, the step S220 includes:
s510, the scheduling server obtains the target service type of the corresponding identified function server.
Specifically, the scheduling server extracts the target service type of the corresponding identified function server from the received service request.
S520, the scheduling server acquires the target task to be served from the table interface according to the target service type, the task type of the task to be served and the processed state of the task to be served.
Specifically, the scheduling server obtains at least one candidate task to be served, of which the task type is the same as the target service type, from the plurality of tasks to be served of the table interface according to the target service type. For example, the target service type includes signature, authorization and watermark, and the scheduling server extracts the task to be serviced, whose corresponding task type is signature, authorization and watermark, in the table interface as a candidate task to be serviced. And the scheduling server determines a target task to be served from at least one candidate task to be served according to the processed state of the task to be served.
Optionally, the processed state includes that the candidate task to be served is in process. The scheduling server firstly determines whether the processed state of the at least one candidate task to be served is in process, if so, the scheduling server determines a target task to be served from the at least one candidate task to be served according to the next processing time of each candidate task to be served. The functional machine on a certain functional server is down when performing a certain service, the service task being processed by the functional machine returns to the table interface again to become a candidate task to be served, the processing state is processing, next processing time is generated according to a preset time step, and after the down functional server is restarted, the candidate task to be served in the processing needs to be served preferentially.
Optionally, when there are candidate tasks to be served in the plurality of processes, the scheduling server selects, from the at least one candidate task to be served, a first candidate task to be served whose next processing time is closest to the current processing time as the target task to be served.
In this embodiment, the scheduling server obtains candidate tasks to be served with the same task type as the target service type in the table interface in advance, further determines the target tasks to be served from the candidate tasks to be served according to the processed state of the tasks to be served, specifically determines the processed state of the candidate tasks to be served as the processing state, and determines the first candidate task to be served with the next processing time closest to the current processing time as the target service task, so as to service the processed tasks to be served in time, thereby improving the service efficiency.
In one embodiment, the processed state further includes that the candidate to-be-serviced task is not processed. As shown in fig. 6, the method further includes:
s610, if the scheduling server determines that the processed state of the candidate task to be served is not in process, the scheduling server determines whether the processed state of at least one candidate task to be served is unprocessed.
And S620, if so, the scheduling server determines one of the unprocessed candidate tasks to be served as a target task to be served.
Specifically, after determining that the processed state of the candidate task to be served is not in process, the scheduling server further determines whether the processed state of the candidate task to be served is unprocessed, and after determining that the processed state of the candidate task to be served is unprocessed, determines any one of the unprocessed candidate tasks to be served as the target task to be served.
In this embodiment, after determining that the processed state of the candidate task to be served is not in process, the scheduling server determines whether the processed state of the candidate task to be served is unprocessed, and then services the unprocessed candidate task to be served, thereby improving the service efficiency.
In one embodiment, the processed state further includes a processing failure of the candidate task to be served, and the method further includes:
and if the processed state of at least one candidate task to be served is processing failure, determining a target task to be served from at least one candidate task to be served according to the processing failure times of each candidate task to be served and the next processing time.
The processing failure refers to service failure caused by the fact that a target task to be served is not down in the process of serving by the functional server, the functional server adds the target task to be served with the processing failure to the table interface again to become a candidate task to be served, the processed state is processing failure, the processing failure frequency is increased by 1, and meanwhile the next processing time is generated according to the preset time step. After the scheduling server captures the candidate tasks to be served which are processed and unprocessed, the target tasks to be served are determined from the candidate tasks to be served which are failed to be processed according to the processing failure times of the candidate tasks to be served which are failed to be processed and the next processing time.
Specifically, after the scheduling server captures the candidate tasks to be served during processing and unprocessed, for the candidate tasks to be served with failed processing, the scheduling server selects at least one second candidate task to be served with a processing time that is less than the current processing time, and selects the second candidate task to be served with the smallest processing failure frequency from the at least one second candidate task to be served as the target task to be served.
Optionally, the processed states of the candidate tasks to be served in the table interface include the following six types: fig. 7 shows a task-free (NULL), unprocessed (0), in-process (4), successful (1), failed (2), and completed (3) state transition diagram. The candidate task to be served is initially unprocessed (0), is processed by the functional machine which is allocated to the functional server after the target service task is captured, and is processed (4). If the function machine fails to process, the updating state is processing failure (2), and the updating state is returned to the table interface to wait for being processed again; and if the function machine is successfully processed, the updating state is the processing success (1), the enterprise content service platform is returned, and the re-updating state is the processing end (3).
As shown in fig. 3, after the functional server service is finished, the approval content of the successful frontend is returned to the enterprise content management server, and the final enterprise content is generated by the enterprise content service platform in the enterprise content management server and is archived and stored.
Table 2 shows a comparison of KPIs before and after the method is carried out.
TABLE 2 KPI comparison Table
In this embodiment, after the scheduling server has grabbed the candidate to-be-served tasks that are in the processing and are not processed, the scheduling server further grabs the candidate to-be-served tasks that have failed in the processing, and selects the second candidate to-be-served task that has the next processing time shorter than the current processing time and the smallest processing failure frequency as the target service task, so as to service the candidate to-be-served tasks with the smaller processing failure frequency in time, thereby improving the service efficiency.
It should be understood that although the various steps in the flowcharts of fig. 1-7 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 1-7 may include multiple steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, which are not necessarily performed in sequence, but may be performed in turn or alternately with other steps or at least some of the other steps.
In one embodiment, as shown in FIG. 8, a service system is provided that includes a dispatch server and a plurality of independently deployed function servers; the scheduling server comprises a data receiving module 801, a service grabbing module 802 and a data sending module 803, and the function server comprises a request sending module 804 and a service executing module 805;
the data receiving module 801 is configured to receive a plurality of service requests sent by the request sending module 804; the service request carries an identifier of the functional server and is used for indicating a target service type which is currently in a serviceable state in the functional server to the scheduling server; the service fetching module 802 obtains a target task to be serviced from a preset table interface according to a preset service fetching strategy; the data sending module 803 sends the target task to be served to the function server corresponding to the identifier, and the service executing module 805 is configured to perform a service of the target service type on the target task to be served.
In one embodiment, the data receiving module 801 is further configured to:
acquiring at least one piece of fronthaul approval content from an enterprise content management server; the fronthaul approval content comprises original data of a plurality of tasks to be served; performing information extraction operation on the original data to obtain a plurality of tasks to be served, and storing the tasks to be served into a table interface; the task to be served carries the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the service crawling module 802 is specifically configured to:
acquiring a target service type of the functional server corresponding to the identifier; and acquiring the target task to be served from the table interface according to the target service type, the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the service crawling module 802 is specifically configured to:
acquiring at least one candidate task to be served from a plurality of tasks to be served of the table interface according to the target service type; the task type of the candidate task to be served is the same as the target service type; and determining a target task to be served from at least one candidate task to be served according to the processed state of the task to be served.
In one embodiment, the processed state includes candidate tasks to be serviced being unprocessed, failed to process, and in-process; the service crawling module 802 is specifically configured to:
determining whether a processed state of at least one candidate task to be serviced is in process; and if so, determining a target task to be served from at least one candidate task to be served according to the next processing moment of each candidate task to be served.
In one embodiment, the service crawling module 802 is specifically configured to:
and selecting a first candidate task to be served, which is closest to the current processing time at the next processing time, from at least one candidate task to be served as a target task to be served.
In one embodiment, the service crawling module 802 is further configured to:
if the processed state of the at least one candidate task to be served is determined not to be in processing, determining whether the processed state of the at least one candidate task to be served is unprocessed or not; if yes, determining one of the candidate tasks to be served which are not processed as a target task to be served.
In one embodiment, the service crawling module 802 is further configured to:
and if the processed state of at least one candidate task to be served is processing failure, determining a target task to be served from at least one candidate task to be served according to the processing failure times of each candidate task to be served and the next processing time.
In one embodiment, the service crawling module 802 is specifically configured to:
selecting at least one second candidate task to be served, of which the next processing time is less than the current processing time, from the at least one candidate task to be served; and selecting the second candidate task to be served with the minimum processing failure frequency from at least one second candidate task to be served as the target task to be served.
In one embodiment, as shown in FIG. 1, a service system is provided that includes a dispatch server 102 and a plurality of independently deployed function servers 104.
The dispatch server 102 receives a plurality of service requests sent by a plurality of function servers 104; the service request carries an identifier of the functional server 104, and the service request is used for indicating a target service type currently in a serviceable state in the functional server 104 corresponding to the identifier to the scheduling server 102; the scheduling server 102 acquires a target task to be served from a preset table interface according to a preset service capturing strategy; the scheduling server 102 sends the target task to be served to the function server 104 corresponding to the identifier to perform the service of the target service type.
In one embodiment, the scheduling server 102 is further configured to obtain at least one piece of fronthaul approval content from the enterprise content management server; the fronthaul approval content comprises original data of a plurality of tasks to be served; the scheduling server 102 performs information extraction operation on the original data to obtain a plurality of tasks to be served, and stores the tasks to be served into a table interface; the task to be served carries the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the scheduling server 102 is specifically configured to obtain a target service type of the function server corresponding to the identifier; and the scheduling server acquires the target task to be served from the table interface according to the target service type, the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the scheduling server 102 is specifically configured to obtain at least one candidate task to be served from a plurality of tasks to be served at the table interface according to the target service type; the task type of the candidate task to be served is the same as the target service type; the scheduling server 102 determines a target task to be served from at least one candidate task to be served according to the processed state of the task to be served.
In one embodiment, the processed state includes that the candidate task to be served is not processed, fails to process and is in process; the scheduling server 102 is specifically configured to determine whether a processed state of at least one candidate task to be served is in process; if yes, the scheduling server 102 determines a target task to be served from at least one candidate task to be served according to the next processing time of each candidate task to be served.
In one embodiment, the scheduling server 102 is specifically configured to select, from at least one candidate task to be served, a first candidate task to be served whose next processing time is closest to the current processing time as a target task to be served.
In one embodiment, the scheduling server 102 is further configured to determine whether the processed state of the at least one candidate task to be served is unprocessed if it is determined that the processed state of the at least one candidate task to be served is not in process; if yes, the scheduling server 102 determines one of the candidate tasks to be served which is not processed as a target task to be served.
In one embodiment, the scheduling server 102 is further configured to determine, if the processed state of the at least one candidate task to be served is processing failure, a target task to be served from the at least one candidate task to be served according to the processing failure times and the next processing time of each candidate task to be served.
In one embodiment, the scheduling server 102 is specifically configured to select, from the at least one candidate task to be served, at least one second candidate task to be served whose next processing time is less than the current processing time; and selecting the second candidate task to be served with the minimum processing failure frequency from at least one second candidate task to be served as the target task to be served.
For specific limitations of the service system, reference may be made to the above limitations of the service method for enterprise content, which are not described herein again. The various modules in the service system described above may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a service system is provided, which includes a scheduling server and a plurality of independently deployed function servers, and the internal structure of the scheduling server and the function servers may be as shown in fig. 8. Including a processor, memory, and network interface, connected by a system bus. Wherein the processor is configured to provide computational and control capabilities. The memory includes a nonvolatile storage medium, an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database is used for storing data of the tasks to be served. The network interface is used for communicating with an external terminal through network connection. The computer program is executed by a processor to implement a method of serving enterprise content.
Those skilled in the art will appreciate that the architecture shown in fig. 8 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of:
the scheduling server receives a plurality of service requests sent by a plurality of function servers; the service request carries an identifier of the functional server, and the service request is used for indicating a target service type which is currently in a serviceable state in the functional server corresponding to the identifier to the scheduling server; the scheduling server acquires a target task to be served from a preset table interface according to a preset service capturing strategy; and the scheduling server sends the target task to be served to the functional server corresponding to the identifier to serve the target service type.
In one embodiment, the computer program when executed by the processor implements the steps of:
the scheduling server acquires at least one piece of fronthaul approval content from the enterprise content management server; the fronthaul approval content comprises original data of a plurality of tasks to be served; the scheduling server extracts information from the original data to obtain a plurality of tasks to be served, and stores the tasks to be served into the table interface; the task to be served carries the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the computer program when executed by the processor implements the steps of:
the scheduling server acquires a target service type of the functional server corresponding to the identifier; and the scheduling server acquires the target task to be served from the table interface according to the target service type, the task type of the task to be served and the processed state of the task to be served.
In one embodiment, the computer program when executed by the processor implements the steps of:
the scheduling server acquires at least one candidate task to be served from a plurality of tasks to be served of the table interface according to the target service type; the task type of the candidate task to be served is the same as the target service type; and the scheduling server determines a target task to be served from at least one candidate task to be served according to the processed state of the task to be served.
In one embodiment, the processed state includes that the candidate task to be served is not processed, fails to process and is in process; the computer program when executed by a processor implements the steps of:
the scheduling server determines whether the processed state of at least one candidate task to be served is in process; and if so, the scheduling server determines a target task to be served from at least one candidate task to be served according to the next processing time of each candidate task to be served.
In one embodiment, the computer program when executed by the processor implements the steps of:
and the scheduling server selects a first candidate task to be served, the next processing time of which is closest to the current processing time, from at least one candidate task to be served as a target task to be served.
In one embodiment, the computer program when executed by the processor implements the steps of:
if the processed state of the at least one candidate task to be served is determined not to be in processing, the scheduling server determines whether the processed state of the at least one candidate task to be served is unprocessed or not; if yes, the scheduling server determines one of the candidate tasks to be served which are not processed as a target task to be served.
In one embodiment, the computer program when executed by the processor implements the steps of:
and if the processed state of at least one candidate task to be served is processing failure, determining a target task to be served from at least one candidate task to be served according to the processing failure times of each candidate task to be served and the next processing time.
In one embodiment, the computer program when executed by the processor implements the steps of:
selecting at least one second candidate task to be served, of which the next processing time is less than the current processing time, from the at least one candidate task to be served; and selecting the second candidate task to be served with the minimum processing failure frequency from at least one second candidate task to be served as the target task to be served.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database or other medium used in the embodiments provided herein can include at least one of non-volatile and volatile memory. Non-volatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical storage, or the like. Volatile Memory can include Random Access Memory (RAM) or external cache Memory. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM), among others.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (12)
1. The service method of the enterprise content is characterized by being applied to a service system, wherein the service system comprises a scheduling server and a plurality of independently deployed function servers; the method comprises the following steps:
the dispatching server receives a plurality of service requests sent by the plurality of function servers; the service request carries an identifier of the functional server, and the service request is used for indicating a target service type which is currently in a serviceable state in the functional server corresponding to the identifier to the scheduling server;
the scheduling server acquires a target task to be served from a preset table interface according to a preset service capturing strategy;
and the scheduling server sends the target task to be served to a functional server corresponding to the identifier to serve the target service type.
2. The method of claim 1, further comprising:
the scheduling server acquires at least one piece of fronthaul approval content from the enterprise content management server; the fronthaul approval content comprises original data of a plurality of tasks to be served;
the scheduling server extracts information from the original data to obtain a plurality of tasks to be served, and stores the tasks to be served into the table interface; the task to be served carries the task type of the task to be served and the processed state of the task to be served.
3. The method according to claim 2, wherein the scheduling server obtains the target task to be served from a preset table interface according to a preset service fetching policy, including:
the scheduling server acquires a target service type of the functional server corresponding to the identifier;
and the scheduling server acquires the target task to be served from the table interface according to the target service type, the task type of the task to be served and the processed state of the task to be served.
4. The method according to claim 3, wherein the obtaining, by the scheduling server, the target task to be served from the table interface according to the target service type and the task type of the task to be served comprises:
the scheduling server acquires at least one candidate task to be served from a plurality of tasks to be served of the table interface according to the target service type; the task type of the candidate task to be served is the same as the target service type;
and the scheduling server determines the target task to be served from the at least one candidate task to be served according to the processed state of the task to be served.
5. The method of claim 4, wherein the processed state comprises the candidate to-be-serviced task being unprocessed, failed to process, and in-process;
the step of determining the target task to be served from the candidate tasks to be served by the scheduling server according to the processed state of the task to be served comprises the following steps:
the scheduling server determines whether the processed state of the at least one candidate task to be served is in process;
and if so, the scheduling server determines a target task to be served from the at least one candidate task to be served according to the next processing time of each candidate task to be served.
6. The method of claim 5, wherein the determining, by the scheduling server, the target task to be served from the at least one candidate task to be served according to a next processing time of each candidate task to be served comprises:
and the scheduling server selects a first candidate task to be served, the next processing time of which is closest to the current processing time, from the at least one candidate task to be served as the target task to be served.
7. The method of claim 5, further comprising:
if not, the scheduling server determines whether the processed state of the at least one candidate task to be served is unprocessed or not;
if yes, the scheduling server determines one of the candidate tasks to be served which are not processed as the target task to be served.
8. The method of claim 7, further comprising:
and if the processed state of the at least one candidate task to be served is processing failure, determining a target task to be served from the at least one candidate task to be served according to the processing failure times of each candidate task to be served and the next processing time.
9. The method according to claim 8, wherein the determining a target task to be served from the at least one candidate task to be served according to the processing failure times and the next processing time of each candidate task to be served comprises:
selecting at least one second candidate task to be served, of which the next processing time is less than the current processing time, from the at least one candidate task to be served;
and selecting the second candidate task to be served with the minimum processing failure frequency from the at least one second candidate task to be served as the target task to be served.
10. A service system, comprising a dispatch server and a plurality of independently deployed function servers; the function server comprises a request sending module and a service execution module, and the scheduling server comprises a data receiving module, a service capturing module and a data sending module;
the data receiving module is used for receiving a plurality of service requests sent by the request sending module; the service request carries an identifier of the function server, and is used for indicating a target service type in a serviceable state in the function server to the scheduling server;
the service grabbing module acquires a target task to be served from a preset table interface according to a preset service grabbing strategy;
and the data sending module sends the target task to be served to a functional server corresponding to the identifier, and the service execution module is used for performing service of the target service type on the target task to be served.
11. A service system, comprising a dispatch server and a plurality of independently deployed function servers;
the dispatching server receives a plurality of service requests sent by the plurality of function servers; the service request carries an identifier of the function server, and is used for indicating a target service type in a serviceable state in the function server to the scheduling server;
the scheduling server acquires a target task to be served from a preset table interface according to a preset service capturing strategy;
and the scheduling server sends the target task to be served to a functional server corresponding to the identifier to serve the target service type.
12. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011401112.XA CN112561264A (en) | 2020-12-04 | 2020-12-04 | Service method, service system and storage medium for enterprise content |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011401112.XA CN112561264A (en) | 2020-12-04 | 2020-12-04 | Service method, service system and storage medium for enterprise content |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112561264A true CN112561264A (en) | 2021-03-26 |
Family
ID=75048128
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011401112.XA Pending CN112561264A (en) | 2020-12-04 | 2020-12-04 | Service method, service system and storage medium for enterprise content |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112561264A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086333A (en) * | 2022-04-25 | 2022-09-20 | 北京达佳互联信息技术有限公司 | Service request distribution method, device and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105373429A (en) * | 2014-08-20 | 2016-03-02 | 腾讯科技（深圳）有限公司 | Task scheduling method, device and system |
| CN107688496A (en) * | 2017-07-24 | 2018-02-13 | 上海壹账通金融科技有限公司 | Task distribution formula processing method, device, storage medium and server |
| CN109814995A (en) * | 2019-01-04 | 2019-05-28 | 深圳壹账通智能科技有限公司 | Method for scheduling task, device, computer equipment and storage medium |
| CN110287009A (en) * | 2019-05-28 | 2019-09-27 | 北京大米科技有限公司 | A kind of working node selection method, device, storage medium and server |
| CN110515709A (en) * | 2019-07-25 | 2019-11-29 | 北京达佳互联信息技术有限公司 | Task scheduling system, method, apparatus, electronic equipment and storage medium |
| CN110852695A (en) * | 2019-09-30 | 2020-02-28 | 厦门网宿有限公司 | Task approval method and device, server and storage medium |
| CN111897638A (en) * | 2020-07-27 | 2020-11-06 | 广州虎牙科技有限公司 | Distributed task scheduling method and system |
-
2020
- 2020-12-04 CN CN202011401112.XA patent/CN112561264A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105373429A (en) * | 2014-08-20 | 2016-03-02 | 腾讯科技（深圳）有限公司 | Task scheduling method, device and system |
| CN107688496A (en) * | 2017-07-24 | 2018-02-13 | 上海壹账通金融科技有限公司 | Task distribution formula processing method, device, storage medium and server |
| CN109814995A (en) * | 2019-01-04 | 2019-05-28 | 深圳壹账通智能科技有限公司 | Method for scheduling task, device, computer equipment and storage medium |
| CN110287009A (en) * | 2019-05-28 | 2019-09-27 | 北京大米科技有限公司 | A kind of working node selection method, device, storage medium and server |
| CN110515709A (en) * | 2019-07-25 | 2019-11-29 | 北京达佳互联信息技术有限公司 | Task scheduling system, method, apparatus, electronic equipment and storage medium |
| CN110852695A (en) * | 2019-09-30 | 2020-02-28 | 厦门网宿有限公司 | Task approval method and device, server and storage medium |
| CN111897638A (en) * | 2020-07-27 | 2020-11-06 | 广州虎牙科技有限公司 | Distributed task scheduling method and system |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115086333A (en) * | 2022-04-25 | 2022-09-20 | 北京达佳互联信息技术有限公司 | Service request distribution method, device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107105009B (en) | Job scheduling method and device for butting workflow engine based on Kubernetes system | |
| CN107729139B (en) | Method and device for concurrently acquiring resources | |
| CN108446172B (en) | Data calling method and device, computer equipment and storage medium | |
| CN103310460A (en) | Image characteristic extraction method and system | |
| CN111625342B (en) | Data tracing method, device and server | |
| CN110780950B (en) | Interface metadata management method, device, computer equipment and storage medium | |
| CN112561264A (en) | Service method, service system and storage medium for enterprise content | |
| CN107105037B (en) | Distributed video CDN resource management system and method based on file verification | |
| CN112817745A (en) | Task processing method and device | |
| CN111984196A (en) | File migration method, device, equipment and readable storage medium | |
| CN110750362A (en) | Method and apparatus for analyzing biological information, and storage medium | |
| CN114003384B (en) | Task management method, device and equipment | |
| CN113297218B (en) | Multi-system data interaction method, device and system | |
| CN112667393B (en) | Method and device for building distributed task computing scheduling framework and computer equipment | |
| CN105760215A (en) | Map-reduce model based job running method for distributed file system | |
| CN114022279A (en) | Service data error correction method, device, equipment and readable storage medium | |
| CN114371884A (en) | Method, device, equipment and storage medium for processing Flink calculation task | |
| CN113590308A (en) | Workflow processing method, device, equipment and medium for applying for cloud resources | |
| CN111695901A (en) | Accounting voucher processing method, device, equipment and storage medium | |
| CN110247896B (en) | Information processing method and device based on firewall opening and computer equipment | |
| US9613051B2 (en) | Data processing method, information processing apparatus, and recording medium | |
| CN113297217B (en) | Data transmission method, device and system | |
| CN117435367B (en) | User behavior processing method, device, equipment, storage medium and program product | |
| CN115309536B (en) | Data consistency method in high-concurrency lottery transaction scene | |
| CN115391328A (en) | Data acquisition method, data acquisition device, electronic equipment and 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 |