# Patent

## Title
Enhanced power method on an electronic device

## Abstract

A power method can be enhanced. For example, an electronic communication indicating a job to be performed can be received. A best rank-1 approximation of a matrix associated with the job can be determined using the power method. Each iteration of the power method can include determining a point that lies on a line passing through (i) a first value for a first singular vector from an immediately prior iteration of the power method; and (ii) a second value for the first singular vector from another prior iteration of the power method. Each iteration of the power method can also include determining, by performing the power method using the point, a current value for the first singular vector and a current value for a second singular vector for a current iteration of the power method. The job can then be performed using the best rank-1 approximation of the matrix.

## Background
REFERENCE TO RELATED APPLICATION
This claims the benefit of priority under 35 U.S.C. §119(e) to U.S. Provisional Patent Application No. 62/344,717 filed Jun. 2, 2016, the entirety of which is hereby incorporated by reference herein.


TECHNICAL FIELD
The present disclosure relates generally to electrical computers and digital data processing systems. More specifically, but not by way of limitation, this disclosure relates to an enhanced power method on an electronic device.
BACKGROUND
Machine-learning classifiers (e.g., neural networks), predictive models, and statistical models can apply hundreds of thousands of operations to data sets to determine information about the data sets. It can take a significant amount of time, memory, processing power, and electrical power to perform these operations. For example, a computing device may perform thousands of matrix operations over hundreds of iterations of steps to analyze a data set, during which time the computing device may repeatedly access and store information in thousands of memory locations. This level of processing can take hours, or days, to perform; can require a significant amount of electrical power; can reduce the available resources (e.g., processing power and memory) on the computing device for performing other tasks; can slow down other processes executing on the computing device; and can require complicated and expensive hardware.
SUMMARY
In one example, a non-transitory computer readable medium comprising program code that is executable by a processor is provided. The program code can cause the processor to receive an electronic communication indicating a job to be performed. The program code can cause the processor to determine a best rank-1 approximation of a matrix associated with the job using a power method. Each iteration of the power method can include determining a point that lies on a line passing through (i) a first value for a first singular vector from an immediately prior iteration of the power method; and (ii) a second value for the first singular vector from another prior iteration of the power method. Each iteration of the power method can also include determining, by performing the power method using the point, a current value for the first singular vector and a current value for a second singular vector for a current iteration of the power method. The program code can cause the processor to perform the job at least in part using the best rank-1 approximation of the matrix. The program code can cause the processor to transmit another electronic communication associated with a result of the job.
In another example, a method is provided that can include receiving an electronic communication indicating a job to be performed. The method can including determining a best rank-1 approximation of a matrix associated with the job using a power method. Each iteration of the power method can include determining a point that lies on a line passing through (i) a first value for a first singular vector from an immediately prior iteration of the power method; and (ii) a second value for the first singular vector from another prior iteration of the power method. Each iteration of the power method can also include determining, by performing the power method using the point, a current value for the first singular vector and a current value for a second singular vector for a current iteration of the power method. The method can include performing the job at least in part using the best rank-1 approximation of the matrix. The method can include transmitting another electronic communication associated with a result of the job.
In another example, a system is provided that can include a processing device and a memory device. The memory device can include instructions executable by the processing device for causing the processing device to receive an electronic communication indicating a job to be performed. The instructions can cause the processing device to determine a best rank-1 approximation of a matrix associated with the job using a power method. Each iteration of the power method can include determining a point that lies on a line passing through (i) a first value for a first singular vector from an immediately prior iteration of the power method; and (ii) a second value for the first singular vector from another prior iteration of the power method. Each iteration of the power method can also include determining, by performing the power method using the point, a current value for the first singular vector and a current value for a second singular vector for a current iteration of the power method. The instructions can cause the processing device to perform the job at least in part using the best rank-1 approximation of the matrix. The instructions can cause the processing device to transmit another electronic communication associated with a result of the job.
This summary is not intended to identify key or essential features of the claimed subject matter, nor is it intended to be used in isolation to determine the scope of the claimed subject matter. The subject matter should be understood by reference to appropriate portions of the entire specification, any or all drawings, and each claim.
The foregoing, together with other features and examples, will become more apparent upon referring to the following specification, claims, and accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
The present disclosure is described in conjunction with the appended figures:
FIG. 1 is a block diagram of an example of the hardware components of a computing system according to some aspects.
FIG. 2 is an example of devices that can communicate with each other over an exchange system and via a network according to some aspects.
FIG. 3 is a block diagram of a model of an example of a communications protocol system according to some aspects.
FIG. 4 is a hierarchical diagram of an example of a communications grid computing system including a variety of control and worker nodes according to some aspects.
FIG. 5 is a flow chart of an example of a process for adjusting a communications grid or a work project in a communications grid after a failure of a node according to some aspects.
FIG. 6 is a block diagram of a portion of a communications grid computing system including a control node and a worker node according to some aspects.
FIG. 7 is a flow chart of an example of a process for executing a data analysis or processing project according to some aspects.
FIG. 8 is a block diagram including components of an Event Stream Processing Engine (ESPE) according to some aspects.
FIG. 9 is a flow chart of an example of a process including operations performed by an event stream processing engine according to some aspects.
FIG. 10 is a block diagram of an ESP system interfacing between a publishing device and multiple event subscribing devices according to some aspects.
FIG. 11 is a flow chart of an example of a process for enhancing a power method on an electronic device according to some aspects.
FIG. 12 is a flow chart of an example of a process for determining a best rank-1 approximation of a matrix associated with a job according to some aspects.
FIG. 13 is a table of an example of results using a traditional power method according to some aspects.
FIG. 14 is a table of an example of results using an enhanced power method according to some aspects.
FIG. 15 is a table of an example of computational costs for performing a traditional power method and for performing an enhanced power method according to some aspects.
FIG. 16 is a table of an example of data sets for comparing a traditional power method to an enhanced power method according to some aspects.
FIG. 17 is a table of an example of results from analyzing the data sets in FIG. 16 using the traditional power method and the enhanced power method according to some aspects.



In the appended figures, similar components or features can have the same reference label. Further, various components of the same type can be distinguished by following the reference label by a dash and a second label that distinguishes among the similar components. If only the first reference label is used in the specification, the description is applicable to any one of the similar components having the same first reference label irrespective of the second reference label.
DETAILED DESCRIPTION
In the following description, for the purposes of explanation, specific details are set forth in order to provide a thorough understanding of examples of the technology. But various examples can be practiced without these specific details. The figures and description are not intended to be restrictive.
The ensuing description provides examples only, and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather, the ensuing description of the examples provides those skilled in the art with an enabling description for implementing an example. Various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the technology as set forth in the appended claims.
Specific details are given in the following description to provide a thorough understanding of the examples. But the examples may be practiced without these specific details. For example, circuits, systems, networks, processes, and other components can be shown as components in block diagram form to prevent obscuring the examples in unnecessary detail. In other examples, well-known circuits, processes, algorithms, structures, and techniques may be shown without unnecessary detail in order to avoid obscuring the examples.
Also, individual examples can be described as a process that is depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, or a block diagram. Although a flowchart can describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations can be re-arranged. A process is terminated when its operations are completed, but can have additional operations not included in a figure. A process can correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination can correspond to a return of the function to the calling function or the main function.
Systems depicted in some of the figures can be provided in various configurations. In some examples, the systems can be configured as a distributed system where one or more components of the system are distributed across one or more networks in a cloud computing system.
Certain aspects and features of the present disclosure relate to improving processing speeds and reducing an amount of memory used by an electronic device to perform a power method by reducing a number of processing iterations and memory accesses required to perform the power method. The power method can be an iterative process for determining a property (e.g., a best rank-1 approximation) of a matrix. As an example, the electronic device can use a modified power method that requires fewer processing iterations and fewer memory accesses to determine a particular property of a matrix. This can result in less processing power, memory, and electrical power being consumed by the electronic device to determine the particular property of the matrix.
A matrix can have various properties. One example of such a property is a rank. The rank of a matrix can be the smaller of (i) the number of linearly independent rows in the matrix; or (ii) the number of linearly independent columns in the matrix. And if the matrix has any nonzero values, the matrix can at least have a rank of one. In some examples, a row (or column) of the matrix can be linearly dependent if the row (or column) can be defined as a linear combination of the other rows. A row of the matrix can be linearly independent if the row cannot be defined as a linear combination of the other rows.
As a particular example, the matrix X can have the following values:




  X
  =
  
    [
    
      
        
          1
        
        
          1
        
        
          0
        
        
          2
        
      
      
        
          
            -
            1
          
        
        
          
            -
            1
          
        
        
          0
        
        
          
            -
            2
          
        
      
    
    ]
  




Because the matrix X has nonzero values, the rank of matrix X is at least one. All of the rows are linearly dependent on one another (e.g., the first row is the inverse of the second row), so they do not contribute to the rank. And all of the columns are linearly dependent on one another (e.g., the sum of the first, second, and third columns equals the fourth column), so they also do not contribute to the rank. Because the rank of matrix X must have at least a rank of one, and there are no linearly independent rows or columns, the rank of matrix X is one.

As another example, the matrix Y can have the following values:




  Y
  =
  
    [
    
      
        
          1
        
        
          2
        
        
          1
        
      
      
        
          
            -
            2
          
        
        
          
            -
            3
          
        
        
          1
        
      
      
        
          3
        
        
          5
        
        
          0
        
      
    
    ]
  




Because matrix Y has nonzero values, the rank of the matrix Y is at least one. And the first two rows are linearly independent, so the rank of the matrix is at least two. Because all three columns are linearly dependent (e.g., the first row is equal to the sum of the second row and the third row), they do not contribute to the rank. So, the rank of matrix Y is two.

As shown in the example above, a matrix can have a rank that is greater than one. But various programs and mathematical operations may require a matrix that has a rank of one. To accommodate these programs and mathematical operations, the values of the original matrix can be modified (e.g., zeroed out) until the resulting matrix has a rank of one. This resulting matrix can be referred to as rank-1 approximation of the original matrix.
Different methods can be used to determine a rank-1 approximation of a matrix. Some methods can yield rank-1 approximations that are (i) more accurate (e.g., they have smaller approximation errors) than the rank-1 approximations obtained using other methods, (ii) determined faster than using the other methods, or (iii) both of these. In some examples, a best rank-1 approximation of a matrix A can solve or optimize the following equation:

minλ,u,v:uTu=vTv=1∥A−λuvT∥F2  Equation 1:

where A is the matrix A; λ is a largest singular value of the matrix A; u is a left singular value that corresponds to the largest singular value; and v is a right singular value that corresponds to the largest singular value.

In some examples, the power method can be used to solve Equation 1 to determine the best rank-1 approximation of the matrix A. The power method can be implemented according to Algorithm 1 defined below:
Input: A, v0 
Output: ui, vi, λi 

    
    
        1: Set i=0
        2: repeat
        3: Set i=i+1
        4:
    
    






  
    Compute
    ⁢
    
      
    
    ⁢
    
      u
      i
    
  
  =
  
    
      Av
      
        i
        -
        1
      
    
    
      
        
        
          Av
          
            i
            -
            1
          
        
        
      
      2
    
  




    
    
        5:
    
    






  
    Compute
    ⁢
    
      
    
    ⁢
    
      v
      i
    
  
  =
  
    
      
        A
        T
      
      ⁢
      
        u
        i
      
    
    
      
        
        
          
            A
            T
          
          ⁢
          
            u
            i
          
        
        
      
      2
    
  




    
    
        6: Set λ1=uiTAvi=∥ATui∥2 
        7: until a convergence criterion is satisfied

where A is the original matrix A; v0 is an initial, right singular value that is nonzero; λi is the largest singular value of the matrix at interval i; ui is the left singular value at interval i; and vi is the right singular value at interval i. But Algorithm 1 may need to perform hundreds or thousands of iterations to determine the values (e.g., optimal values) for ui, vi, and λi. This may result in a significant amount of processing power, memory, and electrical power being consumed.

    
    


Some examples of the present disclosure overcome one or more of the abovementioned issues by performing an enhanced version of the power method, which is discussed in greater detail below. The enhanced version of the power method can reduce the number of processing iterations and memory accesses required to determine the best rank-1 approximation of a matrix.
FIGS. 1-10 depict examples of systems and methods usable for implementing an enhanced power method on an electronic device according to some aspects. For example, FIG. 1 is a block diagram of an example of the hardware components of a computing system according to some aspects. Data transmission network 100 is a specialized computer system that may be used for processing large amounts of data where a large number of computer processing cycles are required.
Data transmission network 100 may also include computing environment 114. Computing environment 114 may be a specialized computer or other machine that processes the data received within the data transmission network 100. The computing environment 114 may include one or more other systems. For example, computing environment 114 may include a database system 118 or a communications grid 120. The data transmission network 100 can include one or more processors (e.g., distributed over one or more networks or otherwise in communication with one another) that, in some examples, can collectively be referred to as a processor.
Data transmission network 100 also includes one or more network devices 102. Network devices 102 may include client devices that can communicate with computing environment 114. For example, network devices 102 may send data to the computing environment 114 to be processed, may send communications to the computing environment 114 to control different aspects of the computing environment or the data it is processing, among other reasons. Network devices 102 may interact with the computing environment 114 through a number of ways, such as, for example, over one or more networks 108.
In some examples, network devices 102 may provide a large amount of data, either all at once or streaming over a period of time (e.g., using event stream processing (ESP)), to the computing environment 114 via networks 108. For example, the network devices 102 can transmit electronic messages for implementing an enhanced power method, all at once or streaming over a period of time, to the computing environment 114 via networks 108.
The network devices 102 may include network computers, sensors, databases, or other devices that may transmit or otherwise provide data to computing environment 114. For example, network devices 102 may include local area network devices, such as routers, hubs, switches, or other computer networking devices. These devices may provide a variety of stored or generated data, such as network data or data specific to the network devices 102 themselves. Network devices 102 may also include sensors that monitor their environment or other devices to collect data regarding that environment or those devices, and such network devices 102 may provide data they collect over time. Network devices 102 may also include devices within the internet of things, such as devices within a home automation network. Some of these devices may be referred to as edge devices, and may involve edge-computing circuitry. Data may be transmitted by network devices 102 directly to computing environment 114 or to network-attached data stores, such as network-attached data stores 110 for storage so that the data may be retrieved later by the computing environment 114 or other portions of data transmission network 100. For example, the network devices 102 can transmit data usable for implementing an enhanced power method to a network-attached data store 110 for storage. The computing environment 114 may later retrieve the data from the network-attached data store 110 and use the data to implement an enhanced power method.
Network-attached data stores 110 can store data to be processed by the computing environment 114 as well as any intermediate or final data generated by the computing system in non-volatile memory. But in certain examples, the configuration of the computing environment 114 allows its operations to be performed such that intermediate and final data results can be stored solely in volatile memory (e.g., RAM), without a requirement that intermediate or final data results be stored to non-volatile types of memory (e.g., disk). This can be useful in certain situations, such as when the computing environment 114 receives ad hoc queries from a user and when responses, which are generated by processing large amounts of data, need to be generated dynamically (e.g., on the fly). In this situation, the computing environment 114 may be configured to retain the processed information within memory so that responses can be generated for the user at different levels of detail as well as allow a user to interactively query against this information.
Network-attached data stores 110 may store a variety of different types of data organized in a variety of different ways and from a variety of different sources. For example, network-attached data stores may include storage other than primary storage located within computing environment 114 that is directly accessible by processors located therein. Network-attached data stores may include secondary, tertiary or auxiliary storage, such as large hard drives, servers, virtual memory, among other types. Storage devices may include portable or non-portable storage devices, optical storage devices, and various other mediums capable of storing, containing data. A machine-readable storage medium or computer-readable storage medium may include a non-transitory medium in which data can be stored and that does not include carrier waves or transitory electronic communications. Examples of a non-transitory medium may include, for example, a magnetic disk or tape, optical storage media such as compact disk or digital versatile disk, flash memory, memory or memory devices. A computer-program product may include code or machine-executable instructions that may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, among others. Furthermore, the data stores may hold a variety of different types of data. For example, network-attached data stores 110 may hold unstructured (e.g., raw) data.
The unstructured data may be presented to the computing environment 114 in different forms such as a flat file or a conglomerate of data records, and may have data values and accompanying time stamps. The computing environment 114 may be used to analyze the unstructured data in a variety of ways to determine the best way to structure (e.g., hierarchically) that data, such that the structured data is tailored to a type of further analysis that a user wishes to perform on the data. For example, after being processed, the unstructured time-stamped data may be aggregated by time (e.g., into daily time period units) or structured hierarchically according to one or more dimensions (e.g., parameters, attributes, or variables). For example, data may be stored in a hierarchical data structure, such as a relational online analytical processing (ROLLUP) or multidimensional online analytical processing (MOLAR) database, or may be stored in another tabular form, such as in a flat-hierarchy form.
Data transmission network 100 may also include one or more server farms 106. Computing environment 114 may route select communications or data to the sever farms 106 or one or more servers within the server farms 106. Server farms 106 can be configured to provide information in a predetermined manner. For example, server farms 106 may access data to transmit in response to a communication. Server farms 106 may be separately housed from each other device within data transmission network 100, such as computing environment 114, or may be part of a device or system.
Server farms 106 may host a variety of different types of data processing as part of data transmission network 100. Server farms 106 may receive a variety of different data from network devices, from computing environment 114, from cloud network 116, or from other sources. The data may have been obtained or collected from one or more websites, sensors, as inputs from a control database, or may have been received as inputs from an external system or device. Server farms 106 may assist in processing the data by turning raw data into processed data based on one or more rules implemented by the server farms. For example, sensor data may be analyzed to determine changes in an environment over time or in real-time.
Data transmission network 100 may also include one or more cloud networks 116. Cloud network 116 may include a cloud infrastructure system that provides cloud services. In certain examples, services provided by the cloud network 116 may include a host of services that are made available to users of the cloud infrastructure system on demand. Cloud network 116 is shown in FIG. 1 as being connected to computing environment 114 (and therefore having computing environment 114 as its client or user), but cloud network 116 may be connected to or utilized by any of the devices in FIG. 1. Services provided by the cloud network 116 can dynamically scale to meet the needs of its users. The cloud network 116 may include one or more computers, servers, or systems. In some examples, the computers, servers, or systems that make up the cloud network 116 are different from the user's own on-premises computers, servers, or systems. For example, the cloud network 116 may host an application, and a user may, via a communication network such as the Internet, order and use the application on demand. In some examples, the cloud network 116 may host an application for implementing an enhanced power method.
While each device, server, and system in FIG. 1 is shown as a single device, multiple devices may instead be used. For example, a set of network devices can be used to transmit various communications from a single user, or remote server 140 may include a server stack. As another example, data may be processed as part of computing environment 114.
Each communication within data transmission network 100 (e.g., between client devices, between a device and connection management system 150, between server farms 106 and computing environment 114, or between a server and a device) may occur over one or more networks 108. Networks 108 may include one or more of a variety of different types of networks, including a wireless network, a wired network, or a combination of a wired and wireless network. Examples of suitable networks include the Internet, a personal area network, a local area network (LAN), a wide area network (WAN), or a wireless local area network (WAN). A wireless network may include a wireless interface or combination of wireless interfaces. As an example, a network in the one or more networks 108 may include a short-range communication channel, such as a Bluetooth or a Bluetooth Low Energy channel. A wired network may include a wired interface. The wired or wireless networks may be implemented using routers, access points, bridges, gateways, or the like, to connect devices in the network 108. The networks 108 can be incorporated entirely within or can include an intranet, an extranet, or a combination thereof. In one example, communications between two or more systems or devices can be achieved by a secure communications protocol, such as secure sockets layer (SEL) or transport layer security (TLS). In addition, data or transactional details may be encrypted.
Some aspects may utilize the Internet of Things (Iota), where things (e.g., machines, devices, phones, sensors) can be connected to networks and the data from these things can be collected and processed within the things or external to the things. For example, the Iota can include sensors in many different devices, and high value analytics can be applied to identify hidden relationships and drive increased efficiencies. This can apply to both big data analytics and real-time (e.g., ESP) analytics.
As noted, computing environment 114 may include a communications grid 120 and a transmission network database system 118. Communications grid 120 may be a grid-based computing system for processing large amounts of data. The transmission network database system 118 may be for managing, storing, and retrieving large amounts of data that are distributed to and stored in the one or more network-attached data stores 110 or other data stores that reside at different locations within the transmission network database system 118. The computing nodes in the communications grid 120 and the transmission network database system 118 may share the same processor hardware, such as processors that are located within computing environment 114.
In some examples, the computing environment 114, a network device 102, or both can implement one or more processes for implementing an enhanced power method. For example, the computing environment 114, a network device 102, or both can implement one or more versions of the processes discussed with respect to FIGS. 11-12.
FIG. 2 is an example of devices that can communicate with each other over an exchange system and via a network according to some aspects. As noted, each communication within data transmission network 100 may occur over one or more networks. System 200 includes a network device 204 configured to communicate with a variety of types of client devices, for example client devices 230, over a variety of types of communication channels.
As shown in FIG. 2, network device 204 can transmit a communication over a network (e.g., a cellular network via a base station 210). In some examples, the communication can include times series data. The communication can be routed to another network device, such as network devices 205-209, via base station 210. The communication can also be routed to computing environment 214 via base station 210. In some examples, the network device 204 may collect data either from its surrounding environment or from other network devices (such as network devices 205-209) and transmit that data to computing environment 214.
Although network devices 204-209 are shown in FIG. 2 as a mobile phone, laptop computer, tablet computer, temperature sensor, motion sensor, and audio sensor respectively, the network devices may be or include sensors that are sensitive to detecting aspects of their environment. For example, the network devices may include sensors such as water sensors, power sensors, electrical current sensors, chemical sensors, optical sensors, pressure sensors, geographic or position sensors (e.g., GPS), velocity sensors, acceleration sensors, flow rate sensors, among others. Examples of characteristics that may be sensed include force, torque, load, strain, position, temperature, air pressure, fluid flow, chemical properties, resistance, electromagnetic fields, radiation, irradiance, proximity, acoustics, moisture, distance, speed, vibrations, acceleration, electrical potential, and electrical current, among others. The sensors may be mounted to various components used as part of a variety of different types of systems. The network devices may detect and record data related to the environment that it monitors, and transmit that data to computing environment 214.
The network devices 204-209 may also perform processing on data it collects before transmitting the data to the computing environment 214, or before deciding whether to transmit data to the computing environment 214. For example, network devices 204-209 may determine whether data collected meets certain rules, for example by comparing data or values calculated from the data and comparing that data to one or more thresholds. The network devices 204-209 may use this data or comparisons to determine if the data is to be transmitted to the computing environment 214 for further use or processing. In some examples, the network devices 204-209 can pre-process the data prior to transmitting the data to the computing environment 214. For example, the network devices 204-209 can reformat the data before transmitting the data to the computing environment 214 for further processing (e.g., implementing an enhanced power method).
Computing environment 214 may include machines 220, 240. Although computing environment 214 is shown in FIG. 2 as having two machines 220, 240, computing environment 214 may have only one machine or may have more than two machines. The machines 220, 240 that make up computing environment 214 may include specialized computers, servers, or other machines that are configured to individually or collectively process large amounts of data. The computing environment 214 may also include storage devices that include one or more databases of structured data, such as data organized in one or more hierarchies, or unstructured data. The databases may communicate with the processing devices within computing environment 214 to distribute data to them. Since network devices may transmit data to computing environment 214, that data may be received by the computing environment 214 and subsequently stored within those storage devices. Data used by computing environment 214 may also be stored in data stores 235, which may also be a part of or connected to computing environment 214.
Computing environment 214 can communicate with various devices via one or more routers 225 or other inter-network or intra-network connection components. For example, computing environment 214 may communicate with client devices 230 via one or more routers 225. Computing environment 214 may collect, analyze or store data from or pertaining to communications, client device operations, client rules, or user-associated actions stored at one or more data stores 235. Such data may influence communication routing to the devices within computing environment 214, how data is stored or processed within computing environment 214, among other actions.
Notably, various other devices can further be used to influence communication routing or processing between devices within computing environment 214 and with devices outside of computing environment 214. For example, as shown in FIG. 2, computing environment 214 may include a machine 240 that is a web server. Computing environment 214 can retrieve data of interest, such as client information (e.g., product information, client rules, etc.), technical product details, news, blog posts, e-mails, forum posts, electronic documents, social media posts (e.g., TwitterTM posts or FacebookTM posts), time series data, and so on.
In addition to computing environment 214 collecting data (e.g., as received from network devices, such as sensors, and client devices or other sources) to be processed as part of a big data analytics project, it may also receive data in real time as part of a streaming analytics environment. As noted, data may be collected using a variety of sources as communicated via different kinds of networks or locally. Such data may be received on a real-time streaming basis. For example, network devices 204-209 may receive data periodically and in real time from a web server or other source. Devices within computing environment 214 may also perform pre-analysis on data it receives to determine if the data received should be processed as part of an ongoing project. For example, as part of a project in which an enhanced power method is to be implemented, the computing environment 214 can perform a pre-analysis of the data. The pre-analysis can include determining whether the data is in a correct format for performing an enhanced power method using the data and, if not, reformatting the data into the correct format.
FIG. 3 is a block diagram of a model of an example of a communications protocol system according to some aspects. More specifically, FIG. 3 identifies operation of a computing environment in an Open Systems Interaction model that corresponds to various connection components. The model 300 shows, for example, how a computing environment, such as computing environment (or computing environment 214 in FIG. 2) may communicate with other devices in its network, and control how communications between the computing environment and other devices are executed and under what conditions.
The model 300 can include layers 302-314. The layers 302-314 are arranged in a stack. Each layer in the stack serves the layer one level higher than it (except for the application layer, which is the highest layer), and is served by the layer one level below it (except for the physical layer 302, which is the lowest layer). The physical layer 302 is the lowest layer because it receives and transmits raw bites of data, and is the farthest layer from the user in a communications system. On the other hand, the application layer is the highest layer because it interacts directly with a software application.
As noted, the model 300 includes a physical layer 302. Physical layer 302 represents physical communication, and can define parameters of that physical communication. For example, such physical communication may come in the form of electrical, optical, or electromagnetic communications. Physical layer 302 also defines protocols that may control communications within a data transmission network.
Link layer 304 defines links and mechanisms used to transmit (e.g., move) data across a network. The link layer manages node-to-node communications, such as within a grid-computing environment. Link layer 304 can detect and correct errors (e.g., transmission errors in the physical layer 302). Link layer 304 can also include a media access control (MAC) layer and logical link control (LLC) layer.
Network layer 306 can define the protocol for routing within a network. In other words, the network layer coordinates transferring data across nodes in a same network (e.g., such as a grid-computing environment). Network layer 306 can also define the processes used to structure local addressing within the network.
Transport layer 308 can manage the transmission of data and the quality of the transmission or receipt of that data. Transport layer 308 can provide a protocol for transferring data, such as, for example, a Transmission Control Protocol (TCP). Transport layer 308 can assemble and disassemble data frames for transmission. The transport layer can also detect transmission errors occurring in the layers below it.
Session layer 310 can establish, maintain, and manage communication connections between devices on a network. In other words, the session layer controls the dialogues or nature of communications between network devices on the network. The session layer may also establish check pointing, adjournment, termination, and restart procedures.
Presentation layer 312 can provide translation for communications between the application and network layers. In other words, this layer may encrypt, decrypt or format data based on data types known to be accepted by an application or network layer.
Application layer 314 interacts directly with software applications and end users, and manages communications between them. Application layer 314 can identify destinations, local resource states or availability or communication content or formatting using the applications.
For example, a communication link can be established between two devices on a network. One device can transmit an analog or digital representation of an electronic message that includes a data set to the other device. The other device can receive the analog or digital representation at the physical layer 302. The other device can transmit the data associated with the electronic message through the remaining layers 304-314. The application layer 314 can receive data associated with the electronic message. The application layer 314 can identify one or more applications, such as an application for implementing an enhanced power method, to which to transmit data associated with the electronic message. The application layer 314 can transmit the data to the identified application.
Intra-network connection components 322, 324 can operate in lower levels, such as physical layer 302 and link layer 304, respectively. For example, a hub can operate in the physical layer, a switch can operate in the physical layer, and a router can operate in the network layer. Inter-network connection components 326, 328 are shown to operate on higher levels, such as layers 306-314. For example, routers can operate in the network layer and network devices can operate in the transport, session, presentation, and application layers.
A computing environment 330 can interact with or operate on, in various examples, one, more, all or any of the various layers. For example, computing environment 330 can interact with a hub (e.g., via the link layer) to adjust which devices the hub communicates with. The physical layer 302 may be served by the link layer 304, so it may implement such data from the link layer 304. For example, the computing environment 330 may control which devices from which it can receive data. For example, if the computing environment 330 knows that a certain network device has turned off, broken, or otherwise become unavailable or unreliable, the computing environment 330 may instruct the hub to prevent any data from being transmitted to the computing environment 330 from that network device. Such a process may be beneficial to avoid receiving data that is inaccurate or that has been influenced by an uncontrolled environment. As another example, computing environment 330 can communicate with a bridge, switch, router or gateway and influence which device within the system (e.g., system 200) the component selects as a destination. In some examples, computing environment 330 can interact with various layers by exchanging communications with equipment operating on a particular layer by routing or modifying existing communications. In another example, such as in a grid-computing environment, a node may determine how data within the environment should be routed (e.g., which node should receive certain data) based on certain parameters or information provided by other layers within the model.
The computing environment 330 may be a part of a communications grid environment, the communications of which may be implemented as shown in the protocol of FIG. 3. For example, referring back to FIG. 2, one or more of machines 220 and 240 may be part of a communications grid-computing environment. A gridded computing environment may be employed in a distributed system with non-interactive workloads where data resides in memory on the machines, or compute nodes. In such an environment, analytic code, instead of a database management system, can control the processing performed by the nodes. Data is co-located by pre-distributing it to the grid nodes, and the analytic code on each node loads the local data into memory. Each node may be assigned a particular task, such as a portion of a processing project, or to organize or control other nodes within the grid. For example, each node may be assigned a portion of a processing task for implementing an enhanced power method.
FIG. 4 is a hierarchical diagram of an example of a communications grid computing system 400 including a variety of control and worker nodes according to some aspects. Communications grid computing system 400 includes three control nodes and one or more worker nodes. Communications grid computing system 400 includes control nodes 402, 404, and 406. The control nodes are communicatively connected via communication paths 451, 453, and 455. The control nodes 402-406 may transmit information (e.g., related to the communications grid or notifications) to and receive information from each other. Although communications grid computing system 400 is shown in FIG. 4 as including three control nodes, the communications grid may include more or less than three control nodes.
Communications grid computing system 400 (which can be referred to as a “communications grid”) also includes one or more worker nodes. Shown in FIG. 4 are six worker nodes 410-420. Although FIG. 4 shows six worker nodes, a communications grid can include more or less than six worker nodes. The number of worker nodes included in a communications grid may be dependent upon how large the project or data set is being processed by the communications grid, the capacity of each worker node, the time designated for the communications grid to complete the project, among others. Each worker node within the communications grid computing system 400 may be connected (wired or wirelessly, and directly or indirectly) to control nodes 402-406. Each worker node may receive information from the control nodes (e.g., an instruction to perform work on a project) and may transmit information to the control nodes (e.g., a result from work performed on a project). Furthermore, worker nodes may communicate with each other directly or indirectly. For example, worker nodes may transmit data between each other related to a job being performed or an individual task within a job being performed by that worker node. In some examples, worker nodes may not be connected (communicatively or otherwise) to certain other worker nodes. For example, a worker node 410 may only be able to communicate with a particular control node 402. The worker node 410 may be unable to communicate with other worker nodes 412-420 in the communications grid, even if the other worker nodes 412-420 are controlled by the same control node 402.
A control node 402-406 may connect with an external device with which the control node 402-406 may communicate (e.g., a communications grid user, such as a server or computer, may connect to a controller of the grid). For example, a server or computer may connect to control nodes 402-406 and may transmit a project or job to the node, such as a project or job related to (or including) implementing an enhanced power method. The project may include a data set. The data set may be of any size. Once the control node 402-406 receives such a project including a large data set, the control node may distribute the data set or projects related to the data set to be performed by worker nodes. Alternatively, for a project including a large data set, the data set may be receive or stored by a machine other than a control node 402-406 (e.g., a Hadoop data node).
Control nodes 402-406 can maintain knowledge of the status of the nodes in the grid (e.g., grid status information), accept work requests from clients, subdivide the work across worker nodes, and coordinate the worker nodes, among other responsibilities. Worker nodes 412-420 may accept work requests from a control node 402-406 and provide the control node with results of the work performed by the worker node. A grid may be started from a single node (e.g., a machine, computer, server, etc.). This first node may be assigned or may start as the primary control node 402 that will control any additional nodes that enter the grid.
When a project is submitted for execution (e.g., by a client or a controller of the grid) it may be assigned to a set of nodes. After the nodes are assigned to a project, a data structure (e.g., a communicator) may be created. The communicator may be used by the project for information to be shared between the project code running on each node. A communication handle may be created on each node. A handle, for example, is a reference to the communicator that is valid within a single process on a single node, and the handle may be used when requesting communications between nodes.
A control node, such as control node 402, may be designated as the primary control node. A server, computer or other external device may connect to the primary control node. Once the control node 402 receives a project, the primary control node may distribute portions of the project to its worker nodes for execution. For example, a project for predicting future interest in an object can be initiated on communications grid computing system 400. A primary control node can control the work to be performed for the project in order to complete the project as requested or instructed. The primary control node may distribute work to the worker nodes 412-420 based on various factors, such as which subsets or portions of projects may be completed most efficiently and in the correct amount of time. For example, a worker node 412 may perform an enhanced power method using at least a portion of data that is already local (e.g., stored on) the worker node. The primary control node also coordinates and processes the results of the work performed by each worker node 412-420 after each worker node 412-420 executes and completes its job. For example, the primary control node may receive a result from one or more worker nodes 412-420, and the primary control node may organize (e.g., collect and assemble) the results received and compile them to produce a complete result for the project received from the end user.
Any remaining control nodes, such as control nodes 404, 406, may be assigned as backup control nodes for the project. In an example, backup control nodes may not control any portion of the project. Instead, backup control nodes may serve as a backup for the primary control node and take over as primary control node if the primary control node were to fail. If a communications grid were to include only a single control node 402, and the control node 402 were to fail (e.g., the control node is shut off or breaks) then the communications grid as a whole may fail and any project or job being run on the communications grid may fail and may not complete. While the project may be run again, such a failure may cause a delay (severe delay in some cases, such as overnight delay) in completion of the project. Therefore, a grid with multiple control nodes 402-406, including a backup control node, may be beneficial.
In some examples, the primary control node may open a pair of listening sockets to add another node or machine to the grid. A socket may be used to accept work requests from clients, and the second socket may be used to accept connections from other grid nodes. The primary control node may be provided with a list of other nodes (e.g., other machines, computers, servers, etc.) that can participate in the grid, and the role that each node can fill in the grid. Upon startup of the primary control node (e.g., the first node on the grid), the primary control node may use a network protocol to start the server process on every other node in the grid. Command line parameters, for example, may inform each node of one or more pieces of information, such as: the role that the node will have in the grid, the host name of the primary control node, the port number on which the primary control node is accepting connections from peer nodes, among others. The information may also be provided in a configuration file, transmitted over a secure shell tunnel, recovered from a configuration server, among others. While the other machines in the grid may not initially know about the configuration of the grid, that information may also be sent to each other node by the primary control node. Updates of the grid information may also be subsequently sent to those nodes.
For any control node other than the primary control node added to the grid, the control node may open three sockets. The first socket may accept work requests from clients, the second socket may accept connections from other grid members, and the third socket may connect (e.g., permanently) to the primary control node. When a control node (e.g., primary control node) receives a connection from another control node, it first checks to see if the peer node is in the list of configured nodes in the grid. If it is not on the list, the control node may clear the connection. If it is on the list, it may then attempt to authenticate the connection. If authentication is successful, the authenticating node may transmit information to its peer, such as the port number on which a node is listening for connections, the host name of the node, information about how to authenticate the node, among other information. When a node, such as the new control node, receives information about another active node, it can check to see if it already has a connection to that other node. If it does not have a connection to that node, it may then establish a connection to that control node.
Any worker node added to the grid may establish a connection to the primary control node and any other control nodes on the grid. After establishing the connection, it may authenticate itself to the grid (e.g., any control nodes, including both primary and backup, or a server or user controlling the grid). After successful authentication, the worker node may accept configuration information from the control node.
When a node joins a communications grid (e.g., when the node is powered on or connected to an existing node on the grid or both), the node is assigned (e.g., by an operating system of the grid) a universally unique identifier (UUID). This unique identifier may help other nodes and external entities (devices, users, etc.) to identify the node and distinguish it from other nodes. When a node is connected to the grid, the node may share its unique identifier with the other nodes in the grid. Since each node may share its unique identifier, each node may know the unique identifier of every other node on the grid. Unique identifiers may also designate a hierarchy of each of the nodes (e.g., backup control nodes) within the grid. For example, the unique identifiers of each of the backup control nodes may be stored in a list of backup control nodes to indicate an order in which the backup control nodes will take over for a failed primary control node to become a new primary control node. But, a hierarchy of nodes may also be determined using methods other than using the unique identifiers of the nodes. For example, the hierarchy may be predetermined, or may be assigned based on other predetermined factors.
The grid may add new machines at any time (e.g., initiated from any control node). Upon adding a new node to the grid, the control node may first add the new node to its table of grid nodes. The control node may also then notify every other control node about the new node. The nodes receiving the notification may acknowledge that they have updated their configuration information.
Primary control node 402 may, for example, transmit one or more communications to backup control nodes 404, 406 (and, for example, to other control or worker nodes 412-420 within the communications grid). Such communications may be sent periodically, at fixed time intervals, between known fixed stages of the project's execution, among other protocols. The communications transmitted by primary control node 402 may be of varied types and may include a variety of types of information. For example, primary control node 402 may transmit snapshots (e.g., status information) of the communications grid so that backup control node 404 always has a recent snapshot of the communications grid. The snapshot or grid status may include, for example, the structure of the grid (including, for example, the worker nodes 410-420 in the communications grid, unique identifiers of the worker nodes 410-420, or their relationships with the primary control node 402) and the status of a project (including, for example, the status of each worker node's portion of the project). The snapshot may also include analysis or results received from worker nodes 410-420 in the communications grid. The backup control nodes 404, 406 may receive and store the backup data received from the primary control node 402. The backup control nodes 404, 406 may transmit a request for such a snapshot (or other information) from the primary control node 402, or the primary control node 402 may send such information periodically to the backup control nodes 404, 406.
As noted, the backup data may allow a backup control node 404, 406 to take over as primary control node if the primary control node 402 fails without requiring the communications grid to start the project over from scratch. If the primary control node 402 fails, the backup control node 404, 406 that will take over as primary control node may retrieve the most recent version of the snapshot received from the primary control node 402 and use the snapshot to continue the project from the stage of the project indicated by the backup data. This may prevent failure of the project as a whole.
A backup control node 404, 406 may use various methods to determine that the primary control node 402 has failed. In one example of such a method, the primary control node 402 may transmit (e.g., periodically) a communication to the backup control node 404, 406 that indicates that the primary control node 402 is working and has not failed, such as a heartbeat communication. The backup control node 404, 406 may determine that the primary control node 402 has failed if the backup control node has not received a heartbeat communication for a certain predetermined period of time. Alternatively, a backup control node 404, 406 may also receive a communication from the primary control node 402 itself (before it failed) or from a worker node 410-420 that the primary control node 402 has failed, for example because the primary control node 402 has failed to communicate with the worker node 410-420.
Different methods may be performed to determine which backup control node of a set of backup control nodes (e.g., backup control nodes 404, 406) can take over for failed primary control node 402 and become the new primary control node. For example, the new primary control node may be chosen based on a ranking or “hierarchy” of backup control nodes based on their unique identifiers. In an alternative example, a backup control node may be assigned to be the new primary control node by another device in the communications grid or from an external device (e.g., a system infrastructure or an end user, such as a server or computer, controlling the communications grid). In another alternative example, the backup control node that takes over as the new primary control node may be designated based on bandwidth or other statistics about the communications grid.
A worker node within the communications grid may also fail. If a worker node fails, work being performed by the failed worker node may be redistributed amongst the operational worker nodes. In an alternative example, the primary control node may transmit a communication to each of the operable worker nodes still on the communications grid that each of the worker nodes should purposefully fail also. After each of the worker nodes fail, they may each retrieve their most recent saved checkpoint of their status and re-start the project from that checkpoint to minimize lost progress on the project being executed. In some examples, a communications grid computing system 400 can be used to perform an enhanced power method.
FIG. 5 is a flow chart of an example of a process for adjusting a communications grid or a work project in a communications grid after a failure of a node according to some aspects. The process may include, for example, receiving grid status information including a project status of a portion of a project being executed by a node in the communications grid, as described in operation 502. For example, a control node (e.g., a backup control node connected to a primary control node and a worker node on a communications grid) may receive grid status information, where the grid status information includes a project status of the primary control node or a project status of the worker node. The project status of the primary control node and the project status of the worker node may include a status of one or more portions of a project being executed by the primary and worker nodes in the communications grid. The process may also include storing the grid status information, as described in operation 504. For example, a control node (e.g., a backup control node) may store the received grid status information locally within the control node. Alternatively, the grid status information may be sent to another device for storage where the control node may have access to the information.
The process may also include receiving a failure communication corresponding to a node in the communications grid in operation 506. For example, a node may receive a failure communication including an indication that the primary control node has failed, prompting a backup control node to take over for the primary control node. In an alternative embodiment, a node may receive a failure that a worker node has failed, prompting a control node to reassign the work being performed by the worker node. The process may also include reassigning a node or a portion of the project being executed by the failed node, as described in operation 508. For example, a control node may designate the backup control node as a new primary control node based on the failure communication upon receiving the failure communication. If the failed node is a worker node, a control node may identify a project status of the failed worker node using the snapshot of the communications grid, where the project status of the failed worker node includes a status of a portion of the project being executed by the failed worker node at the failure time.
The process may also include receiving updated grid status information based on the reassignment, as described in operation 510, and transmitting a set of instructions based on the updated grid status information to one or more nodes in the communications grid, as described in operation 512. The updated grid status information may include an updated project status of the primary control node or an updated project status of the worker node. The updated information may be transmitted to the other nodes in the grid to update their stale stored information.
FIG. 6 is a block diagram of a portion of a communications grid computing system 600 including a control node and a worker node according to some aspects. Communications grid 600 computing system includes one control node (control node 602) and one worker node (worker node 610) for purposes of illustration, but may include more worker and/or control nodes. The control node 602 is communicatively connected to worker node 610 via communication path 650. Therefore, control node 602 may transmit information (e.g., related to the communications grid or notifications), to and receive information from worker node 610 via communication path 650.
Similar to in FIG. 4, communications grid computing system (or just “communications grid”) 600 includes data processing nodes (control node 602 and worker node 610). Nodes 602 and 610 comprise multi-core data processors. Each node 602 and 610 includes a grid-enabled software component (GESC) 620 that executes on the data processor associated with that node and interfaces with buffer memory 622 also associated with that node. Each node 602 and 610 includes a database management software (DBMS) 628 that executes on a database server (not shown) at control node 602 and on a database server (not shown) at worker node 610.
Each node also includes a data store 624. Data stores 624, similar to network-attached data stores 110 in FIG. 1 and data stores 235 in FIG. 2, are used to store data to be processed by the nodes in the computing environment. Data stores 624 may also store any intermediate or final data generated by the computing system after being processed, for example in non-volatile memory. However in certain examples, the configuration of the grid computing environment allows its operations to be performed such that intermediate and final data results can be stored solely in volatile memory (e.g., RAM), without a requirement that intermediate or final data results be stored to non-volatile types of memory. Storing such data in volatile memory may be useful in certain situations, such as when the grid receives queries (e.g., ad hoc) from a client and when responses, which are generated by processing large amounts of data, need to be generated quickly or on-the-fly. In such a situation, the grid may be configured to retain the data within memory so that responses can be generated at different levels of detail and so that a client may interactively query against this information.
Each node also includes a user-defined function (UDF) 626. The UDF provides a mechanism for the DMBS 628 to transfer data to or receive data from the database stored in the data stores 624 that are managed by the DBMS. For example, UDF 626 can be invoked by the DBMS to provide data to the GESC for processing. The UDF 626 may establish a socket connection (not shown) with the GESC to transfer the data. Alternatively, the UDF 626 can transfer data to the GESC by writing data to shared memory accessible by both the UDF and the GESC.
The GESC 620 at the nodes 602 and 610 may be connected via a network, such as network 108 shown in FIG. 1. Therefore, nodes 602 and 610 can communicate with each other via the network using a predetermined communication protocol such as, for example, the Message Passing Interface (MPI). Each GESC 620 can engage in point-to-point communication with the GESC at another node or in collective communication with multiple GESCs via the network. The GESC 620 at each node may contain identical (or nearly identical) software instructions. Each node may be capable of operating as either a control node or a worker node. The GESC at the control node 602 can communicate, over a communication path 652, with a client device 630. More specifically, control node 602 may communicate with client application 632 hosted by the client device 630 to receive queries and to respond to those queries after processing large amounts of data.
DMBS 628 may control the creation, maintenance, and use of database or data structure (not shown) within nodes 602 or 610. The database may organize data stored in data stores 624. The DMBS 628 at control node 602 may accept requests for data and transfer the appropriate data for the request. With such a process, collections of data may be distributed across multiple physical locations. In this example, each node 602 and 610 stores a portion of the total data managed by the management system in its associated data store 624.
Furthermore, the DBMS may be responsible for protecting against data loss using replication techniques. Replication includes providing a backup copy of data stored on one node on one or more other nodes. Therefore, if one node fails, the data from the failed node can be recovered from a replicated copy residing at another node. However, as described herein with respect to FIG. 4, data or status information for each node in the communications grid may also be shared with each node on the grid.
FIG. 7 is a flow chart of an example of a process for executing a data analysis or a processing project according to some aspects. As described with respect to FIG. 6, the GESC at the control node may transmit data with a client device (e.g., client device 630) to receive queries for executing a project and to respond to those queries after large amounts of data have been processed. The query may be transmitted to the control node, where the query may include a request for executing a project, as described in operation 702. The query can contain instructions on the type of data analysis to be performed in the project and whether the project should be executed using the grid-based computing environment, as shown in operation 704.
To initiate the project, the control node may determine if the query requests use of the grid-based computing environment to execute the project. If the determination is no, then the control node initiates execution of the project in a solo environment (e.g., at the control node), as described in operation 710. If the determination is yes, the control node may initiate execution of the project in the grid-based computing environment, as described in operation 706. In such a situation, the request may include a requested configuration of the grid. For example, the request may include a number of control nodes and a number of worker nodes to be used in the grid when executing the project. After the project has been completed, the control node may transmit results of the analysis yielded by the grid, as described in operation 708. Whether the project is executed in a solo or grid-based environment, the control node provides the results of the project.
As noted with respect to FIG. 2, the computing environments described herein may collect data (e.g., as received from network devices, such as sensors, such as network devices 204-209 in FIG. 2, and client devices or other sources) to be processed as part of a data analytics project, and data may be received in real time as part of a streaming analytics environment (e.g., ESP). Data may be collected using a variety of sources as communicated via different kinds of networks or locally, such as on a real-time streaming basis. For example, network devices may receive data periodically from network device sensors as the sensors continuously sense, monitor and track changes in their environments. More specifically, an increasing number of distributed applications develop or produce continuously flowing data from distributed sources by applying queries to the data before distributing the data to geographically distributed recipients. An event stream processing engine (ESPE) may continuously apply the queries to the data as it is received and determines which entities should receive the data. Client or other devices may also subscribe to the ESPE or other devices processing ESP data so that they can receive data after processing, based on for example the entities determined by the processing engine. For example, client devices 230 in FIG. 2 may subscribe to the ESPE in computing environment 214. In another example, event subscription devices 1024a-c, described further with respect to FIG. 10, may also subscribe to the ESPE. The ESPE may determine or define how input data or event streams from network devices or other publishers (e.g., network devices 204-209 in FIG. 2) are transformed into meaningful output data to be consumed by subscribers, such as for example client devices 230 in FIG. 2.
FIG. 8 is a block diagram including components of an Event Stream Processing Engine (ESPE) according to some aspects. ESPE 800 may include one or more projects 802. A project may be described as a second-level container in an engine model managed by ESPE 800 where a thread pool size for the project may be defined by a user. Each project of the one or more projects 802 may include one or more continuous queries 804 that contain data flows, which are data transformations of incoming event streams. The one or more continuous queries 804 may include one or more source windows 806 and one or more derived windows 808.
The ESPE may receive streaming data over a period of time related to certain events, such as events or other data sensed by one or more network devices. The ESPE may perform operations associated with processing data created by the one or more devices. For example, the ESPE may receive data from the one or more network devices 204-209 shown in FIG. 2. As noted, the network devices may include sensors that sense different aspects of their environments, and may collect data over time based on those sensed observations. For example, the ESPE may be implemented within one or more of machines 220 and 240 shown in FIG. 2. The ESPE may be implemented within such a machine by an ESP application. An ESP application may embed an ESPE with its own dedicated thread pool or pools into its application space where the main application thread can do application-specific work and the ESPE processes event streams at least by creating an instance of a model into processing objects.
The engine container is the top-level container in a model that manages the resources of the one or more projects 802. In an illustrative example, there may be only one ESPE 800 for each instance of the ESP application, and ESPE 800 may have a unique engine name. Additionally, the one or more projects 802 may each have unique project names, and each query may have a unique continuous query name and begin with a uniquely named source window of the one or more source windows 806. ESPE 800 may or may not be persistent.
Continuous query modeling involves defining directed graphs of windows for event stream manipulation and transformation. A window in the context of event stream manipulation and transformation is a processing node in an event stream processing model. A window in a continuous query can perform aggregations, computations, pattern-matching, and other operations on data flowing through the window. A continuous query may be described as a directed graph of source, relational, pattern matching, and procedural windows. The one or more source windows 806 and the one or more derived windows 808 represent continuously executing queries that generate updates to a query result set as new event blocks stream through ESPE 800. A directed graph, for example, is a set of nodes connected by edges, where the edges have a direction associated with them.
An event object may be described as a packet of data accessible as a collection of fields, with at least one of the fields defined as a key or unique identifier (ID). The event object may be created using a variety of formats including binary, alphanumeric, XML, etc. Each event object may include one or more fields designated as a primary identifier (ID) for the event so ESPE 800 can support operation codes (opcodes) for events including insert, update, upsert, and delete. Upsert opcodes update the event if the key field already exists; otherwise, the event is inserted. For illustration, an event object may be a packed binary representation of a set of field values and include both metadata and field data associated with an event. The metadata may include an opcode indicating if the event represents an insert, update, delete, or upsert, a set of flags indicating if the event is a normal, partial-update, or a retention generated event from retention policy management, and a set of microsecond timestamps that can be used for latency measurements.
An event block object may be described as a grouping or package of event objects. An event stream may be described as a flow of event block objects. A continuous query of the one or more continuous queries 804 transforms a source event stream made up of streaming event block objects published into ESPE 800 into one or more output event streams using the one or more source windows 806 and the one or more derived windows 808. A continuous query can also be thought of as data flow modeling.
The one or more source windows 806 are at the top of the directed graph and have no windows feeding into them. Event streams are published into the one or more source windows 806, and from there, the event streams may be directed to the next set of connected windows as defined by the directed graph. The one or more derived windows 808 are all instantiated windows that are not source windows and that have other windows streaming events into them. The one or more derived windows 808 may perform computations or transformations on the incoming event streams. The one or more derived windows 808 transform event streams based on the window type (that is operators such as join, filter, compute, aggregate, copy, pattern match, procedural, union, etc.) and window settings. As event streams are published into ESPE 800, they are continuously queried, and the resulting sets of derived windows in these queries are continuously updated.
FIG. 9 is a flow chart of an example of a process including operations performed by an event stream processing engine according to some aspects. As noted, the ESPE 800 (or an associated ESP application) defines how input event streams are transformed into meaningful output event streams. More specifically, the ESP application may define how input event streams from publishers (e.g., network devices providing sensed data) are transformed into meaningful output event streams consumed by subscribers (e.g., a data analytics project being executed by a machine or set of machines).
Within the application, a user may interact with one or more user interface windows presented to the user in a display under control of the ESPE independently or through a browser application in an order selectable by the user. For example, a user may execute an ESP application, which causes presentation of a first user interface window, which may include a plurality of menus and selectors such as drop down menus, buttons, text boxes, hyperlinks, etc. associated with the ESP application as understood by a person of skill in the art. Various operations may be performed in parallel, for example, using a plurality of threads.
At operation 900, an ESP application may define and start an ESPE, thereby instantiating an ESPE at a device, such as machine 220 and/or 240. In an operation 902, the engine container is created. For illustration, ESPE 800 may be instantiated using a function call that specifies the engine container as a manager for the model.
In an operation 904, the one or more continuous queries 804 are instantiated by ESPE 800 as a model. The one or more continuous queries 804 may be instantiated with a dedicated thread pool or pools that generate updates as new events stream through ESPE 800. For illustration, the one or more continuous queries 804 may be created to model business processing logic within ESPE 800, to predict events within ESPE 800, to model a physical system within ESPE 800, to predict the physical system state within ESPE 800, etc. For example, as noted, ESPE 800 may be used to support sensor data monitoring and management (e.g., sensing may include force, torque, load, strain, position, temperature, air pressure, fluid flow, chemical properties, resistance, electromagnetic fields, radiation, irradiance, proximity, acoustics, moisture, distance, speed, vibrations, acceleration, electrical potential, or electrical current, etc.).
ESPE 800 may analyze and process events in motion or “event streams.” Instead of storing data and running queries against the stored data, ESPE 800 may store queries and stream data through them to allow continuous analysis of data as it is received. The one or more source windows 806 and the one or more derived windows 808 may be created based on the relational, pattern matching, and procedural algorithms that transform the input event streams into the output event streams to model, simulate, score, test, predict, etc. based on the continuous query model defined and application to the streamed data.
In an operation 906, a publish/subscribe (pub/sub) capability is initialized for ESPE 800. In an illustrative embodiment, a pub/sub capability is initialized for each project of the one or more projects 802. To initialize and enable pub/sub capability for ESPE 800, a port number may be provided. Pub/sub clients can use a host name of an ESP device running the ESPE and the port number to establish pub/sub connections to ESPE 800.
FIG. 10 is a block diagram of an ESP system 1000 interfacing between publishing device 1022 and event subscribing devices 1024a-c according to some aspects. ESP system 1000 may include ESP device or subsystem 1001, publishing device 1022, an event subscribing device A 1024a, an event subscribing device B 1024b, and an event subscribing device C 1024c. Input event streams are output to ESP device 1001 by publishing device 1022. In alternative embodiments, the input event streams may be created by a plurality of publishing devices. The plurality of publishing devices further may publish event streams to other ESP devices. The one or more continuous queries instantiated by ESPE 800 may analyze and process the input event streams to form output event streams output to event subscribing device A 1024a, event subscribing device B 1024b, and event subscribing device C 1024c. ESP system 1000 may include a greater or a fewer number of event subscribing devices of event subscribing devices.
Publish-subscribe is a message-oriented interaction paradigm based on indirect addressing. Processed data recipients specify their interest in receiving information from ESPE 800 by subscribing to specific classes of events, while information sources publish events to ESPE 800 without directly addressing the receiving parties. ESPE 800 coordinates the interactions and processes the data. In some cases, the data source receives confirmation that the published information has been received by a data recipient.
A publish/subscribe API may be described as a library that enables an event publisher, such as publishing device 1022, to publish event streams into ESPE 800 or an event subscriber, such as event subscribing device A 1024a, event subscribing device B 1024b, and event subscribing device C 1024c, to subscribe to event streams from ESPE 800. For illustration, one or more publish/subscribe APIs may be defined. Using the publish/subscribe API, an event publishing application may publish event streams into a running event stream processor project source window of ESPE 800, and the event subscription application may subscribe to an event stream processor project source window of ESPE 800.
The publish/subscribe API provides cross-platform connectivity and endianness compatibility between ESP application and other networked applications, such as event publishing applications instantiated at publishing device 1022, and event subscription applications instantiated at one or more of event subscribing device A 1024a, event subscribing device B 1024b, and event subscribing device C 1024c. 
Referring back to FIG. 9, operation 906 initializes the publish/subscribe capability of ESPE 800. In an operation 908, the one or more projects 802 are started. The one or more started projects may run in the background on an ESP device. In an operation 910, an event block object is received from one or more computing device of the publishing device 1022.
ESP subsystem 800 may include a publishing client 1002, ESPE 800, a subscribing client A 1004, a subscribing client B 1006, and a subscribing client C 1008. Publishing client 1002 may be started by an event publishing application executing at publishing device 1022 using the publish/subscribe API. Subscribing client A 1004 may be started by an event subscription application A, executing at event subscribing device A 1024a using the publish/subscribe API. Subscribing client B 1006 may be started by an event subscription application B executing at event subscribing device B 1024b using the publish/subscribe API. Subscribing client C 1008 may be started by an event subscription application C executing at event subscribing device C 1024c using the publish/subscribe API.
An event block object containing one or more event objects is injected into a source window of the one or more source windows 806 from an instance of an event publishing application on publishing device 1022. The event block object may generated, for example, by the event publishing application and may be received by publishing client 1002. A unique ID may be maintained as the event block object is passed between the one or more source windows 806 and/or the one or more derived windows 808 of ESPE 800, and to subscribing client A 1004, subscribing client B 806, and subscribing client C 808 and to event subscription device A 1024a, event subscription device B 1024b, and event subscription device C 1024c. Publishing client 1002 may further generate and include a unique embedded transaction ID in the event block object as the event block object is processed by a continuous query, as well as the unique ID that publishing device 1022 assigned to the event block object.
In an operation 912, the event block object is processed through the one or more continuous queries 804. In an operation 914, the processed event block object is output to one or more computing devices of the event subscribing devices 1024a-c. For example, subscribing client A 804, subscribing client B 806, and subscribing client C 808 may send the received event block object to event subscription device A 1024a, event subscription device B 1024b, and event subscription device C 1024c, respectively.
ESPE 800 maintains the event block containership aspect of the received event blocks from when the event block is published into a source window and works its way through the directed graph defined by the one or more continuous queries 804 with the various event translations before being output to subscribers. Subscribers can correlate a group of subscribed events back to a group of published events by comparing the unique ID of the event block object that a publisher, such as publishing device 1022, attached to the event block object with the event block ID received by the subscriber.
In an operation 916, a determination is made concerning whether or not processing is stopped. If processing is not stopped, processing continues in operation 910 to continue receiving the one or more event streams containing event block objects from the, for example, one or more network devices. If processing is stopped, processing continues in an operation 918. In operation 918, the started projects are stopped. In operation 920, the ESPE is shutdown.
As noted, in some examples, big data is processed for an analytics project after the data is received and stored. In other examples, distributed applications process continuously flowing data in real-time from distributed sources by applying queries to the data before distributing the data to geographically distributed recipients. As noted, an event stream processing engine (ESPE) may continuously apply the queries to the data as it is received and determines which entities receive the processed data. This allows for large amounts of data being received and/or collected in a variety of environments to be processed and distributed in real time. For example, as shown with respect to FIG. 2, data may be collected from network devices that may include devices within the internet of things, such as devices within a home automation network. However, such data may be collected from a variety of different resources in a variety of different environments. In any such situation, embodiments of the present technology allow for real-time processing of such data.
Aspects of the present disclosure provide technical solutions to technical problems, such as computing problems that arise when an ESP device fails which results in a complete service interruption and potentially significant data loss. The data loss can be catastrophic when the streamed data is supporting mission critical operations, such as those in support of an ongoing manufacturing or drilling operation. An example of an ESP system achieves a rapid and seamless failover of ESPE running at the plurality of ESP devices without service interruption or data loss, thus significantly improving the reliability of an operational system that relies on the live or real-time processing of the data streams. The event publishing systems, the event subscribing systems, and each ESPE not executing at a failed ESP device are not aware of or effected by the failed ESP device. The ESP system may include thousands of event publishing systems and event subscribing systems. The ESP system keeps the failover logic and awareness within the boundaries of out-messaging network connector and out-messaging network device.
In one example embodiment, a system is provided to support a failover when event stream processing (ESP) event blocks. The system includes, but is not limited to, an out-messaging network device and a computing device. The computing device includes, but is not limited to, a processor and a computer-readable medium operably coupled to the processor. The processor is configured to execute an ESP engine (ESPE). The computer-readable medium has instructions stored thereon that, when executed by the processor, cause the computing device to support the failover. An event block object is received from the ESPE that includes a unique identifier. 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 status 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. When the second status of the computing device is not newly active, the received event block object is published to the out-messaging network device. When the first status of the computing device is standby, the received event block object is stored in the non-transitory computer-readable medium.
FIG. 11 is a flow chart of an example of a process for enhancing a power method on an electronic device according to some aspects. Some examples can include more, fewer, or different steps than the steps depicted in FIG. 11. Also, some examples can implement the steps of the process in a different order. Some examples can be implemented using any of the systems and processes described with respect to FIGS. 1-10.
In block 1102, a processor receives an electronic communication associated with a job. The processor can receive at least a portion of the electronic communication from a local source, such as a user input device (e.g., a keyboard, mouse, touch-screen, etc.); a remote source, such as a remote computing device (e.g., a node, such as a worker node or control node discussed with respect to FIG. 4); or both of these.
In some examples, the job can be associated with ranking documents or links (e.g., to be output by a search engine), generating recommended content (e.g., songs, images, video content, articles, publications, websites, news stories, etc.) to be provided to a user, or any combination of these. For example, the processor can form at least a portion of a computing environment for a search engine. The search engine may receive a query and provide results based on the query. The results can include documents, websites, links, or any combination of these that are ordered in a particular sequence. In such an example, the job can include determining the particular sequence in which to order the documents, websites, and links.
As another example, the processor can form at least a portion of a computing environment for a recommendation engine. The recommendation engine may receive information about a user and output recommended content for the user based on the information about the user. The recommended content can include songs, images, video content, articles, publications, websites, news stories, or any combination of these that are ordered in a particular sequence. In such an example, the job can include determining the particular sequence in which to order the songs, images, video content, articles, publications, websites, news stories, or any combination of these for the recommended content.
In block 1104, the processor determines a best rank-1 approximation of a matrix associated with the job. The matrix can have any number and combination of columns and rows. In one example, the job can include determining a matrix of values associated with search results from a search engine or recommendations from a recommendation engine. The processor can determine the best rank-1 approximation for the matrix.
The processor can determine the best rank-1 approximation of the matrix using an enhanced power method (e.g., a modified version of the power method). In some examples, the enhanced power method can be implemented according to Algorithm 2 defined below:
Input: A, v0 
Output: ui, vi, λi 

    
    
        1: Set i=0
        2: repeat
        3: Set i=i+1
        4: Determine αi 
        5: Set ri=(1−αj)vi-2+αjvi-1 
        6:
    
    






  
    Compute
    ⁢
    
      
    
    ⁢
    
      u
      i
    
  
  =
  
    
      Ar
      i
    
    
      
        
        
          Ar
          i
        
        
      
      2
    
  




    
    
        7:
    
    






  
    Compute
    ⁢
    
      
    
    ⁢
    
      v
      i
    
  
  =
  
    
      
        A
        T
      
      ⁢
      
        u
        i
      
    
    
      
        
        
          
            A
            T
          
          ⁢
          
            u
            i
          
        
        
      
      2
    
  




    
    
        8: Set λi=uiTAvi=∥ATui∥2 
        9: until a convergence criterion is satisfied

where A is the matrix A; v0 is an initial, right singular value that is nonzero; λi is the largest singular value of the matrix at interval i; ui is the left singular value at interval i; vi is the right singular value at interval i; ri is a point that lies on a line that passes through vi-2 and vi-1; and αi is a refinement factor (e.g., discussed in greater detail below with respect to FIG. 12). By way of comparison, in Algorithm 2, the value for ui is determined based on the point ri (which is determined based on the refinement factor). This is different from Algorithm 1, in which the value for ui is determined based on vi-1.

    
    


In some examples, the processor can implement the enhanced power method by performing one or more of the steps shown in FIG. 12. Turning to FIG. 12, in block 1202, the processor determines a refinement factor (α). For example, the processor can determine a value for a that maximizes the following univariate function:




  
    
      
        
          h
          ⁡
          
            (
            α
            )
          
        
        =
        
          
            
              
              
                A
                ⁡
                
                  [
                  
                    
                      
                        (
                        
                          1
                          -
                          α
                        
                        )
                      
                      ⁢
                      
                        v
                        
                          i
                          -
                          2
                        
                      
                    
                    +
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      
                        v
                        
                          i
                          -
                          1
                        
                      
                    
                  
                  ]
                
              
              
            
            2
            2
          
          
            
              
              
                
                  
                    (
                    
                      1
                      -
                      α
                    
                    )
                  
                  ⁢
                  
                    v
                    
                      i
                      -
                      2
                    
                  
                
                +
                
                  α
                  ⁢
                  
                    
                  
                  ⁢
                  
                    v
                    
                      i
                      -
                      1
                    
                  
                
              
              
            
            2
            2
          
        
      
    
    
      
        Equation
        ⁢
        
          
        
        ⁢
        2
      
    
  




In some examples, Equation 2 can be modified and rewritten such that:




  α
  =
  
    
      
        -
        
          (
          
            
              
                a
                1
              
              ⁢
              
                c
                2
              
            
            -
            
              
                a
                2
              
              ⁢
              
                c
                1
              
            
          
          )
        
      
      -
      
        δ
      
    
    
      
        
          a
          1
        
        ⁢
        
          b
          2
        
      
      -
      
        
          a
          2
        
        ⁢
        
          b
          1
        
      
    
  




where a1=∥Avi-1−Avi-2∥22; a2=∥vi-1−vi-2∥22; b1=∥Avi-1∥22−a1−c1; b2=−a2; c1=∥Avi-2∥22; and c2=1. Because the values for vi-1 and vi-2 can be known at each iteration, Equations 2 and 3 can be solved to determine the refinement factor.
In block 1204, the processor determines a point (ri) on a line that passes through two values for a vector from prior iterations of the power method. The vector can be v and the two values can be vi-2 and vi-1. For example, as discussed above, ri can equal (1−αi)vi-2+αivi-1. The processor can determine ri by calculating (1−αi)vi-2+αivi-1.
In block 1206, the processor performs a power method using the point. For example, the processor can implement the enhanced power method defined by Algorithm 2 using the point. The results from Algorithm 2 can be values for ui, vi, and λi that satisfy (e.g., optimize) Equation 1 for determining the best rank-1 approximation of the matrix.
As a particular example, the matrix (A) that is associated with the job can have the following values:




  A
  =
  
    [
    
      
        
          1
        
        
          2
        
        
          0
        
        
          2
        
      
      
        
          2
        
        
          
            -
            3
          
        
        
          
            -
            2
          
        
        
          3
        
      
      
        
          3
        
        
          
            -
            1
          
        
        
          1
        
        
          1
        
      
    
    ]
  




In some examples, a traditional power method defined by Algorithm 1 can be applied to matrix A (with v0 set to be the first row of matrix A). The results for the first 12 iterations of the traditional power method are shown in table 1300 of FIG. 13. In table 1300, column 1302 includes the values for ui, column 1304 includes the values for vi, and column 1306 includes the values for λi. There can be three values in column 1302 because there are three rows in matrix A. There can be four values in column 1304 because there are four columns in matrix A. The values shown in the 12th row of columns 1302, 1304, and 1306 for ui, vi, and λi, respectively, can be input into Equation 1 to determine the best rank-1 approximation for matrix A.
In other examples, the enhanced power method defined by Algorithm 2 can be applied to matrix A. The results of the first 8 iterations of the enhanced power method are shown in table 1400 of FIG. 14. In table 1400, column 1402 includes the values for ui, column 1404 includes the values for vi, and column 1406 includes the values for λi. Looking at FIGS. 13-14 together, it can be seen that the enhanced power method can require fewer iterations than the traditional power method. Specifically, the traditional power method takes 11 iterations to achieve a λ value of 5.62580065, whereas the enhanced power method takes 6 iterations to achieve the same λ value. In FIGS. 13-14, the rows corresponding to i=1 are identical because α1=1 in the enhanced power method, and both power methods started with the same initialization point.
In some examples, the enhanced power method can be more effective when the value for αi is significantly greater than 1. For example, if a value of α2=3.62700438 is plugged in to Algorithm 2, λ2 can equal 5.59802814, which is considerably greater than the corresponding value for λ2 (e.g., 5.11330892) in the traditional power method. This may be because, when the value of αi is greater than 1, the point (ri) can be extrapolated beyond vi-1 along the direction of vi-1−vi-2. When αi is less than 1, the point (ri) can be interpolated between vi-2 and vi-1, taking a more cautious step. The extrapolation can reduce the number of iterations performed by the enhanced power method. This is because the enhanced power method takes advantage of a continuation property (e.g., that the values of ui and vi continue to increase, or continue to decrease, iteration-after-iteration) in the values for ui and vi obtained using the traditional power method. This continuation property is observable in the values for ui and vi in FIG. 13.
Although an iteration of the enhanced power method can have a higher computational cost than an iteration of the traditional power method, the additional computational cost can be almost negligible. For example, a matrix A can have m rows and n columns. A comparison of the computational costs for performing the traditional power method and the enhanced power method on dense and sparse versions of the matrix A are shown in the table 1500 of FIG. 15. The computational cost for performing the traditional power method on matrix A is shown in column 1502. The computational cost for performing the enhanced power method on matrix A is shown in column 1504. The difference between the two can be 3m+2n computations, as shown in column 1506. This difference is very small and almost negligible. For example, in the dense version of matrix A, the factor of 2mn has the greatest impact on the computational cost for both the traditional power method and the enhanced power method. And the additional computational cost of 3m+2n to perform the enhanced power method is almost negligible.
Further, the additional computational cost for each iteration of the enhanced power method can be offset by the significant reduction in the total number of iterations performed using the enhanced power method. As a particular example, FIG. 16 shows data sets used to compare the traditional power method against the enhanced power method. Column 1602 indicates whether a matrix of the data set is sparse or dense. Column 1604 indicates a number of rows in the matrix. Column 1606 indicates a number of columns in the matrix. Column 1608 indicates a number of nonzero entries in the matrix. FIG. 17 shows a table 1700 of an example of results from analyzing the data sets in FIG. 16 using the traditional power method and the enhanced power method. Column 1702 represents an iteration number. Columns 1704-1710 show the results for each respective data set. Within each of the columns 1704-1710 (e.g., within column 1704), the left-most column indicates the number of iterations used by the traditional power method, the middle column indicates the number of iterations used by the enhanced power method, and the right column indicates a ratio of the leading two eigenvalues associated with the matrix. It can be seen that when the ratio of the eigenvalues is a lower number (e.g., farther from one), the traditional power method and the enhanced power method converge in fewer iterations. When the ratio of the eigenvalues is a higher number, the traditional power method and the enhanced power method converge after a higher number of iterations.
The last row of table 1700 shows the total number of iterations using the traditional power method and the enhanced power method. The enhanced power method only takes 23% of the iterations performed by the traditional power method for the Webspam data set. The enhanced power method only takes 31% of the iterations performed by the traditional power method for the Real-sim data set. The enhanced power method only takes 36% of the iterations performed by the traditional power method for the Url data set. And the enhanced power method only takes 28% of the iterations performed by the traditional power method for the KDD2010 data set. Thus, the amount of processing power and the number of memory accesses required for performing the enhanced power method can be significantly less than are required for the traditional power method.
In some examples, the fewer iterations performed using the enhanced power method can result in a reduced amount of latency in a system. For example, a system may include multiple nodes (e.g., the worker nodes and control nodes discussed with respect to FIG. 4). The nodes can work together to perform a power method for determining a best rank-1 approximation of a matrix. For example, some or all of the nodes can transmit and receive information associated with the power method or the best rank-1 approximation of the matrix. Examples of the information can include the best rank-1 approximation of the matrix, a current value for the left singular value (u) in a current iteration, a current value for the right singular value (vi) in the current iteration, a current value for λ in the current iteration, a current value for a refinement factor (α) in the current iteration, a value (e.g., vi-1) for the right singular vector from an immediately prior iteration of the power method, a value (e.g., vi-2) for the right singular vector from another prior iteration of the power method, or any combination of these. Each communication can take a period of time to complete. Because there may be more iterations required for the traditional power method, there may be more communications and more resulting latency in the system if the nodes perform the traditional power method. Conversely, because there may be fewer iterations required for the enhanced power method, there can be fewer communications and less resulting latency in the system if the nodes perform the enhanced power method.
Returning now to FIG. 11, in block 1106, the processor performs the job based on the best rank-1 approximation of the matrix. For example, the job can be associated with generating a model. The model can represent a relationship between data included in the electronic communication and multiple independent variables that influence the data. The processor can generate the model using the best rank-1 approximation of the matrix. For example, the processor can provide the best rank-1 approximation of the matrix as input to a modeling program or apply the best rank-1 approximation of the matrix to an algorithm to generate the model.
In block 1108, the processor transmits another electronic communication associated with the job. In some examples, the other electronic communication can include a result of the job. For example, the processor can transmit a display signal, which can be the other electronic communication, to a display device (e.g., a computer monitor) to cause the display device to output a graphical representation of the result of the job.
In some examples, the processor can transmit the other electronic communication to a worker node or a control node (e.g., as discussed with respect to FIG. 4). The electronic communication can include information associated with the power method or the best rank-1 approximation of the matrix. For example, the information can include the best rank-1 approximation of a matrix, a current value for the left singular value (u) in a current iteration of the power method, a current value for the right singular value (vi) in the current iteration, a current value for λ in the current iteration, a current value for a refinement factor (α) in the current iteration, or any combination of these.
The foregoing description of certain examples, including illustrated examples, has been presented only for the purpose of illustration and description and is not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Numerous modifications, adaptations, and uses thereof will be apparent to those skilled in the art without departing from the scope of the disclosure.

## Claims

1. A non-transitory computer readable medium comprising:
program code executable by a processor for causing the processor to receive an electronic communication indicating a job to be performed;
program code executable by the processor for causing the processor to determine a best rank-1 approximation of a matrix associated with the job using a power method, wherein each iteration of the power method comprises:
determining a point that lies on a line passing through (i) a first value for a first singular vector from an immediately prior iteration of the power method; and (ii) a second value for the first singular vector from another prior iteration of the power method; and
determining, by performing the power method using the point, a current value for the first singular vector and a current value for a second singular vector for a current iteration of the power method;

program code executable by the processor for causing the processor to perform the job at least in part using the best rank-1 approximation of the matrix; and
program code executable by the processor for causing the processor to transmit another electronic communication associated with a result of the job.

2. The non-transitory computer readable medium of claim 1, further comprising program code executable by the processor for causing the processor to determine the point based on a refinement factor, the refinement factor being a value that maximizes a function that includes a predetermined relationship between (i) the matrix; (ii) the first value for the first singular vector from the immediately prior iteration of the power method, and (iii) the second value for the first singular vector from the other prior iteration of the power method.

3. The non-transitory computer readable medium of claim 2, wherein the first singular vector is a left singular vector for the matrix and the second singular vector is a right singular vector for the matrix.

4. The non-transitory computer readable medium of claim 3, wherein the job is associated with ranking documents or links in a search engine or generating recommended content to be provided to a user.

5. The non-transitory computer readable medium of claim 1, wherein the job is associated with generating a model that represents a relationship between data included in the electronic communication and a plurality of independent variables that influence the data.

6. The non-transitory computer readable medium of claim 1, wherein the power method is configured to use a lower number of computational iterations for determining the best rank-1 approximation of the matrix than another power method in which the current value for the first singular vector and the current value for the second singular vector are determined exclusive of the second value for the first singular vector from the other prior iteration of the power method.

7. The non-transitory computer readable medium of claim 1, wherein the power method is configured to use less memory for storing data associated with performing the power method than another power method in which the current value for the first singular vector and the current value for the second singular vector are determined exclusive of the second value for the first singular vector from the other prior iteration of the power method.

8. The non-transitory computer readable medium of claim 1, further comprising program code executable by the processor for causing the processor to communicate at least one of the best rank-1 approximation of the matrix, the current value for the first singular vector, or the current value for the second singular vector to a worker node in a communications grid computing system for performing the job.

9. The non-transitory computer readable medium of claim 8, further comprising program code executable by the processor for causing the processor to receive the electronic communication from the worker node in the communications grid computing system, the electronic communication comprising at least one of the first value for the first singular vector from the immediately prior iteration of the power method, or the second value for the first singular vector from the other prior iteration of the power method.

10. The non-transitory computer readable medium of claim 1, further comprising program code executable by the processor for causing the processor to transmit the other electronic communication associated with the result of the job by transmitting a display signal configured to cause a display device to output a graphical representation of the result of the job.

11. A computer-implemented method executed by a processing device coupled to a memory device, the computer-implemented method comprising:
receiving, by the processing device, an electronic communication indicating a job to be performed;
determining, by the processing device, a best rank-1 approximation of a matrix associated with the job using a power method, wherein each iteration of the power method comprises:
determining a point that lies on a line passing through (i) a first value for a first singular vector from an immediately prior iteration of the power method; and (ii) a second value for the first singular vector from another prior iteration of the power method; and
determining, by performing the power method using the point, a current value for the first singular vector and a current value for a second singular vector for a current iteration of the power method;

performing, by the processing device, the job at least in part using the best rank-1 approximation of the matrix; and
transmitting, by the processing device, another electronic communication associated with a result of the job.

12. The computer-implemented method of claim 11, further comprising determining the point based on a refinement factor, the refinement factor being a value that maximizes a function that includes a predetermined relationship between (i) the matrix; (ii) the first value for the first singular vector from the immediately prior iteration of the power method, and (iii) the second value for the first singular vector from the other prior iteration of the power method.

13. The computer-implemented method of claim 12, wherein the first singular vector is a left singular vector for the matrix and the second singular vector is a right singular vector for the matrix.

14. The computer-implemented method of claim 11, wherein the job is associated with ranking documents or links in a search engine or generating recommended content to be provided to a user.

15. The computer-implemented method of claim 11, wherein the job is associated with generating a model that represents a relationship between data included in the electronic communication and a plurality of independent variables that influence the data.

16. The computer-implemented method of claim 11, wherein the power method is configured to use a lower number of computational iterations for determining the best rank-1 approximation of the matrix than another power method in which the current value for the first singular vector and the current value for the second singular vector are determined exclusive of the second value for the first singular vector from the other prior iteration of the power method.

17. The computer-implemented method of claim 11, wherein the power method is configured to use less memory for storing data associated with performing the power method than another power method in which the current value for the first singular vector and the current value for the second singular vector are determined exclusive of the second value for the first singular vector from the other prior iteration of the power method.

18. The computer-implemented method of claim 11, wherein further comprising communicating at least one of the best rank-1 approximation of the matrix, the current value for the first singular vector, or the current value for the second singular vector to a worker node in a communications grid computing system for performing the job.

19. The computer-implemented method of claim 18, further comprising receiving the electronic communication from the worker node in the communications grid computing system, the electronic communication comprising at least one of the first value for the first singular vector from the immediately prior iteration of the power method, or the second value for the first singular vector from the other prior iteration of the power method.

20. The computer-implemented method of claim 18, further comprising transmitting the other electronic communication associated with the result of the job by transmitting a display signal configured to cause a display device to output a graphical representation of the result of the job.

21. A system comprising:
a processing device; and
a memory device in which instructions executable by the processing device are stored for causing the processing device to:
receive an electronic communication indicating a job to be performed;
determine a best rank-1 approximation of a matrix associated with the job using a power method, wherein each iteration of the power method comprises:
determining a point that lies on a line passing through (i) a first value for a first singular vector from an immediately prior iteration of the power method; and (ii) a second value for the first singular vector from another prior iteration of the power method; and
determining, by performing the power method using the point, a current value for the first singular vector and a current value for a second singular vector for a current iteration of the power method;

perform the job at least in part using the best rank-1 approximation of the matrix; and
transmit another electronic communication associated with a result of the job.

22. The system of claim 21, wherein the memory device further comprises instructions executable by the processing device for causing the processing device to determine the point based on a refinement factor, the refinement factor being a value that maximizes a function that includes a predetermined relationship between (i) the matrix; (ii) the first value for the first singular vector from the immediately prior iteration of the power method, and (iii) the second value for the first singular vector from the other prior iteration of the power method.

23. The system of claim 22, wherein the first singular vector is a left singular vector for the matrix and the second singular vector is a right singular vector for the matrix.

24. The system of claim 23, wherein the job is associated with ranking documents or links in a search engine or generating recommended content to be provided to a user.

25. The system of claim 21, wherein the job is associated with generating a model that represents a relationship between data included in the electronic communication and a plurality of independent variables that influence the data.

26. The system of claim 21, wherein the power method is configured to use a lower number of computational iterations for determining the best rank-1 approximation of the matrix than another power method in which the current value for the first singular vector and the current value for the second singular vector are determined exclusive of the second value for the first singular vector from the other prior iteration of the power method.

27. The system of claim 21, wherein the power method is configured to use less memory for storing data associated with performing the power method than another power method in which the current value for the first singular vector and the current value for the second singular vector are determined exclusive of the second value for the first singular vector from the other prior iteration of the power method.

28. The system of claim 21, wherein the memory device further comprises instructions executable by the processing device for causing the processing device to communicate at least one of the best rank-1 approximation of the matrix, the current value for the first singular vector, or the current value for the second singular vector to a computing device for performing the job.

29. The system of claim 28, wherein the memory device further comprises instructions executable by the processing device for causing the processing device to receive the electronic communication from the worker node in the communications grid computing system, the electronic communication comprising at least one of the first value for the first singular vector from the immediately prior iteration of the power method, or the second value for the first singular vector from the other prior iteration of the power method.

30. The system of claim 21, wherein the memory device further comprises instructions executable by the processing device for causing the processing device to transmit the other electronic communication associated with the result of the job by transmitting a display signal configured to cause a display device to output a graphical representation of the result of the job.