49 results about "Transaction scheduling" patented technology

In one exemplary embodiment, a method of a distributed database system includes the step of receiving a database transaction with a node of the distributed database system. A priority of the database transaction is determined. A load of a transaction queue of the node is determined. The execution of a database transaction is delayed if the load of the transaction queue is greater than a first-water mark. The database transaction is delayed for a specified period. A portion of the database transaction is execution after the specified period. It is determined if the load of the queue is below a second-water mark after the specified period. A remaining portion of the database transaction can be processed if the load of the queue is below the second-water mark.

A memory method may select a latency mode, such as read latency mode, based on measuring memory channel utilization. Memory channel utilization, for example, may include measurements in a memory controller queue structure. Other embodiments are described and claimed.

The embodiment of the invention discloses a concurrent transaction scheduling method and a related device, which are used for serializable pre-judgment in transactions. The method disclosed by the embodiment of the invention comprises the following steps of: acquiring a resource set of each transaction in a submission queue; transmitting the transactions in the submission queue into a waiting queue; judging whether each transaction in the waiting queue is dependent on any transaction in an execution queue or not according to the source set of each transaction in the waiting queue, and transmitting the transactions independent of any transaction in the execution queue in the waiting queue into a quasi execution queue if the transactions in the waiting queue are independent of any transaction in the execution queue; and dividing the quasi execution queue into an executable queue and a non-executable queue, transmitting the transactions in the non-executable queue into the waiting queue and transmitting the transactions in the executable queue to a CPU (central processing unit). By the technical scheme disclosed by the invention, the occurrence of deadlock phenomena can be avoided, thereby improving the overall running efficiency and performance of a system.

The invention provides an edge-cloud heterogeneity-oriented multi-level transaction scheduling allocation strategy, which comprises the following implementation steps that firstly, information of alltransactions generated at all data sources is collected, and the information of the transactions comprises the data size of the transactions, the size of transaction calculation amount, the size of received data, the data sources, the size of sent data, the data direction and the like; Secondly, arranging the transaction information to form a complete transaction dependency graph, and representingthe complete transaction dependency graph with a directed acyclic graph; And then, whether the transaction is processed at a cloud end or an edge server is judged, the priority of the transaction isjudged by utilizing a reasonable transaction priority heuristic algorithm, and a transaction queue with the priority from high to low is formed. And finally, determining the resource node for executing the transaction according to the load balance, the transaction waiting time, the transaction emergency degree and the resource node power consumption among the resource nodes, and finding out an optimal resource allocation scheme, thereby achieving the purpose of improving the system efficiency.

A system includes a deterministic system, and a controller electrically coupled to the deterministic system via a link, wherein the controller comprises a transaction scheduling mechanism that allows data responses from the deterministic system, corresponding to requests issued from the controller, to be returned out of order.

The invention relates to a transaction priority determination method in the field of heterogeneous distributed parallel processing. The method comprises the following steps of: determining the priority of a global transaction; distributing sub-transactions which are obtained by dividing the global transaction according to physical positions of data relevant to the sub-transactions; dynamically determining the priority of respective parts of local transactions; performing parallel processing on the local transactions; and returning an execution result. The invention provides a flow for dynamically determining the priority of the transaction based on a heterogeneous distributed system, so the real-time property and reliability of the system on processing of the global transaction are guaranteed.

The invention relates to a network game virtual property automatic transaction scheduling method; first, a scheduling center is arranged between a transaction platform and a game role control system; the scheduling center analyzes a transaction instruction sent by the transaction platform, schedules an appropriate game role, selects the appropriate game role control system to control a game role logon network game server, uses the transaction functions of a network game, and transfers the virtual property of the player role; the scheduling method can best utilize the machine resources and decentralize the use of different roles in the game to undertake transaction tasks, so that the virtual property owned by the roles is always little, so as to reduce the loss when the IDs of the roles are sealed, stolen and attacked.

The invention discloses a method for issuing write cache data of a storage system. The method comprises the steps of determining a concurrent processing threshold for scheduling a transaction to a write cache; when write cache data issuing is started, judging whether the to-be-processed data volume of the write cache reaches a concurrent processing threshold value or not according to the issued data volume and the write cache completion data volume; if so, pausing the issuing of the data to the write cache; and if not, continuing to issue the data of the write cache. According to the method, an issuing strategy of data from the transaction to the write cache in a controllable mode is provided; the concurrent threshold from transaction scheduling to write cache IO is introduced; and the transaction IO issuing thread is scheduled only when the concurrent number is smaller than the threshold value, so that the data processing pressure of the write cache is reduced; the situation that theIO of an upper-layer host is overtime is avoided; and the user experience is improved. The invention further provides a device and equipment for issuing the write cache data of the storage system anda readable storage medium, which have the above beneficial effects.

The invention provides a bank unusual transaction reversal method and system. The method comprises the steps of initiating a reversal request when an original transaction is unusual, generating an IFAdump file of the original transaction to record transaction memory data when the original transaction is unusual, writing initial state information of reversal in a first-in first-out reversal queue,and triggering a reversal service transaction; reading a reversal queue message from the first-in first-out reversal queue and analyzing a reversal transaction code comprised in the message, therebylinking a corresponding transaction scheduling engine according to the reversal transaction code; and searching for the corresponding IFA dump file according to the read reversal queue message by thetransaction scheduling engine, and according to the reversal transaction code, matching a corresponding reversal transaction process to perform reversal. By use of a triggering mechanism of the first-in first-out reversal queue and a file storage mechanism of the transaction memory data, automatic asynchronous reversal can be realized, so that the correctness of a transaction result is effectivelyimproved and the workload of manual reversal intervention is reduced.

In a WUSB communication environment in which isochronous transfer cannot be used, priority communication is performed in units of devices. A WUSB host manages assigning of a band of reserved one or more MASs in a superframe by using a device information management table, in which device information entries each describing, in a bitmap format, a MAS for which a transaction can be executed are each provided for a WUSB device. The WUSB host assigns at least some of the reserved one or more MASs only to a particular WUSB device. Only a WUSB device marked in a corresponding device information entry serves as a target of transaction scheduling.

A method and device for data communication using a hub. The method includes the step of buffering a single transfer request received at the hub during a transaction between the hub and the host controller, wherein the single transfer request is to be executed between the hub and the agent and will produce a result. The method also includes the step of determining whether a transport query received at the hub from the host controller corresponds to a result.

One or more embodiments of the present specification provide a transaction scheduling method and apparatus. The method may comprise: a blockchain node determines a data volume of a received private transaction; the blockchain node packages and transmits multiple private transactions of which the sum of data volumes is not greater than a preset threshold value to a trusted execution environment through single function calling; wherein under the condition that the incoming data volume is not larger than the preset threshold value, the first sales volume generated by the single function call is unrelated to the incoming data volume, and under the condition that the incoming data volume is larger than the preset threshold value, the second sales volume generated by the single function call islarger than the first sales volume and is positively related to the incoming data volume.

The invention relates to a risk control system and method based on pre-event synchronous processing and post-event asynchronous processing. The system comprises a risk control system client and a riskcontrol system server. After the risk control system server receives the post-event request from the risk control system client, synchronous calling of the post-event risk control service is completed; and a transaction scheduling dynamic control component in the risk control system server processes the transaction data based on the risk control configuration data from a dynamic cache component in a responsibility chain design mode, and synchronously returns a processing result to the risk control system client. The risk control configuration data is loaded by adopting the dynamic cache component with a lock-free design. In addition, when the post-event request is received, a message is sent to a post-event risk control component asynchronously, so that the post-event risk control assembly carries out post-processing.

The invention relates to a transaction scheduling method. The method comprises the following steps of enabling a scheduling unit of an operating system to process transactions, divide the processed transactions into different transaction types, establish a data structure for the transactions needing to be processed, and connect the data structure into a queue, wherein the processing process comprises the following steps: step 1, popping up the transactions; step 2, dividing the transactions into a ready transaction queue and a plurality of synchronous transaction queues by the scheduling unit;step 3, selecting a transaction from the queue by the scheduling unit according to a rule, and distributing a thread for the transaction; and step 4,enabling the scheduling unit to distribute the transactions to the CPU for processing. The method has the beneficial effects that human errors can be effectively avoided, meanwhile, software bugs are reduced, and the software development efficiency is greatly improved.

The invention relates to a bidding method considering risk constraint for a virtual power plant containing an electric vehicle to participate in main and auxiliary markets simultaneously, the virtual power plant comprises an EV, and the method comprises the following steps: determining a transaction scheduling flow of the virtual power plant containing the EV to participate in an electricity market; based on a transaction scheduling process and a risk condition value CVaR theory, establishing a bidding model in which the virtual power plant considering the risk constraint participates in the main and auxiliary markets at the same time; solving a bidding model in which the virtual power plant considering the risk constraint participates in the main and auxiliary markets at the same time; and based on a solution result of the bidding model, reasonably distributing operation benefits obtained by the virtual power plant participating in the main and auxiliary markets, thereby obtaining a bidding scheme that the virtual power plant participates in the main and auxiliary markets at the same time. The invention further discloses a corresponding system, terminal equipment and a computer readable storage medium. A means is provided for the participation of a single demand side resource with a small capacity in the electricity market, the participation of the VPP in the main and auxiliary markets at the same time, and the flexible measurement of the relationship between the risk and the risk income by a VPP operator according to the risk preference degree of the VPP operator.

The invention discloses a block chain transaction execution method and device. The method comprises the steps that a scheduler in a block chain system obtains each first transaction in a to-be-chained block, and each first transaction is a transaction which needs to call an intelligent contract for execution; the scheduler determines each execution stage of each first transaction, performs parallel execution on each first transaction in the same execution stage through each transaction executor in the block chain system, and performs serial execution on different execution stages in sequence. The intelligent contracts called by the first transactions in the same execution stage are different, and shared data do not exist among the intelligent contracts. The intelligent contracts without the shared data are determined in advance, the first transactions are distinguished based on the intelligent contracts without the shared data, so that the first transactions are distinguished into different execution stages, parallel execution is realized for transactions in the same execution stage, the efficiency of parallel execution of the transactions is improved, and the accuracy of parallel transaction execution is improved.

Memory transactions in a computing device may be scheduled by forming subsets of a set of memory transactions corresponding to memory transaction requests directed to a DRAM. Each subset may include transactions identified by the same combination of direction (read or write) and DRAM rank as each other. The transactions selected for inclusion in each subset may be determined based on efficiency. One of the subsets may be selected based on a metric applied to each subset, and the transactions in the selected subset may be sent to the DRAM.

The invention relates to a data processing method, a system, a computer device and a storage medium. The method comprises the following steps: an API Gateway receives a service request sent by a client, and sends the service request to an order domain micro-service. The order domain micro-service generates an order event by sorting the selected micro-service. After receiving the order event, the transaction dispatching center docks the micro service to execute the order event and output the full business result; the micro-service sends the data change result to the order domain micro-service through the transaction scheduling center to complete the data update of each micro-service. By adding a transaction scheduling center to coordinate the various micro-services to ensure the consistencyof the data when the micro-services call multiple databases.

The invention provides a deterministic concurrency control method and a system based on pre-transaction processing, and the method comprises the steps: fully improving the expandability and performance of transaction processing on the basis of deterministic transaction processing through enabling the execution of a transaction to be before the scheduling of the transaction; ensuring the correctness of affair execution through verification and re-execution; satisfying the deterministic execution of the affairs through explicit waiting, and each affair is ensured to be re-executed once at most;using multi-version data storage, so that read-only transactions are prevented from blocking transaction processing; by recording the address of the data required by the transaction, accelerating there-execution after the transaction verification fails. Compared with the prior art, the method has the advantages that the concurrency of transactions can be fully utilized, and the transaction processing capacity of a deterministic database is greatly improved; data information collected during transaction execution can be reused to accelerate transaction scheduling; and the complete read-write set of the transaction is determined without an additional mechanism, so that additional performance overhead in the prior art is avoided.

The invention discloses a transaction scheduling method and system based on priority self-adaption. The method comprises the following steps: acquiring a remote authorization request submitted by a network manager when handling a service for a client, calculating to obtain a service priority of the remote authorization request based on characteristic information of the remote authorization request, calculating to obtain a service priority based on the service priority of the remote authorization request and authorization request submitting time of the remote authorization request, and calculating to obtain a service priority; and sequentially inserting the service priorities into an authorization request queue from high to low, and finishing authorization processing based on the authorization request queue. The FCFS scheduling method and device can solve the problem that an FCFS scheduling algorithm cannot solve later services, improve the resource utilization efficiency, reduce the waiting time of customers under special conditions, and improve the customer experience.