Abstract: Techniques are described herein for asynchronous execution of queries on statically replicated graph data. In an embodiment, a graph is partitioned among a plurality of computers executing the graph querying engine. One or more high-degree vertices of the graph are each replicated in each graph partition. The partitions, including the replicated high-degree vertices, are loaded in memory of the plurality of computers. To execute a query, a query plan is generated based on the query. The query plan specifies a plurality of operators and an order for the plurality of operators. The order is such that if an operator requires data generated by another operator, then the other operator is ordered before the operator in the query plan. Replicated copies of a vertex is visited if matches made by subsequent operator(s) are limited by data unique to the replicated vertices.

Abstract: A system and controller where the pressure of the air is continuously monitored or read at a designated exhaust point and adjustments made to the flow of the air and gas to keep the efficiency of the appliance at a maximum to control the appliance (or the burner for an appliance) within specifications as dictated by the customer or consumer rather than training the user.

Abstract: Techniques herein provide job control and synchronization of distributed graph-processing jobs. In an embodiment, a computer system maintains an input queue of graph processing jobs. In response to de-queuing a graph processing job, a master thread partitions the graph processing job into distributed jobs. Each distributed job has a sequence of processing phases. The master thread sends each distributed job to a distributed processor. Each distributed job executes a first processing phase of its sequence of processing phases. To the master thread, the distributed job announces completion of its first processing phase. The master thread detects that all distributed jobs have announced finishing their first processing phase. The master thread broadcasts a notification to the distributed jobs that indicates that all distributed jobs have finished their first processing phase. Receiving that notification causes the distributed jobs to execute their second processing phase.

Abstract: Techniques herein provide job control and synchronization of distributed graph-processing jobs. In an embodiment, a computer system maintains an input queue of graph processing jobs. In response to de-queuing a graph processing job, a master thread partitions the graph processing job into distributed jobs. Each distributed job has a sequence of processing phases. The master thread sends each distributed job to a distributed processor. Each distributed job executes a first processing phase of its sequence of processing phases. To the master thread, the distributed job announces completion of its first processing phase. The master thread detects that all distributed jobs have announced finishing their first processing phase. The master thread broadcasts a notification to the distributed jobs that indicates that all distributed jobs have finished their first processing phase. Receiving that notification causes the distributed jobs to execute their second processing phase.

Abstract: Techniques are provided for dynamically self-balancing communication and computation. In an embodiment, each partition of application data is stored on a respective computer of a cluster. The application is divided into distributed jobs, each of which corresponds to a partition. Each distributed job is hosted on the computer that hosts the corresponding data partition. Each computer divides its distributed job into computation tasks. Each computer has a pool of threads that execute the computation tasks. During execution, one computer receives a data access request from another computer. The data access request is executed by a thread of the pool. Threads of the pool are bimodal and may be repurposed between communication and computation, depending on workload. Each computer individually detects completion of its computation tasks. Each computer informs a central computer that its distributed job has finished. The central computer detects when all distributed jobs of the application have terminated.

Abstract: Techniques are provided for dynamically self-balancing communication and computation. In an embodiment, each partition of application data is stored on a respective computer of a cluster. The application is divided into distributed jobs, each of which corresponds to a partition. Each distributed job is hosted on the computer that hosts the corresponding data partition. Each computer divides its distributed job into computation tasks. Each computer has a pool of threads that execute the computation tasks. During execution, one computer receives a data access request from another computer. The data access request is executed by a thread of the pool. Threads of the pool are bimodal and may be repurposed between communication and computation, depending on workload. Each computer individually detects completion of its computation tasks. Each computer informs a central computer that its distributed job has finished. The central computer detects when all distributed jobs of the application have terminated.

Abstract: Techniques minimize communication while loading a graph. In a distributed embodiment, each computer loads some edges of the graph. Each edge connects a source vertex (SV) to a destination vertex. For each SV of the edges, the computer hashes the SV to detect a tracking computer (TrC) that tracks on which computer does the SV reside. Each computer informs the TrC that the SV originates an edge that resides on that computer. For each SV, the TrC detects that the SV originates edges that reside on multiple providing computers (PCs). The TrC selects a target computer (TaC) from the multiple PCs to host the SV. The TrC instructs each PC, excluding the TaC, to transfer the SV and related edges that are connected to the SV to the TaC. A vertex's internal identifier indicates which computer hosts the vertex. The TrC maintains a mapping between external and internal identifiers.

Abstract: Techniques herein provide job control and synchronization of distributed graph-processing jobs. In an embodiment, a computer system maintains an input queue of graph processing jobs. In response to de-queuing a graph processing job, a master thread partitions the graph processing job into distributed jobs. Each distributed job has a sequence of processing phases. The master thread sends each distributed job to a distributed processor. Each distributed job executes a first processing phase of its sequence of processing phases. To the master thread, the distributed job announces completion of its first processing phase. The master thread detects that all distributed jobs have announced finishing their first processing phase. The master thread broadcasts a notification to the distributed jobs that indicates that all distributed jobs have finished their first processing phase. Receiving that notification causes the distributed jobs to execute their second processing phase.

Abstract: Techniques herein index data transferred during distributed graph processing. In an embodiment, a system of computers divides a directed graph into partitions. The system creates one partition per computer and distributes each partition to a computer. Each computer builds four edge lists that enumerate edges that connect the partition of the computer with a partition of a neighbor computer. Each of the four edge lists has edges of a direction, which may be inbound or outbound from the partition. Edge lists are sorted by identifier of the vertex that terminates or originates each edge. Each iteration of distributed graph analysis involves each computer processing its partition and exchanging edge data or vertex data with neighbor computers. Each computer uses an edge list to build a compactly described range of edges that connect to another partition. The computers exchange described ranges with their neighbors during each iteration.

Abstract: Techniques are provided for dynamically self-balancing communication and computation. In an embodiment, each partition of application data is stored on a respective computer of a cluster. The application is divided into distributed jobs, each of which corresponds to a partition. Each distributed job is hosted on the computer that hosts the corresponding data partition. Each computer divides its distributed job into computation tasks. Each computer has a pool of threads that execute the computation tasks. During execution, one computer receives a data access request from another computer. The data access request is executed by a thread of the pool. Threads of the pool are bimodal and may be repurposed between communication and computation, depending on workload. Each computer individually detects completion of its computation tasks. Each computer informs a central computer that its distributed job has finished. The central computer detects when all distributed jobs of the application have terminated.

Abstract: Techniques herein index data transferred during distributed graph processing. In an embodiment, a system of computers divides a directed graph into partitions. The system creates one partition per computer and distributes each partition to a computer. Each computer builds four edge lists that enumerate edges that connect the partition of the computer with a partition of a neighbor computer. Each of the four edge lists has edges of a direction, which may be inbound or outbound from the partition. Edge lists are sorted by identifier of the vertex that terminates or originates each edge. Each iteration of distributed graph analysis involves each computer processing its partition and exchanging edge data or vertex data with neighbor computers. Each computer uses an edge list to build a compactly described range of edges that connect to another partition. The computers exchange described ranges with their neighbors during each iteration.

Abstract: A system and controller where the pressure of the air is continuously monitored or read at a designated exhaust point and adjustments made to the flow of the air and gas to keep the efficiency of the appliance at a maximum to control the appliance (or the burner for an appliance) within specifications as dictated by the customer or consumer rather than training the user.

Abstract: High concentration, that is, strong antimicrobial treatment materials such as high concentration aqueous ammonia solutions or even liquid ammonia may be applied to a foodstuff without deleterious effects by controlling the temperature of the foodstuff at or immediately after the time of contact with the antimicrobial treatment material. In particular, ice crystals are maintained at or just below the surface of the foodstuff at or immediately after the time of contact with the antimicrobial treatment material. The ice crystals in the foodstuff inhibit absorption of the antimicrobial treatment material into the foodstuff.

Abstract: A process includes contacting a feathered poultry carcass with an ammonia-based treatment material to increase the pH at the skin of the carcass and thereby effect a loosening of the feathers on the carcass. After the contact with the ammonia-based treatment material, mild heat may be applied to the feathered carcass to further loosen the feathers. The prepared feathered carcass is then defeathered in a suitable defeathering process. Ammonia may be removed from the carcass before, after, and/or during defeathering. The defeathered carcass is then passed on for further processing to produce the final poultry product.

Abstract: A process includes contacting a feathered poultry carcass with an ammonia-based treatment material to increase the pH at the skin of the carcass and thereby effect a loosening of the feathers on the carcass. After the contact with the ammonia-based treatment material, mild heat may be applied to the feathered carcass to further loosen the feathers. The prepared feathered carcass is then defeathered in a suitable defeathering process. Ammonia may be removed from the carcass before, after, and/or during defeathering. The defeathered carcass is then passed on for further processing to produce the final poultry product.

Abstract: High concentration, that is, strong antimicrobial treatment materials such as high concentration aqueous ammonia solutions or even liquid ammonia may be applied to a foodstuff without deleterious effects by controlling the temperature of the foodstuff at or immediately after the time of contact with the antimicrobial treatment material. In particular, ice crystals are maintained at or just below the surface of the foodstuff at or immediately after the time of contact with the antimicrobial treatment material. The ice crystals in the foodstuff inhibit absorption of the antimicrobial treatment material into the foodstuff.

Abstract: A system and method of controlling a variable speed air handling fan for a vent hood includes a temperature sensor and a processor. Speed setpoints and a deadband range are received from a user by the processor. The processor computes deadband setpoints and receives a temperature from the temperature sensor. The processor is in communication with a motor controller for controlling the speed of the fan. The processor changes the speed of the fan when the temperature rises above a certain setpoint. However, the processor will not change the speed of the fan back to its previous speed until the temperature falls below the deadband setpoint that corresponds to the certain setpoint.

Abstract: A method for heating foodstuffs, particularly mixtures made up of small pieces of meat, comprises pressurizing the uncooked mixture to force the mixture through a flow resistance device (22) at a heating velocity. Sufficient force is applied to the uncooked mixture to produce frictional resistance heating in the uncooked mixture as the mixture travels through the flow resistance device (22). The frictional resistance heats the uncooked mixture from an initial temperature to a final temperature which may be above a cooking temperature. This final temperature converts the uncooked mixture to a desired processed mixture. The invention may also include forming the processed mixture into a desired shape and cooling the processed mixture to a setting temperature. A variable resistance device (40) may be included in the flow resistance device (22) and used to control the level of heating in the foodstuffs.