Check patentability & draft patents in minutes with Patsnap Eureka AI!

Time sharing operation dynamic dispatching method and device

A technology of dynamic scheduling and time-sharing operation, applied in the field of telecommunications, it can solve the problems of inability to adjust the order of task execution, execution efficiency and low resource utilization, so as to improve experience and satisfaction, reduce waiting time, and improve work efficiency. Effect

Active Publication Date: 2008-10-22
XIANGYANG BRANCH CHINA MOBILE GRP HUBEI CO LTD
View PDF0 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to provide a time-sharing job dynamic scheduling method and device to solve the problems in the prior art that the task execution sequence cannot be dynamically adjusted according to the workload, execution efficiency and resource utilization are low

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Time sharing operation dynamic dispatching method and device
  • Time sharing operation dynamic dispatching method and device
  • Time sharing operation dynamic dispatching method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0035] figure 1 It is a flow chart of the time-sharing job dynamic scheduling method in Embodiment 1 of the present invention, and Embodiment 1 of the present invention specifically includes:

[0036] Step S101, dividing the job tasks into different priority levels, and specifying a corresponding amount of processing time for each priority level;

[0037] Step S103, polling and executing job tasks of each priority level according to the order of priority;

[0038] Step S105, allocating the processing time of the current priority according to the job task of the current priority.

[0039] Wherein, the amount of processing time mentioned in the specific implementation manner of the present invention is specifically the amount of record processing in the memory buffer.

[0040] First, judge the current priority memory buffer record, if the current priority L has a memory buffer record, then read C (when the priority remaining memory record M>=C) or M (when M< During C) the recor...

Embodiment 3

[0051] image 3 It is a flow chart of the time-sharing job dynamic scheduling method in Embodiment 3 of the present invention, and Embodiment 3 of the present invention specifically includes:

[0052] Step S301, classify job tasks into different priorities, and set corresponding memory buffers for the priorities. When processing memory buffer records, start processing from priority 1, and execute job tasks in order of different priorities, assuming that the previous processing priority is L 0 (initial runtime L 0 =0), then the current processing priority L=L 0 +1 (when L is greater than the last priority L M , L=1, that is, restart from the first priority);

[0053] Step S303, get the memory buffer record of the current priority L, if there is no record in the memory buffer, go to step S305 for processing, otherwise get C or M records from the memory buffer for processing, and turn to step S301 for polling processing after the obtained records are completed next priority;...

Embodiment 4

[0061] Figure 4 It is a flowchart of a time-sharing job dynamic scheduling method in Embodiment 4 of the present invention, and Embodiment 4 of the present invention specifically includes:

[0062] Step S401, classify job tasks into different priorities, and set corresponding memory buffers for the priorities. When processing memory buffer records, start processing from priority 1, and execute job tasks in order of different priorities, assuming that the previous processing priority is L 0 , then the current processing priority L=L 0 +1;

[0063] Step S403, read the memory buffer record of the current priority L, if there is no record in the memory buffer, go to step S405 for processing, otherwise obtain C or M records from the memory buffer for processing, and turn to step S401 for polling when the obtained records are completed Handle the next priority;

[0064] Step S405, read the number of buffered records N and the time T1 of the last access to the database read by t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a time-sharing operation dynamic scheduling method and a device thereof. The invention is mainly applied to a management system of the telecommunication field. The method adopts single-process dynamic scheduling and comprises the following steps that: an operation task is divided into different priorities; each priority is appointed with corresponding time processing amount; according to the sequence of the priorities, the operation task of each priority is carried out in turn; and according to the operation task of current priority, the time processing amount of the current priority is allocated. When the single process can not meet needs, a multiprocess time-sharing operation dynamic scheduling method is used. The time-sharing operation dynamic scheduling method and the device thereof can effectively solve the problems that the prior client management system can not dynamically adjust the task executing sequence according to the operation amount and have low efficiency; through the conversion of the single-process and multiprocess, the time-sharing operation dynamic scheduling method and the device thereof improve the processing capacity of the system and save system resource.

Description

technical field [0001] The invention relates to a job scheduling method and device in the telecommunications field, in particular to a time-sharing job dynamic scheduling method and device applied in a management system in the telecommunications field. Background technique [0002] In the customer management system of the telecommunications industry with the database as the core, the background job processing process is used to process a large number of jobs submitted by the foreground and the background in real time. The data processed by the background job processing process all come from the same job record table. Records are generated when the front desk accepts customer business and some background management and maintenance personnel process business individually or in batches. Such records are called electronic work orders. In this way, the front desk handles business to provide services for customers, and the background processes these work orders to enable or cancel...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06Q10/00G06Q50/00G06F17/30G06Q10/06G06Q50/30
Inventor 姜文平吉志刚钱立进
Owner XIANGYANG BRANCH CHINA MOBILE GRP HUBEI CO LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com