An apparatus includes a processor to: instantiate collection threads, data buffers of a queue, and aggregation threads: within each collection thread, assemble a row group from a subset of the multiple rows, reorganize the data values row-wise to columnar organization, and store the row group within a data buffer of the queue; operate the buffer queue as a FIFO buffer; within each aggregation thread, retrieve multiple row groups from multiple data buffers of the queue, assemble a data set part from the multiple row groups, transmit, to storage device(s) via a network, the data set part; and in response to each instance of retrieval of a row group from a data buffer of the buffer queue for use within an aggregation thread, analyze a level of availability of at least storage space within the node device to determine whether to dynamically adjust the quantity of data buffers of the buffer queue.
A computing device manages a router. A manager engine is instantiated based on a manager engine definition and instantiates a manager ESPE based on a created manager ESP model. A router configuration file is created based on mapping information read from the manager configuration file that describes connectivity between an event publishing source and a source window of the manager ESPE. A router engine is instantiated based on the created router configuration file. A connector is started to receive an event based on the router configuration file. The event is received in the source window of the manager ESPE processed based on the manager ESP model. A third computing device is selected by the router engine based on a usage metric received from each window of a plurality of windows defined by a remote ESP model configured to further process the processed event when it is received.
H04L 43/0811 - Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
An apparatus includes a processor component of a first node device caused to receive data block encryption data and an indication of size of an encrypted data block distributed to the first node device for decryption, and in response to the data set being of encrypted data: receive an indication of the quantity of sub-blocks within the encrypted data block, and a hashed identifier for each data sub-block; use the data block encryption data to decrypt the encrypted data block to regenerate data set portions from the data sub-blocks; analyze the hashed identifier of each data sub-block to determine whether all data set portions are distributed to the first node device for processing; and in response to a determination that at least one data set portion is to be distributed to a second node device for processing, transmit the at least one data set portion to the second node device.
An apparatus includes a processor component of a first node device caused to receive data block encryption data and an indication of size of an encrypted data block distributed to the first node device for decryption, and in response to the data set being of encrypted data: receive an indication of the quantity of sub-blocks within the encrypted data block, and a hashed identifier for each data sub-block; use the data block encryption data to decrypt the encrypted data block to regenerate data set portions from the data sub-blocks; analyze the hashed identifier of each data sub-block to determine whether all data set portions are distributed to the first node device for processing; and in response to a determination that at least one data set portion is to be distributed to a second node device for processing, transmit the at least one data set portion to the second node device.
H04L 41/16 - Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
H04L 67/1074 - Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
H04L 9/06 - Arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for blockwise coding, e.g. D.E.S. systems
An apparatus including a processor to receive search criteria including a data value for a search within a data field; in response to the receipt of the query instructions, and for each data cell within a super cell, perform the specified search by comparing the data value to ranges of values indicated in a corresponding cell index to determine whether the data cell includes a data record meeting the search criteria, and in response to a determination that the data cell includes such a data record, use a unique values index in the cell index to search the data records of the data cell to identify one or more data records meeting the search criteria; and in response to identifying at least one data record meeting the search criteria, provide an indication that at least the data cell includes at least one data record meeting the search criteria.
An apparatus including a processor to receive search criteria including a data value for a search within a data field; in response to the receipt of the query instructions, and for each data cell within a super cell, perform the specified search by comparing the data value to ranges of values indicated in a corresponding cell index to determine whether the data cell includes a data record meeting the search criteria, and in response to a determination that the data cell includes such a data record, use a unique values index in the cell index to search the data records of the data cell to identify one or more data records meeting the search criteria; and in response to identifying at least one data record meeting the search criteria, provide an indication that at least the data cell includes at least one data record meeting the search criteria.
A first computing device manages a cluster of event stream processing (ESP) engines (ESPEs). A local ESP model is created based on information read from a manager configuration file that includes first connection information to connect to the second computing device and second connection information to connect the third computing device. An ESPE is instantiated on the first computing device based on the created local ESP model. The event block object is received from the second computing device in a first source window of the instantiated ESPE. A remote ESP model is deployed to a remote third computing device. The manager configuration file includes an indicator of the remote ESP model. The third computing device to receive the processed event block object is selected. The processed event block object is published to a second source window defined by the remote ESP model deployed to the third computing device.
G06F 17/00 - Digital computing or data processing equipment or methods, specially adapted for specific functions
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
8.
COMPILATION FOR NODE DEVICE GPU-BASED PARALLEL PROCESSING
An apparatus may include a processor and storage to store instructions that cause the processor to perform operations including: in response to a determination that a GPU of a node device is available, determine whether a task routine can be compiled to generate a GPU task routine for execution by the GPU to cause performance of multiple instances of a task of the task routine at least partially in parallel without dependencies thereamong; and in response to a determination that the task routine is able to be compiled to generate the GPU task routine: employ a conversion rule to convert the task routine into the GPU task routine; compile the GPU task routine for execution by the GPU; and assign performance of the task with a data set partition to the node device to enable performance of the multiple instances with the data set partition by the GPU.
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
A computing device receives and parses an authentication packet that includes a user identifier from a network activity data capture device. The user identifier identifies a user of a second computing device being monitored by the computing device. A peer group identifier for a user associated with the user identifier is determined that identifies a peer group to which the user is assigned. Members of the peer group are identified based on an expected network activity behavior. The parsed authentication data is buffered with the peer group identifier into a first event block object sent to a first source window of an event stream processing engine and a second event block object sent to a second source window of the event stream processing engine. The first source window is configured to process a netflow packet, and the second source window is configured to process the authentication packet.
H04L 61/4511 - Network directories; Name-to-address mapping using standardised directory access protocols using domain name system [DNS]
H04L 67/61 - Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
H04L 9/32 - Arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system
H04L 12/22 - Arrangements for preventing the taking of data from a data transmission channel without authorisation
A computing device resolves a prioritized list of Internet protocol (IP) address to domain names. Each request of a plurality of requests is added to a request list using a priority value. A lookup request packet is created from a first request selected from the request list and then removed from the request list. The lookup request packet is sent to a third computing device, and includes an IP address for which to resolve the domain name. A response is received from the third computing device that includes the IP address and the domain name of the IP address. The IP address is added to keystore data in association with the domain name. When the request list includes a next request, the next request is selected from the request list, and processing continues with creating the lookup request packet with the next request.
H04L 9/32 - Arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system
G06F 21/55 - Detecting local intrusion or implementing counter-measures
H04L 43/026 - Capturing of monitoring data using flow identification
H04L 43/08 - Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
H04L 61/4511 - Network directories; Name-to-address mapping using standardised directory access protocols using domain name system [DNS]
H04L 67/61 - Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
H04L 12/22 - Arrangements for preventing the taking of data from a data transmission channel without authorisation
An apparatus includes a processor component caused to: retrieve metadata of organization of data within a data set, and map data of organization of data blocks within a data file; receive indications of which node devices are available to perform a processing task with a data set portion; and in response to the data set including partitioned data, compare the quantities of available node devices and of the node devices last involved in storing the data set. In response to a match, for each map data map entry: retrieve a hashed identifier for a data sub-block, and a size for each of the data sub-blocks within the corresponding data block; divide the hashed identifier by the quantity of available node devices; compare the modulo value to a designation assigned to each of the available node devices; and provide a pointer to the available node device assigned the matching designation.
G06F 16/22 - Indexing; Data structures therefor; Storage structures
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
G06F 3/06 - Digital input from, or digital output to, record carriers
G06F 12/00 - Accessing, addressing or allocating within memory systems or architectures
12.
SYSTEMS AND METHODS FOR FAULT TOLERANT COMMUNICATIONS
Apparatuses, systems and methods are disclosed for tolerating fault in a communications grid. Specifically, various techniques and systems are provided for detecting a fault or failure by a node in a network of computer nodes in a communications grid, adjusting the grid to avoid grid failure, and taking action based on the failure. In an example, a system may include receiving grid status information at a backup control node, the grid status information including a project status, storing the grid status information within the backup control node, receiving a failure communication including an indication that a primary control node has failed, designating the backup control node as a new primary control node, receiving updated grid status information based on the indication that the primary control node has failed, and transmitting a set of instructions based on the updated grid status information.
Apparatuses, systems and methods are disclosed for tolerating fault in a communications grid. Specifically, various techniques and systems are provided for detecting a fault or failure by a node in a network of computer nodes in a communications grid, adjusting the grid to avoid grid failure, and taking action based on the failure. In an example, a system may include receiving grid status information at a backup control node, the grid status information including a project status, storing the grid status information within the backup control node, receiving a failure communication including an indication that a primary control node has failed, designating the backup control node as a new primary control node, receiving updated grid status information based on the indication that the primary control node has failed, and transmitting a set of instructions based on the updated grid status information.
G06F 11/16 - Error detection or correction of the data by redundancy in hardware
H04L 9/32 - Arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system
14.
COMPUTER SYSTEM TO SUPPORT FAILOVER IN AN EVENT STREAM PROCESSING SYSTEM
In a computing device supporting a failover in an event stream processing (ESP) system, an event block object is received. A first status of the computing device as active or standby is determined. When the first status is active, a second status of the computing device as newly active or not newly active is determined. Newly active is determined when the computing device is switched from a standby to an active status. When the second status is newly active, a last published event block object identifier that uniquely identifies a last published event block object is determined. A next event block object is selected from a non-transitory computer-readable medium accessible by the computing device. The next event block object has an event block object identifier that is greater than the determined last published event block object identifier. The selected next event block object is published to an out-messaging network device.
G06F 11/20 - Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
H04L 41/0663 - Performing the actions predefined by failover planning, e.g. switching to standby network elements
A computing device configured to determine when an alarm is triggered for a drilling operation is provided. Measured drilling data that includes a value measured for an input variable during a previous connection event of a drilling operation is received. A predicted value for a fluid flow back measure is determined by executing a predictive model with the measured drilling data as an input. The predictive model is determined using previous drilling data that includes a plurality of values measured for the input variable during a second drilling operation. The second drilling operation is a previous drilling operation at a different geographic wellbore location than the drilling operation. A fluid flow back measurement datum determined from sensor data is compared to the determined predicted value for the fluid flow back measure. An alarm is triggered on the drilling operation based on the comparison.
E21B 44/00 - Automatic control systems specially adapted for drilling operations, i.e. self-operating systems which function to carry out or modify a drilling operation without intervention of a human operator, e.g. computer-controlled drilling systems; Systems specially adapted for monitoring a plurality of drilling variables or conditions
E21B 47/10 - Locating fluid leaks, intrusions or movements
A method of determining an optimal value for a control of a drilling operation is provided. Drilling data from a drilling operation is received. The drilling data includes a plurality of values measured for each of a plurality of drilling control variables during the drilling operation. An objective function model is determined using the received drilling data. The objective function model maximizes a rate of penetration for the drilling operation. Measured drilling data is received that includes current drilling data values for a different drilling operation. An optimal value for a control of the different drilling operation is determined by executing the determined objective function model with the measured drilling data that includes the current drilling data values for the different drilling operation as an input. The determined optimal value for the control of the different drilling operation is output.
E21B 44/00 - Automatic control systems specially adapted for drilling operations, i.e. self-operating systems which function to carry out or modify a drilling operation without intervention of a human operator, e.g. computer-controlled drilling systems; Systems specially adapted for monitoring a plurality of drilling variables or conditions
17.
CONTROL PARAMETER DETERMINATION IN STEAM ASSISTED GRAVITY DRAINAGE OIL DRILLING
Drilling data including a plurality of values measured for each of a plurality of drilling parameters is received. An objective function that maximizes production of a material produced by a production operation, minimizes water usage by the production operation, and minimizes a sub-cool temperature of the material is determined using the received drilling data. An association rule that defines a range of values for a control parameter of the plurality of drilling parameters that is selected based on a value of a first parameter of the plurality of drilling parameters is determined using the received drilling data. Measured drilling data that indicates current control parameter values of the production operation is received. An optimal value for the control parameter is determined by executing the determined objective function with the received, measured drilling data as an input and subject to the determined association rule. The determined optimal value is output.
E21B 44/00 - Automatic control systems specially adapted for drilling operations, i.e. self-operating systems which function to carry out or modify a drilling operation without intervention of a human operator, e.g. computer-controlled drilling systems; Systems specially adapted for monitoring a plurality of drilling variables or conditions
E21B 43/24 - Enhanced recovery methods for obtaining hydrocarbons using heat, e.g. steam injection
18.
SYSTEMS AND METHODS FOR GENERATING A CROSS-PRODUCT MATRIX IN A SINGLE PASS THROUGH DATA USING SINGLE PASS LEVELIZATION
Systems and methods are provided for a data processing system having multiple executable threads that is configured to generate a cross-product matrix in a single pass through data to be analyzed. An example system comprises memory for receiving the data to be analyzed, a processor having a plurality of executable threads for executing code to analyze data, and software code for generating a cross-product matrix in a single pass through data to be analyzed. The software code includes threaded variable levelization code for generating a plurality of thread specific binary trees for a plurality of classification variables, variable tree merge code for combining a plurality of the thread-specific trees into a plurality of overall trees for the plurality of classification variables, effect levelization code for generating a plurality of sub-matrices of the cross-product matrix using the plurality of the overall trees for the plurality of classification variables, and cross-product matrix generation code for generating the cross- product matrix by storing and ordering the elements of the sub-matrices in contiguous memory space.
Systems and methods are provided for a grid computing system that performs analytical calculations on data stored in a distributed database system. A grid-enabled software component at a control node is configured to invoke database management software (DBMS) at the control node to cause the DBMS at a plurality of the worker nodes to make available data to the grid- enabled software component local to its node; instruct the grid-enabled software components at the plurality of worker nodes to perform an analytical calculation on the received data and to send the results of the data analysis to the grid-enabled software component at the control node; and assemble the results of the data analysis performed by the grid-enabled software components at the plurality of worker nodes.
20.
SCENARIO STATE PROCESSING SYSTEMS AND METHODS FOR OPERATION WITHIN A GRID COMPUTING ENVIRONMENT
Systems and methods are provided for generating multiple system state projections for one or more scenarios using a grid computing environment. A central coordinator software component executes on a root data processor and provides commands and data to a plurality of node coordinator software components. A node coordinator software component manages threads which execute on its associated node data processor and which perform a set of matrix operations. Stochastic simulations use results of the matrix operations to generate multiple state projections. Additional processing can be performed by the grid computing environment based upon the generated state projections, such as to develop risk information for users.
patents
