CN100444120C - Mass data transmitting method inter-pipeline multiprocess based on information queue - Google Patents

Mass data transmitting method inter-pipeline multiprocess based on information queue Download PDF

Info

Publication number
CN100444120C
CN100444120C CNB2006100980749A CN200610098074A CN100444120C CN 100444120 C CN100444120 C CN 100444120C CN B2006100980749 A CNB2006100980749 A CN B2006100980749A CN 200610098074 A CN200610098074 A CN 200610098074A CN 100444120 C CN100444120 C CN 100444120C
Authority
CN
China
Prior art keywords
message queue
file
ticket
message
warehouse
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CNB2006100980749A
Other languages
Chinese (zh)
Other versions
CN101021801A (en
Inventor
薛庆童
阮永江
黄晓颖
杨开胜
余志刚
庄学阳
李岩
李茂春
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Asialnfo Technology (Nanjing) Co., Ltd.
Original Assignee
LINKAGE SYSTEM INTEGRATION CO Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by LINKAGE SYSTEM INTEGRATION CO Ltd filed Critical LINKAGE SYSTEM INTEGRATION CO Ltd
Priority to CNB2006100980749A priority Critical patent/CN100444120C/en
Publication of CN101021801A publication Critical patent/CN101021801A/en
Application granted granted Critical
Publication of CN100444120C publication Critical patent/CN100444120C/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The invention relates to a large volume of data transmission method based on message queues between multi-process of pipelines, in which, a billing business process about a single order is divided into at least formatting, structuring (or as sorting), weight-queuing, price approving, depositing, and the billing method adopts a combination of single-step and overall submitting procedure to achieve automatically assigned tasks in different environments, load balancing management, and it distributes the order to different message queues for user-defined deploy according to business logic.

Description

Between the streamline multi-process based on the mass data transfers method of message queue
Technical field
The invention belongs to the extensive accurately data handling utility technology category of telecom operators, relate in particular between the multi-process mass data transfers method based on message queue.
Background technology
The data that charge system is handled all are mass datas, and operator of China Telecom generally is that unit builds charge system with the province at present, and the charge system of common 1,000 ten thousand customer volumes was handled ticket in every month and reached hundred million orders of magnitude.How improving system handles efficient, is vital problem.Solving on the efficiency, Linkage's charging product has the aspect of a lot of autonomous innovations, stresses message queue innovation on the data transmission between process in charging product here.
The telecom charging product in order to improve system performance, makes full use of the characteristic of the many CPU of main frame handling under the mass tickets data conditions both at home and abroad, adopts multi-process pipeline processes technology, realizes the efficient processing of ticket.Pipelining is mainly drawn concurrent operation overlappingly and processing by allowing a plurality of processes submit at one time, and is temporal parallel to realize.
Application number is the patent of CN00808157.3: be used for monitoring the just foundation of the subprocess in the application that computer system is carried out and the method and apparatus of releasing, wherein each subprocess has the subprocess database structure of a correspondence, this is just being carried out and is using the application process database structure with a correspondence, and this method comprises: provide one to be used for storing and this is just carrying out the table of the existing subprocess database structure of the existing subprocess correspondence in using; Judge when this application sets up new process in carrying out; The new process data library structure of retrieval and this new process correspondence; Utilize the parent process database structure of the parent process correspondence of this new process data library structure retrieval and this new process; Relatively this parent process database structure and this application process database structure; If this parent process database structure is identical with this application process database structure, be this new process identification (PID) an existing subprocess; And, this new process data library structure is added in this existing subprocess database structure table as if being this new process identification (PID) existing subprocess.
At least be divided into a plurality of processes such as format, regular (perhaps being called letter sorting), row's weight, wholesale price, warehouse-in in the general charging product business processing flow, article one, ticket will be in proper order by processes such as the format in the flow process, regular, row's weight, wholesale price, warehouse-ins, article 1, after ticket finished through whole flow process, the 2nd ticket just entered this flow process.Suppose to handle in the T time ticket, format, regular, heavy, the wholesale price of row, putting each process in storage, to handle the time of ticket be T time of 1/5, and system adopts after the pipelining, under many CPU hosted environment so, taking into account system IO expense not, conversation list processing speed will improve 5 times.Yet this is very desirable situation, because the IO of system expense can cause processing speed can not improve 5 times.If can avoid the IO expense, does not processing speed just improve so? but present charging product is considered the consistance of affairs, considers the rollback of ticket, still adopts the method for file transfer to realize the transmission of ticket between process.
In the charging product, generally use multi-process pipeline parallel method treatment technology to improve system handles efficient at home and abroad.Actual operating position, it also is apparent in view that efficient improves.Charging flow generally comprises a plurality of processes such as format, regular, row's weight, wholesale price, warehouse-in, is equivalent to a plurality of posies in the streamline.Ticket in the original bill files is placed on the input directory of charge system, after each process of experience streamline, finally is loaded in the database through the warehouse-in process.
Why use file transfer between each process in the charging product of other producers? why system does not handle a ticket, is just ticket given next process?
This is because the stability requirement of charge system is very high, in case make mistakes, needs rollback to handle, and rollback is very complicated in charge system.So many billing company can't be accomplished rollback,, whole file is submitted to so wait a file to dispose fully.If a ticket has been handled well, just submit to next process, the machine just in case system exception is delayed, different tickets are handled the very difficult judgement of what stage in the file, and this file can't be handled again, has destroyed data integrity.If submit to whole file, a file processing finishes and just result is submitted to, if delay machine so in processing procedure, this file does not all have to submit to.
Write the file the inside IO expense is arranged, why not call bill data treated in the file is put into the internal memory the inside, the intact submission again of file processing? because memory size is limited, but the CDR file size is unlimited, so a process is not handled before the file, and the ticket of having handled is kept in the temporary file, waits to dispose, change this temporary file into official document again, give next process.
This thought is very simple, but has brought the IO expense to system, directly has influence on the treatment effeciency of system.
Summary of the invention
The present invention seeks to: under the prerequisite of stability that guarantees system and data processing integrality, adopt the message queue mode to realize the transmission of ticket between process, reduce the IO of system expense, speed up processing.
The technology of the present invention solution is: between the streamline multi-process based on the mass data transfers method of message queue, a ticket order is by being divided into format, regular (perhaps being called letter sorting), row's weight, wholesale price, a plurality of processes of warehouse-in at least in the charging product business processing flow, and charging method adopts single step and the whole mechanism that combines of submitting to:
Format is as the source of charging flow, ticket in the file is distributed to the regular process the inside of different follow-up flow processs according to distribution rules, when finishing a document formatting, formatting process sends this end of file signal to each follow-up regular process; Each regular process receives an end of file signal, just carries out the single step of this process and submits to, and disposed all tickets of this file of being transported to this flow process of this process are described; The heavy process of row that regular then process is given next step with end signal, the same treatment mechanism of the heavy process of row is carried out single step and is submitted to; Heavy process of row and wholesale price process also are same processing modes; The wholesale price process is given end signal the warehouse-in process again, and the warehouse-in process is carried out single step and submitted to; Have only the warehouse-in process that ought format all flow processs that ending message is carried that this file is submitted to and finish, system just carries out the integral body of this file and submits to; If system in processing procedure, needs to interrupt, this time, a file did not dispose in whole streamline, and charging process so adopts out of true/fuzzy breakpoint; Out of true/fuzzy breakpoint is meant in taking place and has no progeny, the computing machine interruption that do not make an immediate response, but wait for that all tickets in the file finish, and just respond this interruption;
If the machine of delaying unusually takes place in system, so system restart the time, system finds to have the preceding process of which file warehouse-in process to submit to automatically, but the final process warehouse-in of streamline process is not submitted to this file, illustrate that so this file has problems, and just alarms in processing procedure; The maintainer checks, finds reason, carries out the file-level rollback of this file and handles
The file-level rollback need be cleared up the vestige that whole file stays in charge system everywhere, is the contrary operation of charging process, returns to initial conditions.
Charging method of the present invention takes into full account the rollback of system, and strict simultaneously submission mechanism is carried out assurance for adopting message queue.
Charging method of the present invention adopts single step and the whole mechanism that combines of submitting to.
Have only the warehouse-in process that ought format all flow processs that ending message is carried that this file is submitted to and finish, system just carries out the integral body of this file and submits to.
The method of pipelining handling interrupt has two kinds of inexact breaking method and exact breaking methods.Inexact breaking method is meant in taking place and has no progeny, the computing machine interruption that do not make an immediate response, but wait for that all tickets in the file finish, and just respond this interruption.
Affairs control technology and rollback technology have guaranteed the stable of system, and the introducing that also is message queue is as technique guarantee.
The present invention can be implemented in the message queue type that adopts under the varying environment by configuration; Message queue is the chained list of a message; In charge system, message just can be equal to ticket, is the record with specific format; There is the process of write permission can be to message queue to wherein adding new information according to certain rule; There is the process of read right then can from message queue, read away message to message queue; Adopting unified message queue data structure, is exactly the structure by the standard ticket, can set up message queue, the transmission of ticket between such each process of flexible realization by configuration between the process arbitrarily; The transmission of the call bill data of charge system magnanimity between process all by message queue, realizes in the internal memory the inside.
The present invention is by automatic allocating task, and the load balancing management is distributed to the message queue together of looking younger with ticket, and according to service logic, self-defined mode is disposed.
Characteristics of the present invention are: adopt the transmission of call bill data between process of the charge system magnanimity of the inventive method realization, all by message queue, processing procedure can realize there is not the expense of the IO of system in the internal memory the inside, and speed improves greatly.Employing obviously improves based on the system handles efficient of the pipeline parallel method treatment technology scheme of message queue.Processing speed is at home and abroad chargeed and is come out at the top in the producer.
Description of drawings
Fig. 1 is that different modes is finished the time course synoptic diagram that the ticket task is handled.
Fig. 2 is automatic allocating task treatment progress figure.
Fig. 3 is a treatment scheme synoptic diagram in the charge system of the present invention.
Embodiment
As shown in Figure 2, by automatic allocating task among Fig. 2, the load balancing management is distributed to different message queues with ticket.
Message queue is exactly the chained list of a message.In charge system, message just can be equal to ticket, is the record with specific format.There is the process of write permission can be to message queue to wherein adding new information according to certain rule; There is the process of read right then can from message queue, read away message to message queue.
Mainly contain two types message queue at present: POSIX message queue and the V of system message queue, system V message queue is used at present in a large number.Consider the portability of program, charging method of the present invention is implemented in to adopt which kind of message queue type under the varying environment by configuration.
Charging flow of the present invention is can be according to service logic, and self-defined mode is disposed, and for example some flow process does not need the heavy process through row, so directly sets up message queue between regular process and wholesale price process; Linkage adopts unified message queue data structure, is exactly the structure of standard ticket, can set up message queue, the transmission of ticket between such each process of flexible realization by configuration between the process arbitrarily.
The transmission of the call bill data of charge system magnanimity between process all by message queue, realizes there is not the expense of the IO of system in the internal memory the inside, and speed strengthens greatly.
It below is the test case of charge system treatment effeciency.
Test environment: IBM P650 16*1.5G CPU, 32G RAM
Tested object: the charging bill of a province, number of files to be put in storage is: 101724, have 628779011 records.
Method of testing: file is positioned over system input directory; System adopts single process (single current waterline) to test, and the difference of 2 kinds of tests is: first kind of method of testing ticket transmission between process is based on file mode, and second kind of method of testing ticket transmission between process is based on the message queue mode; Start charge system, the start-of-record time; The file number of monitoring input directory is until being zero, the end of record (EOR) time.
Test result: transmit between the process of ticket based on message queue: system is consuming time: 36557 seconds
Transmit between the process of ticket based on file: system is consuming time: 66362 seconds.
Test result: ticket is based under the transmission mode between the process of message queue, and system handles efficient improves a lot.As shown in Figure 3:
1, at first in charge system, disposes treatment scheme, also can be called and dispose a streamline, dispose the process that this flow process relates on stream; The foundation of message queue is self-defined mode, according to service logic, connects with black line between 2 associated process, and message queue is set up on the system backstage automatically;
2, the condition that the last process of configuration is distributed to subsequent processes in the message queue attribute;
3, process initiations all in the streamline is got up;
4, file first process of sending into streamline is a formatting process, this process is with File Open, read in a ticket, dispose, according to condition, formatting process passes through message queue, transmit telephone bill is to its follow-up some regular process, this regular process is constantly scanning message queue, if find the message queue the inside between this process and its related formatting process ticket is arranged, so just handle immediately, dispose, ticket is passed to the heavy process of the row who satisfies condition by message queue; Row weighs process and wholesale price process, wholesale price are advanced and the warehouse-in process also is same principle; Final warehouse-in process is delivered to ticket in the database;
If 5 a certain processes are handled slowly, cause last process at full capacity with the message queue space of self setting up, will stop up so, last process can't transmit ticket by message queue, last process is just carried out sleep, has living space up to this message queue, just can continue to handle;
When 6, formatting process is handled a file,, send document end message, carry out single step simultaneously and submit to follow-up regular process just by message queue; Processes such as regular, row weight, wholesale price, warehouse-in are received end of file message as a same reason, just carry out presents in this process single step submission;
7, receive the ending message of certain file when all warehouse-in processes, system carries out this document and submits in the integral body of native system.
The mode of adding new information is:
Create message queue in the time of system start-up, the kernel continuation of message queue requires all corresponding unique key assignments in system scope of each message queue, so, obtain the describing word of a message queue, only need provide the key assignments of this message queue to get final product; The message queue describing word is to be generated by key assignments unique in system scope, and key assignments can be regarded a corresponding intrasystem road warp as.
In the system handles process, there is a large amount of read-write operations in message queue, send message for last process, at first preset a msgbuf buffer zone and check whether message queue is full, if full, so with regard to first sleep, have vacantly up to message queue, call corresponding transmission function and get final product, adopt the msgsnd system function at the V of system message queue, in the POSIX message queue, use the mq_send system function, message content is sent in the message queue; Read message for back one process, at first distribute such msgbuf buffer zone, check in the message queue whether message is arranged, if there is not message, just enter the sleep state, message is arranged in message queue, adopt the msgrcv system function at the V of system message queue, use the mq_receive system function in the POSIX message queue, the message that will enter message queue from message queue at first reads out.
Be implemented in the mode (message queue is the chained list of a message) that adopts different messages formation (POSIX message queue and the V of system message queue, system V message queue) type under the varying environment by configuration among Fig. 3;
Because operating system definition, some system call meeting differences, at first in CONFIG.SYS, need the defining operation system type, the operating system of main flow comprises HP UNIX, SOLARIS, LINUX and AIX at present, the standard that system supports is influential to message queue, has POSIX or SYSTEM_V standard
At the compiling defined file the inside of system configuration operation system type, adopting the POSIX message queue by OS Type control still is the SYSTEM_V message queue.
Compiling defined file form is as follows:
# defining operation system type
#OS_DEF=DEF_HP
#OS_DEF=DEF_SOLARIS
OS_DEF=DEF_LINUX
#OS_DEF=DEF_AIX
The standard that the # system supports, this is influential to message queue
#POSIX?or?SYSTEM_V
The message queue of the machine of # Hewlett-Packard uses POSIX, other machine SYSTEM_V
:ifeq($(OS_DEF),DEF_HP)
SYS_TYPE=POSIX
:else
SYS_TYPE=SYSTEM_V
:endif
System satisfies the realization of the message queue under the different definition by conditional compilation.
Adopting unified message queue data structure, is exactly the structure by the standard ticket, can set up message queue, the transmission of ticket between such each process of flexible realization by configuration between the process arbitrarily; The transmission of the call bill data of charge system magnanimity between process all realizes in the internal memory the inside by message queue.
Adopting unified message queue data structure, is exactly the structure of standard ticket, and general bill structures comprises following content at least:
Struct?StdEvent
{
// original caller rs number
char?m_sOrgCallingNBR[40];
// original called number
char?m_sOrgCalledNBR[40];
// incident zero-time
char?m_sStartDate[15];
// incident duration
int?m_iDuration;
}
Can set up message queue, the transmission of ticket between such each process of flexible realization by configuration between the process arbitrarily.For example there is last process A, back one process B, the attribute of the message queue Q of configuration process B in allocation list of system will be set up the message queue Q of corresponding size according to definition system start-up the time so, and the owner is process B.Simultaneity factor is set up the distribution rules allocation list, is distribution conditions in the allocation list, and direction is that A is sent to B.Process A handles a ticket so, will judge whether this ticket satisfies distribution conditions, if satisfy distribution conditions, just ticket is sent to the message queue of B process.

Claims (2)

1, between the streamline multi-process based on the mass data transfers method of message queue, ticket order is by being divided into format, regular, row's weight, wholesale price, a plurality of processes of warehouse-in at least, the mechanism that charging method adopts single step and integral body submission to combine in the charging product business processing flow:
It is characterized in that formaing source as charging flow, different tickets in the file are distributed to regular process the insides different in the different follow-up flow processs according to distribution rules, when finishing a document formatting, formatting process sends this end of file signal to each follow-up regular process; Each regular process receives an end of file signal, just carries out the single step of formatting process and submit in regular process, illustrate that formatting process has disposed to be transported to all tickets of this file that formats flow process;
The heavy process of row that regular then process is given next step with end signal, heavy process of row and regular process are handled ticket with same processing mode, carry out single step and submit to; The processing mode processing ticket that the wholesale price process is also same with regular process; The wholesale price process is given the warehouse-in process with end of file signal again, and the warehouse-in process is carried out single step and submitted to; Have only when document end message to be transported to the warehouse-in process through all flow processs, and after the warehouse-in process all disposed, system just carried out the integral body of this file and submits to;
If system in processing procedure, needs to interrupt, this time, a file did not dispose in whole streamline, and charging process so adopts out of true/fuzzy breakpoint; Out of true/fuzzy breakpoint is meant in taking place and has no progeny, the computing machine interruption that do not make an immediate response, but wait for that all tickets in the file dispose, and just respond this interruption;
If the machine of delaying unusually takes place in system, so system restart the time, system finds to have the preceding process of which file warehouse-in process to submit to automatically, but the final process warehouse-in of streamline process is not submitted to this file, illustrate that so this file has problems, and just alarms in processing procedure;
When the file-level rollback, need clear up the vestige that whole file stays in charge system everywhere, return to initial conditions.
2, according between claim 1 multi-process based on the mass data transfers method of message queue, it is characterized in that being implemented in the different message queue type of employing under the varying environment by configuration; Message queue is the chained list of a message; In charge system, message just can be equal to ticket, is the record with specific format; There is the process of write permission in message queue, to add new information to message queue according to certain rule; There is the process of read right then can from message queue, read away message to message queue; Adopt unified message queue data structure, adopt the structure of standard ticket exactly, can set up message queue, the transmission of ticket between such each process of flexible realization by configuration between the process arbitrarily; The transmission of the call bill data of charge system magnanimity between process all by message queue, realizes in the internal memory the inside.
CNB2006100980749A 2006-11-30 2006-11-30 Mass data transmitting method inter-pipeline multiprocess based on information queue Active CN100444120C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2006100980749A CN100444120C (en) 2006-11-30 2006-11-30 Mass data transmitting method inter-pipeline multiprocess based on information queue

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2006100980749A CN100444120C (en) 2006-11-30 2006-11-30 Mass data transmitting method inter-pipeline multiprocess based on information queue

Publications (2)

Publication Number Publication Date
CN101021801A CN101021801A (en) 2007-08-22
CN100444120C true CN100444120C (en) 2008-12-17

Family

ID=38709575

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2006100980749A Active CN100444120C (en) 2006-11-30 2006-11-30 Mass data transmitting method inter-pipeline multiprocess based on information queue

Country Status (1)

Country Link
CN (1) CN100444120C (en)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101201753B (en) * 2007-12-13 2012-12-26 浪潮通信信息系统有限公司 Method for configuring and managing multimode machine supervising engine
CN101567873B (en) * 2008-04-25 2013-05-15 锐迪科微电子(上海)有限公司 Multitask Parallel processing method and multitask parallel processing system
CN101409877B (en) 2008-11-28 2010-07-14 中兴通讯股份有限公司 Method for generating call ticket
CN101751397B (en) * 2008-12-04 2013-03-27 中国移动通信集团安徽有限公司 Method and device for importing files into database
CN102143470A (en) * 2010-12-31 2011-08-03 华为软件技术有限公司 Method for processing charging messages, charging host machine, load balancer and charging system
CN103338230B (en) * 2013-06-03 2016-03-30 广州天宁信息技术有限公司 A kind of processing method of business datum and system
CN103533081B (en) * 2013-10-25 2017-12-29 从兴技术有限公司 A kind of charge system and its implementation based on cloud computing
CN104717625A (en) * 2013-12-12 2015-06-17 中国移动通信集团河南有限公司 Credit control processing method and device
CN104156850A (en) * 2014-07-16 2014-11-19 通联支付网络服务股份有限公司 Real-time transaction monitoring system
CN105828309B (en) * 2015-01-05 2019-07-02 中国移动通信集团广西有限公司 A kind of call bill processing method, equipment and system
CN106302565B (en) * 2015-05-12 2020-11-24 浙江格林蓝德信息技术有限公司 Scheduling method and system of service server
CN107995006A (en) * 2017-12-01 2018-05-04 天津麒麟信息技术有限公司 Real-time Billing System based on message trigger under a kind of cloud environment
CN108134830A (en) * 2017-12-20 2018-06-08 马上消费金融股份有限公司 Load-balancing method, system, device and storage medium based on message queue
CN113946362B (en) * 2021-09-02 2022-08-16 贝壳找房(北京)科技有限公司 Consumption data processing method and storage medium
CN114141086A (en) * 2021-12-13 2022-03-04 湖南文理学院 Electronic device with built-in simulated physical mechanics experimental scene

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020069302A1 (en) * 2000-12-06 2002-06-06 Porkka Joseph A. Method and system for passing messages between threads
US20060200829A1 (en) * 2005-02-18 2006-09-07 Astl Kenneth L Duplicate message elimination during recovery when multiple threads are delivering messages from a message store to a destination queue
CN1859325A (en) * 2006-02-14 2006-11-08 华为技术有限公司 News transfer method based on chained list process

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020069302A1 (en) * 2000-12-06 2002-06-06 Porkka Joseph A. Method and system for passing messages between threads
US20060200829A1 (en) * 2005-02-18 2006-09-07 Astl Kenneth L Duplicate message elimination during recovery when multiple threads are delivering messages from a message store to a destination queue
CN1859325A (en) * 2006-02-14 2006-11-08 华为技术有限公司 News transfer method based on chained list process

Also Published As

Publication number Publication date
CN101021801A (en) 2007-08-22

Similar Documents

Publication Publication Date Title
CN100444120C (en) Mass data transmitting method inter-pipeline multiprocess based on information queue
US10115058B2 (en) Predictive modeling
CN110362617B (en) Method and system for rapidly exporting batch data from database based on multiple concurrency technologies
JP4041002B2 (en) Database update processing system, update data input method for database update, update data processing method, and program
CN103716690A (en) Multimedia live broadcast whistle-blowing method, terminal, server and system
Lum et al. OPAS: An office procedure automation system
CN109284225A (en) A kind of quality determining method and electronic equipment of multi-person synergy exploitation programming code
CN109344199A (en) The system and method for big data quantity distributed treatment is realized in cloud computing platform
CN108304267A (en) The multi-source data of highly reliable low-resource expense draws the method for connecing
CN100432942C (en) Apparatus, system, and method for reassigning a client
CN111125719A (en) Method and device for improving code security detection efficiency, computer equipment and readable storage medium
CN110322313A (en) The method transferred items based on SAP system batch creation sales order and delivery order
Aytug ̄ et al. A framework and a simulation generator for kanban-controlled manufacturing systems
Wimbrow A large-scale interactive administrative system
CN112364145A (en) Work order processing method and device, electronic equipment and storage medium
US8229946B1 (en) Business rules application parallel processing system
CN111241455A (en) Data processing apparatus, computer device, and storage medium
US7139884B2 (en) Method, apparatus and computer program product for implementing enhanced autonomic backup using multiple backup devices
CN111881025A (en) Automatic test task scheduling method, device and system
Slonim et al. NDX-100: An electronic filing machine for the office of the future
CN102857357A (en) Method and device for implementing network management configuration
CN111161048B (en) Application method and device for automatic posting of fund collection
Green SWALCAP on‐line system: a technical summary
CN114064643A (en) Task type data conversion system based on Oracle
Hume et al. Gecko: Tracking a very large billing system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
EE01 Entry into force of recordation of patent licensing contract

Assignee: LIAN Technology (Nanjing) Co., Ltd.

Assignor: Linkage System Integration Co., Ltd.

Contract fulfillment period: 2009.6.23 to 2027.8.30 contract change

Contract record no.: 2009320001548

Denomination of invention: Mass data transmitting method inter-pipeline multiprocess based on information queue

Granted publication date: 20081217

License type: exclusive license

Record date: 2009.8.17

LIC Patent licence contract for exploitation submitted for record

Free format text: EXCLUSIVE LICENSE; TIME LIMIT OF IMPLEMENTING CONTACT: 2009.6.23 TO 2027.8.30; CHANGE OF CONTRACT

Name of requester: LIANCHUANG SCIENCE ( NANJING ) CO., LTD.

Effective date: 20090817

C56 Change in the name or address of the patentee

Owner name: LIANCHUANG SCIENCE ( NANJING ) CO., LTD.

Free format text: FORMER NAME: NANJING LIANCHUANG SCIENCE CO., LTD.

CP03 Change of name, title or address

Address after: Building 16, world window software park, No. 12 Huai gate, Jiangsu, Nanjing

Patentee after: Linkage System Integration Co., Ltd.

Address before: 16 floor, No. 12 Huai gate, Nanjing, Jiangsu

Patentee before: Linkage System Integration Co., Ltd.

C56 Change in the name or address of the patentee

Owner name: LINKAGE ASIAINFO TECHNOLOGY (NANJING) CO., LTD.

Free format text: FORMER NAME: LINKAGE TECHNOLOGY (NANJING) CO., LTD.

CP01 Change in the name or title of a patent holder

Address after: 210013 No. 16 building, world window software park, No. 12 Huai gate, Jiangsu, Nanjing

Patentee after: LINKAGE-ASIAINFO TECHNOLOGIES (NANJING), INC.

Address before: 210013 No. 16 building, world window software park, No. 12 Huai gate, Jiangsu, Nanjing

Patentee before: Linkage System Integration Co., Ltd.

C56 Change in the name or address of the patentee

Owner name: ASIALNFO TECHNOLOGY (NANJING) CO., LTD.

Free format text: FORMER NAME: LINKAGE-ASIAINFO TECHNOLOGY (NANJING) CO., LTD.

CP01 Change in the name or title of a patent holder

Address after: 210013 No. 16 building, world window software park, No. 12 Huai gate, Jiangsu, Nanjing

Patentee after: Asialnfo Technology (Nanjing) Co., Ltd.

Address before: 210013 No. 16 building, world window software park, No. 12 Huai gate, Jiangsu, Nanjing

Patentee before: LINKAGE-ASIAINFO TECHNOLOGIES (NANJING), INC.