CN111046102B - High performance blockchain service system - Google Patents
High performance blockchain service system Download PDFInfo
- Publication number
- CN111046102B CN111046102B CN201911182804.7A CN201911182804A CN111046102B CN 111046102 B CN111046102 B CN 111046102B CN 201911182804 A CN201911182804 A CN 201911182804A CN 111046102 B CN111046102 B CN 111046102B
- Authority
- CN
- China
- Prior art keywords
- service
- container
- task
- state
- block chain
- 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
Links
- 230000015654 memory Effects 0.000 claims description 15
- 230000036541 health Effects 0.000 claims description 8
- 238000010586 diagram Methods 0.000 claims description 6
- 230000008859 change Effects 0.000 claims description 5
- 238000011084 recovery Methods 0.000 claims description 5
- 230000000903 blocking effect Effects 0.000 claims description 4
- 238000013461 design Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 3
- 238000011156 evaluation Methods 0.000 claims description 2
- 238000005192 partition Methods 0.000 claims 1
- 238000005516 engineering process Methods 0.000 description 7
- 238000000034 method Methods 0.000 description 6
- 230000008878 coupling Effects 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 4
- 238000005859 coupling reaction Methods 0.000 description 4
- 238000012544 monitoring process Methods 0.000 description 4
- 238000012360 testing method Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011056 performance test Methods 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000007115 recruitment Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
-
- 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/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Finance (AREA)
- Databases & Information Systems (AREA)
- Accounting & Taxation (AREA)
- Technology Law (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Multimedia (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
An ethernet-based high performance blockchain service system, the system comprising: the system comprises a block chain background service interface module, a block chain bottom layer service module and a task scheduling and load balancing module, wherein the block chain background service interface module is used for interacting with a bottom layer block chain platform; the block chain bottom layer service module is used for providing block chain service for users; the task scheduling and load balancing module is used for distributing tasks to the underlying blockchain service node.
Description
Technical Field
The application relates to the technical field of blockchain, in particular to a high-performance blockchain service system.
Background
The concept of BlockChain was proposed by the middle school in 2009, and has been a very popular research direction in academia and industry in recent years. With the advent of the industry 4.0 era and the rapid development of the mobile internet, the blockchain technology has a wide application range. The existing application modes of the block chain technology comprise:
the method comprises the steps of constructing a bottom layer block chain service platform based on a Linux system, calling corresponding interfaces at an application layer through external services provided by a client side of the platform, and realizing the calling of the services. That is, the use of blockchain techniques may include three parts:
(1) And constructing an underlying block chain service platform.
(2) And writing intelligent contracts.
(3) And constructing a background service interface.
Because the application mode of the block chain technology involves more modules, each module may fail, a certain redundancy mechanism is needed, and each module needs to improve concurrency capability.
Disclosure of Invention
The embodiment of the application provides a high-performance block service system which can provide high-performance block chain service for the outside.
The application provides a high-performance blockchain service system, which comprises a blockchain background service interface module, a blockchain bottom layer service module and a task scheduling and load balancing module. The block chain background service module is used for interaction between the application and the bottom layer block chain platform; the block chain bottom layer service module is used for providing high-reliability block chain service for users; the load balancing scheduling module is used for distributing tasks to the underlying blockchain service node so that concurrency performance of the whole system is highest. The blockchain service provided by the blockchain bottom layer service module comprises operations of running intelligent contracts, issuing transactions, participating in maintaining consistency and the like.
The block chain background service interface module is constructed by combining a micro-service idea, transversely splitting a service into a read-write service and longitudinally splitting the read-write service into a service provider and a service consumer, and adding a message middleware between the provider and the consumer to perform flow cutting and task caching.
The block chain bottom layer service module is constructed based on a Docker container, and the number of service nodes is increased to provide services under the condition of insufficient service capacity.
The task scheduling and load balancing module is responsible for distributing tasks transmitted by the block chain background service interface module to the block chain bottom layer service module according to a load balancing model. The design of the load balancing model considers the state of the container, and selects two most influenced changes in the container stateThe parameter memory and the disk IO size establish a container state plane. The load balancing parameter is thatWherein m is the number of containers, dis ave Is the average value of the distance from the origin point of all containers in the initial state and the impending load collapse state, and is defined as +.>Wherein x is 11 And x 12 The normalized value of the memory duty ratio and the disk IO quantity of the container in the initial state is x 21 And x 22 The method is the normalized value of the memory occupancy and the disk IO of the container just before crash. The task scheduling and load balancing module is arranged in LBH<And (3) in the case of 0, performing resource recovery and reassignment treatment on the container with the container state far from the original point.
Compared with the prior art, the embodiment of the application has the following advantages and positive effects:
compared with the traditional block chain application mode, the coupling degree of the system is reduced, and the system can be expanded according to the requirement at the cost of minimum resource consumption;
the service platform is built into the container, so that the service performance of the service platform can be dynamically increased;
and a load balancing strategy aiming at a block chain application scene is designed, so that service concurrency of a block chain service system can be improved.
The application can be applied to the application fields of the blockchain technology, such as copyright protection, private equity project information recruitment and transaction, and the like, reduces the application difficulty of the blockchain technology and improves the service performance of the blockchain.
Drawings
The above, as well as additional purposes, features, and advantages of exemplary embodiments of the present application will become readily apparent from the following detailed description when read in conjunction with the accompanying drawings. Several embodiments of the present application are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
FIG. 1 is a block chain background service interface module framework diagram according to one embodiment of the application.
FIG. 2 is a block chain underlying service module framework diagram according to one embodiment of the application.
Fig. 3 is a graph showing experimental results obtained according to one of the embodiments of the present application.
Detailed Description
According to one or more embodiments, a high performance blockchain service system includes a blockchain background service interface module, a blockchain underlying service module, and a task scheduling and load balancing module, the blockchain background service module being configured to interact with an underlying blockchain platform; the block chain bottom layer service module is used for providing high-reliability block chain service for users; the load balancing scheduling module is used for distributing tasks to the underlying blockchain service node so that concurrency performance of the whole system is highest.
The block chain background service interface module is constructed by combining a micro service idea, transversely splitting a service into a read-write service, longitudinally splitting the read-write service into a service provider and a service consumer, adding a message middleware between the provider and the consumer for flow cutting and task caching, and carrying out real-time state monitoring on all sub-modules to ensure the normal operation of the system.
The block chain bottom layer service module is constructed based on a Docker container, and the number of service nodes is increased to provide services under the condition of insufficient service capacity.
The task scheduling and load balancing module is responsible for distributing tasks transmitted by the block chain background service interface module to the block chain bottom layer service module according to a load balancing model. The design of the load balancing model considers the state of the container, and two parameter memories with the largest affected change in the container state and the IO size of the disk are selected to establish a container state plane. The load balancing parameter is thatWherein m is the number of containers, dis ave Is the average value of the distance from the origin point of all containers in the initial state and the impending load collapse state, and is defined as +.>Wherein x is 11 And x 12 The normalized value of the memory duty ratio and the disk IO quantity of the container in the initial state is x 21 And x 22 The method is the normalized value of the memory occupancy and the disk IO of the container just before crash. The task scheduling and load balancing module is arranged in LBH<And (3) in the case of 0, performing resource recovery and reassignment treatment on the container with the container state far from the original point.
In accordance with one or more embodiments, as shown in FIG. 1, a micro-service based blockchain background service interface module further includes a service provider module, a service consumer module, a service discovery and registry module, an API gateway module, and a message queue module. The service provider module is used for interacting with the bottom layer blockchain platform and providing services upwards; the service consumer module provides an API interface to the outside; the service discovery and registration center module is used for managing subsystem running conditions in the whole background interface service system; the API gateway module integrates interfaces of all service consumers and provides a uniform interface to the outside; the message queue module is used for caching tasks and achieving the effect of flow cutting.
According to one or more embodiments, as shown in fig. 2, a blockchain bottom layer service module constructs an official Client Geth Client to provide services externally based on a Docker container, so as to solve the problem that a single service end has insufficient service capability to provide services externally. The block chain bottom layer service module comprises a state monitoring module and a client service module, wherein the state monitoring module is used for monitoring the running condition of the Geth client; the client service module is used for processing blockchain related services such as issuing and running intelligent contracts, transferring accounts and the like. The client service module has a plurality of clients for providing services, so that a load balancing strategy suitable for a block chain service scene needs to be designed.
According to one or more embodiments, a task scheduling and load balancing module operates including four steps including building a container state vector model, defining load system health state parameters, building a task priority assignment model, and building a task assignment model.
The building of the container state vector model is to build a state distribution diagram of the container according to the parameter memory occupancy rate and the disk reading quantity with larger change of the state in the operation of the container; the defined load system health state parameters are used for establishing health evaluation indexes of the whole load system, and the running condition of the load system is adjusted according to the indexes; the task priority allocation model is used for classifying according to different characteristics of the tasks and determining priorities among the tasks; the task allocation model is constructed by allocating tasks to the most appropriate containers to maximize the concurrency performance of the entire blockchain service system.
Further, when the container running the Geth Client executes the task, two parameters of the memory and the disk IO amount change greatly, so that normalized values of the two parameters are selected to establish a state distribution diagram of the container. When the container is in an initial state of not executing tasks, the point projected to the state distribution diagram is closer to the original point, namely the memory occupancy rate is low, and a large amount of disk IO data does not exist. After executing the task, the memory occupancy rate is increased and a large amount of disk IO data exists, so that the distribution of the container in the state space is used as the load scheduling basis.
Calculating average value of the distances from the states of the m containers to the origin when the tasks are not executedAnd the average value of the projection of the state of the container when executing the task to the impending assembly to the originAverage value of +.>This average value can be used as an indicator of the state of health of the container, if the distance projected from the container state to the origin is less than this value, indicating that the container state is healthy, the smaller the container, the more healthy; if the containerThe distance of the state projection to the origin is greater than this value, indicating that the container state is unhealthy, the greater the unhealthy. Define the health parameter of the load system as +.>When LBH>When the value is=0, the whole load system is in a healthy state, and the load system operates normally at the moment; when LBH<And 0, the load system is in an unhealthy state, and the load system needs to recover and reallocate resources to part of the containers.
The blockchain-related business involves writing data to and reading data from the blockchain with minimal (negligible) consumption of resources by the read data, thus separating the read task from the write task, with the read task being prioritized. Tasks to write data to blockchain data include publishing smart contracts, operating accounts, and invoking smart contracts, the publishing smart contract tasks occurring least frequently but most important in the task stream; the operation account tasks comprise account creation, account unlocking, account token balance acquisition and the like, the occurrence frequency of the tasks is higher than that of the task of issuing intelligent contracts, and the importance is smaller; the call intelligence contracts occur most frequently and are relatively least significant. Constructing a task priority model according to the task priority model, wherein the reading task is prioritized over the writing task; the writing task priority is from high to low to issue intelligent contracts, operate accounts and call intelligent contracts, and the same type of task is executed according to a first come first serve principle.
According to Dis ave Dividing the state space into two regions, wherein the state value of the container is less than or equal to Dis ave Is a safe area container, and is otherwise a non-safe area container. The read task runs safely in both the safe and non-safe regions of the container, the write task runs safely in the safe region of the container, but running in the non-safe region of the container may cause the container to clog. The following tasking model is thus constructed:
(1) The read task is preferentially distributed to the unsafe area, and the distance from the origin is distributed from low to high;
(2) When the unsafe zone has no container, the read task is distributed to the write safe zone from Dis from high to low;
(3) The writing task is preferentially distributed to the safety area, and the distance from the writing task to the origin is distributed from high to low;
(4) When LBH is less than 0, the message queue is utilized to buffer the task waiting for the recovery of the blocking container;
(5) When LBH > =0, the task flow can be appropriately enlarged.
The performance test is performed by concurrent performance comparison with a blockchain service platform formed by a single client and a single blockchain service background system. Because the blockchain underlying service platform is a multi-client architecture, in order to test the capabilities of multiple clients in providing services, the tests to be employed herein are tested in three forms, 3 client, 5 client and 8 client, respectively. For the test in concurrency we test response times at 200, 600, 1000 and 1200 concurrency volumes, respectively. At 200 concurrency times, single clients are done faster than multiple clients because switching between multiple clients requires time. Thus, single-client architecture performs better than multi-client architecture in low concurrency situations. When the concurrency reaches 600 and upwards, the superiority of the multi-client architecture is gradually reflected, the task completion time of the multi-client is smaller than that of the single client, and the task completion time becomes shorter as the number of the clients is increased. When the concurrency reaches 1200, the single client cannot normally complete the function due to the blocking problem. The multi-client architecture still accomplishes the task without impact. Such as a comparison of the experimental results of fig. 3.
It is not difficult to find that compared with the traditional application mode of the block chain technology, the embodiment of the application increases the fault tolerance mechanism of the system and reduces the fault occurrence rate of the system. The embodiment of the application realizes the combination of the blockchain technology and the micro-service thought, can greatly improve the concurrency of blockchain service, is simple to apply, can be applied to the construction of systems such as copyright protection, transaction platforms and the like, and improves the service capability and reliability of the systems.
It should be understood that, in the embodiment of the present application, the term "and/or" is merely an association relationship describing the association object, which means that three relationships may exist. For example, a and/or B may represent: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.
In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. In addition, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices, or elements, or may be an electrical, mechanical, or other form of connection.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment of the present application.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application is essentially or a part contributing to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
While the application has been described with reference to certain preferred embodiments, it will be understood by those skilled in the art that various changes and substitutions of equivalents may be made and equivalents will be apparent to those skilled in the art without departing from the scope of the application. Therefore, the protection scope of the application is subject to the protection scope of the claims.
Claims (1)
1. A high performance blockchain service system, the system comprising: a block chain background service interface module, a block chain bottom service module and a task scheduling and load balancing module,
the block chain background service interface module is used for interacting with the bottom layer block chain platform;
the block chain bottom layer service module is used for providing block chain services to the outside, including running intelligent contracts, issuing transactions and/or participating in maintaining consistency operations;
the task scheduling and load balancing module is used for distributing tasks to the bottom block chain service nodes;
the block chain background service interface module transversely splits the service into read-write service, longitudinally splits the service into a service provider and a service consumer, and adds message middleware between the service provider and the service consumer for traffic cutting and task caching;
the block chain bottom layer service module is constructed based on a Docker container, and the number of the containers is increased under the condition of insufficient service capacity so as to improve the service performance;
the task scheduling and load balancing module comprises four steps:
establishing a container state vector model;
defining a load system health state parameter;
constructing a task priority distribution model; and
a task allocation model is constructed and a task allocation model is constructed,
the building of the container state vector model is to build a state distribution diagram of the container according to the parameter memory occupancy rate and the disk reading quantity with larger change of the state in the operation of the container;
the defined load system health state parameters are used for establishing health evaluation indexes of the whole load system, and the running condition of the load system is adjusted according to the indexes;
the task priority allocation model is used for classifying according to different characteristics of the tasks and determining priorities among the tasks;
the task allocation model is constructed by allocating tasks to the most suitable containers so as to maximize the concurrency performance of the whole blockchain service system;
the task scheduling and load balancing module is responsible for distributing the tasks transmitted by the block chain background service interface module to the block chain bottom layer service module according to a load balancing model,
the design of the load balancing model considers the state of the container, selects two parameter memories with the largest affected change in the container state and the IO size of the disk to establish a container state plane,
the load balancing parameter is thatWherein m is the number of containers, dis ave Is the average value of the distances from the origin point of all containers in the initial state and the impending load collapse state, defined as +.>Wherein x is 11 And x 12 The normalized value of the memory duty ratio and the disk IO quantity of the container in the initial state is x 21 And x 22 Is a containerThe normalized value of memory occupancy and disk IO amount immediately before crash,
when LBH > =0, the load system is in a healthy state,
when LBH <0, the load system is in an unhealthy state,
according to Dis ave Dividing the state plane into two regions, wherein the state value of the container is less than or equal to Dis ave Is a safe area container, whereas is a non-safe area container,
meanwhile, constructing the following task allocation model:
(1) The read task is preferentially distributed to the unsafe area, and the distance from the origin is distributed from low to high;
(2) When the unsafe zone has no container, the read task is distributed to the write safe zone from Dis from high to low;
(3) The writing task is preferentially distributed to the safety area, and the distance from the writing task to the origin is distributed from high to low;
(4) When LBH is less than 0, the message queue is utilized to buffer the task waiting for the recovery of the blocking container;
(5) When LBH > =0, the task flow is increased,
the task scheduling and load balancing module performs resource recovery and redistribution processing on the container with the container state far from the origin under the condition that LBH is less than 0;
the task scheduling and load balancing module calculates the average value Dis of the distances from the state of m containers to the origin point when the task is not executed and the next blocking is about to occur after a plurality of times of tasks are executed avemin And Dis avemax Find the average Dis of the two ave Which is the boundary between the two areas;
and taking the state plane partition as a block chain related service scheduling basis.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911182804.7A CN111046102B (en) | 2019-11-27 | 2019-11-27 | High performance blockchain service system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911182804.7A CN111046102B (en) | 2019-11-27 | 2019-11-27 | High performance blockchain service system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111046102A CN111046102A (en) | 2020-04-21 |
| CN111046102B true CN111046102B (en) | 2023-10-31 |
Family
ID=70233767
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911182804.7A Active CN111046102B (en) | 2019-11-27 | 2019-11-27 | High performance blockchain service system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111046102B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112104647A (en) * | 2020-09-14 | 2020-12-18 | 中电科大数据研究院有限公司 | Data interaction system and method between alliance chains |
| CN115720238B (en) * | 2022-09-01 | 2024-04-02 | 西安电子科技大学 | System and method for processing block chain request supporting high concurrency |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108734468A (en) * | 2018-05-23 | 2018-11-02 | 众安信息技术服务有限公司 | Information processing method based on block chain and Information Authentication method |
| CN108965468A (en) * | 2018-08-16 | 2018-12-07 | 北京京东尚科信息技术有限公司 | Block chain network service platform and its chain code installation method, storage medium |
| CN109002527A (en) * | 2018-07-13 | 2018-12-14 | 江苏开放大学（江苏城市职业学院） | A method of its management online exam of network test system and utilization based on block chain |
| CN109213568A (en) * | 2018-08-16 | 2019-01-15 | 北京京东尚科信息技术有限公司 | A kind of block chain network service platform and its dispositions method, storage medium |
| CN109582461A (en) * | 2018-11-14 | 2019-04-05 | 中国科学院计算技术研究所 | A kind of calculation resource disposition method and system for linux container |
| CN109951537A (en) * | 2019-03-06 | 2019-06-28 | 上海共链信息科技有限公司 | A kind of load balance distribution method towards block chain |
| CN110190997A (en) * | 2019-05-31 | 2019-08-30 | 深圳前海微众银行股份有限公司 | Configuration information obtaining method, device, equipment and computer readable storage medium |
| CN110392052A (en) * | 2019-07-22 | 2019-10-29 | 中国工商银行股份有限公司 | A kind of block chain intelligence contract processing system and method |
| CN110489200A (en) * | 2018-05-14 | 2019-11-22 | 中国科学院声学研究所 | A kind of method for scheduling task suitable for embedded container cluster |
-
2019
- 2019-11-27 CN CN201911182804.7A patent/CN111046102B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489200A (en) * | 2018-05-14 | 2019-11-22 | 中国科学院声学研究所 | A kind of method for scheduling task suitable for embedded container cluster |
| CN108734468A (en) * | 2018-05-23 | 2018-11-02 | 众安信息技术服务有限公司 | Information processing method based on block chain and Information Authentication method |
| CN109002527A (en) * | 2018-07-13 | 2018-12-14 | 江苏开放大学（江苏城市职业学院） | A method of its management online exam of network test system and utilization based on block chain |
| CN108965468A (en) * | 2018-08-16 | 2018-12-07 | 北京京东尚科信息技术有限公司 | Block chain network service platform and its chain code installation method, storage medium |
| CN109213568A (en) * | 2018-08-16 | 2019-01-15 | 北京京东尚科信息技术有限公司 | A kind of block chain network service platform and its dispositions method, storage medium |
| CN109582461A (en) * | 2018-11-14 | 2019-04-05 | 中国科学院计算技术研究所 | A kind of calculation resource disposition method and system for linux container |
| CN109951537A (en) * | 2019-03-06 | 2019-06-28 | 上海共链信息科技有限公司 | A kind of load balance distribution method towards block chain |
| CN110190997A (en) * | 2019-05-31 | 2019-08-30 | 深圳前海微众银行股份有限公司 | Configuration information obtaining method, device, equipment and computer readable storage medium |
| CN110392052A (en) * | 2019-07-22 | 2019-10-29 | 中国工商银行股份有限公司 | A kind of block chain intelligence contract processing system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111046102A (en) | 2020-04-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3701706B1 (en) | Blockchain-based data migration method and apparatus | |
| CN109144414B (en) | Multi-level storage method and device for block chain data | |
| US8751657B2 (en) | Multi-client storage system and storage system management method | |
| US7587492B2 (en) | Dynamic performance management for virtual servers | |
| CN107430528B (en) | Opportunistic resource migration to optimize resource placement | |
| EP3553655B1 (en) | Distributed policy-based provisioning and enforcement for quality of service | |
| CN105979007B (en) | Method and device for accelerating resource processing and network function virtualization system | |
| US7698115B2 (en) | System and method for dynamically allocating resources in a client/server environment | |
| CN111046102B (en) | High performance blockchain service system | |
| US20130060834A1 (en) | Distributed messaging system connectivity and resource management | |
| CN103180830A (en) | Cpu resource distribution method and calculating node | |
| US20070094343A1 (en) | System and method of implementing selective session replication utilizing request-based service level agreements | |
| US20200250677A1 (en) | Processing service requests based on risk identification | |
| CN109976907B (en) | Task allocation method and system, electronic device and computer readable medium | |
| CN111343102B (en) | Flow rate control method, server, client server and system | |
| US10705740B2 (en) | Managing of storage resources | |
| CN110928638A (en) | Method and device for selecting host machine for virtual machine deployment | |
| US10812408B1 (en) | Preventing concentrated selection of resource hosts for placing resources | |
| US10540341B1 (en) | System and method for dedupe aware storage quality of service | |
| CN111435320B (en) | Data processing method and device | |
| CN117785486B (en) | Environment resource allocation method, device, equipment and medium | |
| CN115168057B (en) | Resource scheduling method and device based on k8s cluster | |
| US11627085B2 (en) | Non-transitory computer-readable recording medium, service management device, and service management method | |
| CN112148683A (en) | File collection method and device | |
| CN116225685A (en) | Method and device for scheduling physical cores |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |