Patent application number | Description | Published |
20120089576 | ITEM LEVEL RECOVERY - A backup and restore system may present recovered backup data as local resources and in a read and write manner so that the recovered backup data may be accessed using an application that created the data. In some embodiments, the recovered data may be read only data, but a differencing virtual hard disk (VHD), Common Internet File System protocol, or differencing driver may be used to present a read/write version of the data. Additionally, the data may be presented using iSCSI or other technologies to present the data as local data, even though the data may be remotely located. The backup and restore system may additionally use VHD differencing technologies to create multiple backups. | 04-12-2012 |
20120317379 | STORAGE ARCHITECTURE FOR BACKUP APPLICATION - Aspects of the subject matter described herein relate to a storage architecture. In aspects, an address provided by a data source is translated into a logical storage address of virtual storage. This logical storage address is translated into an identifier that may be used to store data on or retrieve data from a storage system. The address space of the virtual storage is divided into chunks that may be streamed to the storage system. | 12-13-2012 |
20130061089 | EFFICIENT APPLICATION-AWARE DISASTER RECOVERY - Embodiments are directed to efficiently backing up portions of data and to performing a scoped data recovery. In an embodiment, a computer system preloads data images with data corresponding to various different software applications or operating systems. The computer system chunks the data images, so that each data image is divided into multiple data chunks, and where each data chunk is represented by a hash value. The computer system then receives, from a user, portions of delta data representing data differences between the received user data and the data in the preloaded data images. The computer system also generates a logical backup representation that includes the data chunk hash values for the preloaded data images as well as the delta data received from the user. This logical representation allows restoration of the user's data using only the hash values and the delta data. | 03-07-2013 |
20130066838 | EFFICIENT DATA RECOVERY - Embodiments are directed to locating and restoring backed up items using a custom schema and to efficiently transferring recovery data. In an embodiment, a computer system defines a schema that provides data search and retrieval among backup data sets. The schema stores searchable attributes for each database item and leverages a file system to store file system metadata for the data items of the backup sets. The computer system receives a request to find data items among the backup data sets and accesses the schema to determine, from the stored searchable attributes, which recovery points among the backup data sets include the requested data items. The computer system also restores the requested data items from the determined recovery point within the backup data sets. | 03-14-2013 |
20130226874 | ITEM LEVEL RECOVERY - A backup and restore system may present recovered backup data as local resources and in a read and write manner so that the recovered backup data may be accessed using an application that created the data. In some embodiments, the recovered data may be read only data, but a differencing virtual hard disk (VHD), Common Internet File System protocol, or differencing driver may be used to present a read/write version of the data. Additionally, the data may be presented using iSCSI or other technologies to present the data as local data, even though the data may be remotely located. The backup and restore system may additionally use VHD differencing technologies to create multiple backups. | 08-29-2013 |
Patent application number | Description | Published |
20130136141 | WRR SCHEDULER CONFIGURATION FOR OPTIMIZED LATENCY, BUFFER UTILIZATION - A method includes receiving network information for calculating weighted round-robin (WRR) weights, calculating WRR weights associated with queues based on the network information, and determining whether a highest common factor (HCF) exists in relation to the calculated WRR weights. The method further includes reducing the calculated WRR weights in accordance with the HCF, when it is determined that the HCF exists, and performing a WRR scheduling of packets, stored in the queues, based on the reduced WRR weights. | 05-30-2013 |
20130329548 | RE-ROUTING NETWORK TRAFFIC AFTER LINK FAILURE - In one example, a network device includes a virtual network agent, and a network interface to send network packets to the virtual network controller using a default route for a physical network prior to establishing a communication session between a virtual network controller and the virtual network agent, wherein, after establishing the communication session between the virtual network controller device and the virtual network agent, the virtual network agent receives from the virtual network controller a command to install a new route at the network device, wherein the new route specifies encapsulation information to use for encapsulating network packets for sending the network packets to the virtual network controller over an overlay network, and wherein, responsive to detecting a failed link in the physical network, the virtual network agent sends packets to the virtual network controller on an alternate route in the overlay network. | 12-12-2013 |
20130329605 | MULTICAST SERVICE IN VIRTUAL NETWORKS - Techniques are described to provide multicast service within a virtual network using a virtual network controller and endpoint replication without requiring multicast support in the underlying network. The virtual network controller is configured to create a multicast tree for endpoint devices of a multicast group in the virtual network at a centralized location instead of in a distributed fashion. The virtual network controller communicates the multicast tree to one or more of the endpoint devices of the multicast group to instruct the endpoint devices to replicate and forward multicast packets to other endpoint devices according to the multicast tree. The replication and forwarding of multicast packets is performed by virtual switches executed on the endpoint devices in the virtual network. No replication is performed within the underlying network. The techniques enable multicast service within a virtual network without requiring multicast support in the underlying network. | 12-12-2013 |
20130329725 | FACILITATING OPERATION OF ONE OR MORE VIRTUAL NETWORKS - Techniques for facilitating the operation of one or more virtual networks are described. In some examples, a system may include a first controller node device configured to control operation of a first set of elements in the one or more virtual networks, wherein the first set of elements includes a first server device. The system may also include a second controller node device configured to control operation of a second set of elements in the one or more virtual networks, wherein the second set of elements includes the second server device. The first controller node device and the second controller node device are peers according to a peering protocol by which the first controller node device and the second controller node device exchange information relating to the operation of the first set of elements and the second set of elements. | 12-12-2013 |
20130332577 | MULTITENANT SERVER FOR VIRTUAL NETWORKS WITHIN DATACENTER - In general, techniques are described for facilitating multi-tenancy of a server accessed by virtual networks of a data center. A device included within a data center comprising one or more processors may perform the techniques. The processors may be configured to execute a virtual switch that supports a number of virtual networks executing within the data center. The virtual switch may be configured to receive a request regarding data associated with an identifier that is unique within one of the virtual networks that originated the request. The virtual switch may then translate the identifier included within the request to generate a globally unique identifier that is unique within the plurality of virtual networks, update the request to replace the identifier included within the request with the globally unique identifier, and transmit the updated request to a server of the data center. | 12-12-2013 |
20130332601 | DYNAMIC LOGGING - In general, techniques are described for dynamically modifying the extent of logging performed by logging information generators in response to events detected in logging information received by the collector. In some examples, a network device includes one or more processors and a collector executed by the processors to receive a log message that includes logging information from a generator. The network device also includes a rules engine to apply one or more rules that each specify a condition and a corresponding action to the logging information to identify a matching rule, wherein the rules engine, upon identifying a matching rule, executes the action of the matching rule to generate and send a logging modification message to increase an extent to which the generator generates logging information. | 12-12-2013 |
20130332602 | PHYSICAL PATH DETERMINATION FOR VIRTUAL NETWORK PACKET FLOWS - In general, techniques are described for determining a physical network path taken by packets of a network packet flow. The techniques may be applied to determine, or “trace,” a physical network path in the virtualized network domain. In some examples, a network device includes one or more processors and a switch executed by the processors to forward packets of a packet flow to a physical network path. The network device also includes a flow trace module to generate one or more flow trace packets having incrementally increasing respective time-to-live (TTL) values, wherein the switch module forwards the flow trace packets on an outbound interface of the network device for the physical network path, and wherein the flow trace module receives corresponding time exceeded messages for the flow trace packets, wherein each of the time exceeded message includes a source network address of a network element on the physical network path. | 12-12-2013 |
20150244617 | PHYSICAL PATH DETERMINATION FOR VIRTUAL NETWORK PACKET FLOWS - In general, techniques are described for configuring and managing virtual networks. For example, a distributed virtual network controller is described that configures and manages an overlay network within a physical network formed by plurality of switches. A plurality of servers are interconnected by the switch fabric, each of the servers comprising an operating environment executing one or more virtual machines in communication via the overlay networks. The servers comprises a set of virtual switches that extends the overlay network as a virtual network to the operating environment of the virtual machines. The controller may instruct the servers and the virtual switches to perform various operations, such as determining a physical network path taken by packets of a network packet flow, determining latency through the network, re-routing traffic in the virtual network due to network events, replicating traffic for multicasting, providing multi-tenant services to support multiple virtual networks, monitoring and logging traffic characteristics within the virtual networks and other operations. | 08-27-2015 |
Patent application number | Description | Published |
20080310432 | AUTONEGOTIATION OVER AN INTERFACE FOR WHICH NO AUTONEGOTIATION STANDARD EXISTS - A method for enabling autonegotiation over an interface for which no autonegotiation standard exists comprises establishing network communication between a first network device and a second network device over a communication link. The first network device includes a first media access controller (MAC) associated with a communication port coupled to the communication link and a second MAC positioned between the first MAC and the communication port, and the second MAC operates as a proxy MAC for the first MAC. The first MAC outputs an outbound data communication to the communication port at a first communication rate. The proxy MAC intercepts the outbound data communication. The proxy MAC then outputs the outbound data communication to the communication port at a second communication rate different from the first communication rate. | 12-18-2008 |
20100278076 | AUTOMATIC CONFIGURATION OF VIRTUAL NETWORK SWITCHES - In general, techniques are described in which a plurality of network switches automatically configure themselves to operate as a single virtual network switch. A virtual switch is a collection of individual switch devices that operate like as single network switch. As described herein, network switches in a network that are capable of participating in a virtual switch may automatically discover one another. The participating network switches may then elect one of the participating switches as a master switch. The master switch may generate forwarding information and store the forwarding information in the participating switches, including the master switch. The forwarding information causes the participating switches to act like a single network switch. | 11-04-2010 |
20110118889 | INCREASING MEAN TIME BETWEEN FAILURES FOR POWER SUPPLIES - A redundant power supply may obtain a rule for increasing mean time between failures (MTBF) for a first internal power supply and a second internal power supply connected to an electronic device, apply the rule to the first and second power supplies, activate the second internal power supply based on the rule to permit the second internal power supply to provide power to the electronic device, and deactivate the first internal power supply based on the rule. | 05-19-2011 |
20120098338 | SHARING REDUNDANT POWER SUPPLY MODULES AMONG PHYSICAL SYSTEMS - A system may include a switchover element configurable to source or sink power from or to an electronic device electrically coupled to the switchover element and a controller in communication with the switchover element. The controller may be configured to determine if the electronic device is healthy. When the electronic device is healthy, the controller may configure the switchover element to deliver power from the electronic device to the system and configure the switchover element to provide the power to any unhealthy electronic device electrically coupled to the system. | 04-26-2012 |
20120140773 | WRR SCHEDULER CONFIGURATION FOR OPTIMIZED LATENCY, BUFFER UTILIZATION - A method includes receiving network information for calculating weighted round-robin (WRR) weights, calculating WRR weights associated with queues based on the network information, and determining whether a highest common factor (HCF) exists in relation to the calculated WRR weights. The method further includes reducing the calculated WRR weights in accordance with the HCF, when it is determined that the HCF exists, and performing a WRR scheduling of packets, stored in the queues, based on the reduced WRR weights. | 06-07-2012 |
20130144454 | INCREASING MEAN TIME BETWEEN FAILURES FOR POWER SUPPLIES - A redundant power supply may obtain a rule for increasing mean time between failures (MTBF) for a first internal power supply and a second internal power supply connected to an electronic device, apply the rule to the first and second power supplies, activate the second internal power supply based on the rule to permit the second internal power supply to provide power to the electronic device, and deactivate the first internal power supply based on the rule. | 06-06-2013 |
Patent application number | Description | Published |
20140089400 | INFERRING TARGET CLUSTERS BASED ON SOCIAL CONNECTIONS - A seed cluster comprising a group of users who share a particular attribute and/or affiliation is determined by a social networking system. For each user of the seed cluster, other users and/or entities connected to the user in the social networking system are retrieved. For each retrieved other user or entity, the social networking system may determine whether the other user or entity exhibits the attribute or affiliation based on a random walk algorithm. A resulting targeting cluster of users and/or entities may be used for targeting advertisements targeting to members. A social networking system may also infer an affiliation for a user based on the user's interaction with a page, application, or entity where other users who interacted with the same page, application, or entity have the same affiliation. | 03-27-2014 |
20140214861 | PROXY CACHE AGGREGATOR - A social data aggregator generates entries of action data describing actions taken by users of a social networking system. The entries are archived in a number of remote data hosts, with a portion of the entries stored in an action cache to expedite retrieval. The action cache is modified to include relevant entries of action data by selecting the most relevant entries from proxy data aggregators, which identify sets of entries from remote data hosts coupled to the proxy data aggregators based on the relevance of the entries in the remote data hosts. The relevance of an entry is based on an associated engagement score indicating a likelihood of a user requesting content interacting with a notification based on an entry. | 07-31-2014 |
20150189035 | Proxy Cache Aggregator - A social data aggregator generates entries of action data describing actions taken by users of a social networking system. The entries are archived in a number of remote data hosts, with a portion of the entries stored in an action cache to expedite retrieval. The action cache is modified to include relevant entries of action data by selecting the most relevant entries from proxy data aggregators, which identify sets of entries from remote data hosts coupled to the proxy data aggregators based on the relevance of the entries in the remote data hosts. The relevance of an entry is based on an associated engagement score indicating a likelihood of a user requesting content interacting with a notification based on an entry. | 07-02-2015 |
Patent application number | Description | Published |
20140173723 | REPUTATION OF NETWORK ADDRESS - Example embodiments disclosed herein relate to determining a reputation of a network address. A long-term reputation of the network address is determined. A short-term reputation of the network address is determined based on the long-term reputation and trend information associated with the long-term reputation. | 06-19-2014 |
20150317476 | Distributed Pattern Discovery - Example embodiments disclosed herein relate to distributed pattern discovery. A local frequent pattern tree or local frequent pattern trees can be merged. The merging can be based on activities or transactions associated with the local frequent pattern tree or trees. | 11-05-2015 |
20150324581 | DISPLAYING REAL-TIME SECURITY EVENTS - A system and method for displaying a number of real-time security events comprises a number of client devices and an administrator device communicatively coupled to the client devices. The administrator device may comprise a preferences module and an event rate adapter module communicatively coupled to the preferences module. The preferences module receives input describing how to display a number of security events on the screen of a graphical user interface the event rate adapter module displays a number of real-time scrolling security events for a relatively longer period of time than other security events. | 11-12-2015 |
20150371044 | TARGETED SECURITY ALERTS - Providing a targeted security alert can include collecting participant data from a plurality of participants within a threat exchange community, calculating, using a threat exchange server, a threat relevancy score of a participant among the plurality of participants within the threat exchange community using the collected participant data, and providing, from the threat exchange server to the participant, the targeted security alert based on the calculated threat relevancy score via a communication link within the threat exchange community. | 12-24-2015 |
20160034361 | DISTRIBUTED EVENT CORRELATION SYSTEM - According to an example, a master node is to divide an event field in events into partitions including ordered contiguous blocks of values for the event field. Each partition may be assigned to a pair of cluster nodes. A partition map is determined from the partitions and may identify for each partition, the block of the event field values for the partition, a primary cluster node, and a failover cluster node for the primary cluster node. | 02-04-2016 |
Patent application number | Description | Published |
20130198168 | DATA STORAGE COMBINING ROW-ORIENTED AND COLUMN-ORIENTED TABLES - A data storage system includes a query manager to identify storage engines to execute a query. A first storage engine may execute a portion of the query on a row-oriented table and a second storage engine may execute a second portion of the query on a column-oriented table. | 08-01-2013 |
20140032535 | SYSTEMS AND METHODS FOR IN-MEMORY PROCESSING OF EVENTS - Systems and methods for in-memory processing of events are provided. A set of unique elements of a plurality of queries is determined. Each query is executed on a defined schedule and time duration. A plurality of events in an event stream are received. The events are filtered using the set of unique elements. For each query, a query result for each filtered event is determined. For each query, in-memory aggregation of the query result of each filtered event is provided. | 01-30-2014 |
20140075564 | NETWORK ASSET INFORMATION MANAGEMENT - A network asset information management system ( | 03-13-2014 |
20140122461 | SYSTEMS AND METHODS FOR MERGING PARTIALLY AGGREGATED QUERY RESULTS - Systems and methods for merging partially aggregated query results are provided. A partially aggregated query result is determined. Each query of a plurality of queries is executed on a plurality of events at a defined schedule and a time duration. A key and a value of the partially aggregated query result are identified. It is determined whether a function for the partially aggregated query result is identified. If so, a related partially aggregated query result is determined using the key. The partially aggregated query result is merged with the related partially aggregated query result. | 05-01-2014 |
20140165140 | SYSTEMS AND METHODS FOR EVALUATION OF EVENTS BASED ON A REFERENCE BASELINE ACCORDING TO TEMPORAL POSITION IN A SEQUENCE OF EVENTS - Systems and methods for evaluation of events are provided. A user-specific reference baseline comprising a set of temporally-ordered sequences of events. An event of a sequence of events in a current session is received. A determination is made as to whether the event at least partially matches the reference baseline using an attribute of the event and a temporal position of the event within the sequence of events in the current session. | 06-12-2014 |
20140165200 | SYSTEMS AND METHODS FOR DISTRIBUTED RULE-BASED CORRELATION OF EVENTS - Systems and methods for distributed rule-based correlation of events are provided. A notification of a partial match of a distributed rule by an event of a first subset of events is received. The notification includes a set of properties of the event of the first subset of events. The distributed rule is evaluated using the set of properties of the event of the first subset of events and a set of properties of an event of a second subset of events. A complete match of the rule is determined based on the evaluation, and a correlation event is generated. | 06-12-2014 |
20140215616 | ATTACK NOTIFICATION - Systems, methods, and machine-readable and executable instructions are provided for attack notification. Attack notification can include receiving security-related data from a number of computing devices that are associated with a number of entities through a communication link and analyzing a first portion of the security-related data that is associated with a first entity from the number of entities to determine whether the first entity has experienced an attack. Attack notification can include analyzing a second portion of the security-related data that is associated with a second entity from the number of entities and the first portion of the security-related data that is associated with the first entity to determine whether the second entity is experiencing the attack. Attack notification can include notifying, through the communication link, the second entity that the second entity is experiencing the attack if it is determined that the second entity is experiencing the attack. | 07-31-2014 |
20150106922 | PARAMETER ADJUSTMENT FOR PATTERN DISCOVERY - Pattern discovery performed on event data may include selecting an initial set of parameters for the pattern discovery. The parameters may specify conditions for identifying a pattern in the event data. A pattern discovery run is executed on the event data based on the initial set of parameters, and a parameter may be adjusted based on the output of the pattern discovery run. | 04-16-2015 |
20150135263 | FIELD SELECTION FOR PATTERN DISCOVERY - Fields are determined for pattern discovery in event data. Cardinality and repetitiveness statistics are determined for fields of event data. A set of the fields are selected based on the cardinality and repetitiveness for the fields. The fields may be included in a pattern discovery profile. | 05-14-2015 |
20150215329 | Pattern Consolidation To Identify Malicious Activity - A process includes analyzing events reported by computing devices on a network to recognize patterns of events that occurred on the network and sharing with a community, information concerning the patterns detected. The process may also use consolidated information on the patterns to select one or more of the patterns for analysis that identifies whether the selected patterns result from malicious activity. The consolidated information includes information on the patterns detected on the network and information concerning corresponding patterns of events that occurred elsewhere. | 07-30-2015 |
Patent application number | Description | Published |
20090083738 | AUTOMATED DATA OBJECT SET ADMINISTRATION - Modern computer systems may comprise massive sets of data objects of various types, such as data files, application binaries, database objects, proprietary objects managed by applications such as email systems, and system configuration information. Applying complex operations, such as archiving and synchronization operations, to many and varied data objects may be difficult to perform manually or through a script. A more advantageous technique involves applying data object managers to the data object set, where such data object managers are configured to apply various rule comprising a task to be performed on the data object set in furtherance of the operation to various data object types in the data object set. Additionally, the data object set may be modeled as a hierarchical data object set map, to which the rules may be applied through the data object managers in a more uniform manner. | 03-26-2009 |
20090164983 | PROGRAMMING LIBRARY USAGE CAPTURING AND REPRESENTATION - A computer system may provide various resources to users through one or more programming libraries, such as application programming interfaces (APIs), in order to standardize access to such resources through various general-purpose mechanisms. These programming libraries may be operated by other programs, such as task-specific user interfaces, through which a user may utilize the programming library without having to understand its structure and functions. However, in many scenarios, a user may wish to know the manner of invoking a programming library to achieve an invoked behavior, or may wish to reproduce the behavior without having to utilize the user interface. A user may therefore capture an invocation of the programming library, and may generate an instruction set representing the captured invocation that may be studied, copied, modified, subsequently performed, etc. | 06-25-2009 |
20100185582 | Web Deployment Functions and Interfaces - Described is a technology in which a destination machine (e.g., a server) is synchronized with source data via an API, including to configure the destination machine. The API includes functions for specifying the source data, the destination machine, and the deployment/synchronization type, along with a function for synchronizing the source data to the destination machine. The API allows combining content, configuration data and/or database data into a single unit (object). The API handles communication with a service/agent on the destination machine that configures that destination machine based on the source data. The API may include functions for packaging web applications, deploying web applications, synchronizing websites, deploying archive data, and/or deploying manifest data. In this manner, deployment/synchronization (including backup operations) may be performed against a group of objects using an API. | 07-22-2010 |
20100185856 | Stateless Agent - Secure and stateless data transfer between a source agent at a first computer system and a destination agent at a second computer system is provided. A first list of labels of content structures is generated at the first computer system. During a first data transfer session, the first list, authentication information, at least one object included in the content structures, and file identifiers for one or more files included in the content structures are transferred from the first computer system to the second computer system. A second list is generated at the second computer system and received at the first computer system. The second list lists at least one requested file identified by the transmitted file identifier(s). During a second data transfer session, authentication information, the first list, the at least one object, and the requested file(s) are transferred from the first computer system to the second computer system. | 07-22-2010 |
Patent application number | Description | Published |
20110259463 | VISCOELASTIC DAMPED JUMPERS - A system, in certain embodiments, includes a multi-layer composite strip of pipe dampening materials, comprising a first layer of a first material, a second layer of a second material disposed adjacent to the first layer of material, and a third layer of a third material disposed adjacent to the second layer of material, wherein the second material comprises a viscoelastic material, and wherein the multi-layer composite strip of pipe dampening materials is configured to be affixed to an outer surface of a section of pipe. In certain embodiments, the first layer and the third layer may have stiffness values that are substantially different from each other. The difference in stiffness values may enable relative motion in the first layer and the third layer to be generated during vibration of the section of pipe, and the energy may be dissipated by the viscoelastic material, thereby dampening vibration of the section of pipe. In certain embodiments, multiple strips of pipe dampening materials may be used. | 10-27-2011 |
20120103739 | POUNDING TUNE MASS DAMPER WITH VISCOELASTIC MATERIAL - A vibration dampener, including, a first beam comprising a first mounting end portion and a first peripheral end portion, wherein the first peripheral end portion comprises a tunable mass, and the first beam is configured to vibrate in tune with a vibrational frequency of a structure supporting the first beam at the first mounting end portion, a second beam comprising a second mounting end portion and a second peripheral end portion, wherein the second peripheral end portion comprises a ring disposed about the first beam, and a viscoelastic material disposed between the first beam and the ring, wherein the viscoelastic material is configured to dampen vibrational energy as the first beam vibrates toward the ring until the viscoelastic material becomes compressed between the first beam and the ring during the course of the impact. | 05-03-2012 |
20140069908 | SYSTEMS AND METHODS FOR HEATING CONCRETE STRUCTURES - A system and method for heating concrete structures to either prevent the build-up of freezing precipitation or eliminate freezing precipitation on a top surface of the concrete structures. The system includes a heating assembly integrally formed with a concrete structure to apply thermal energy to the top surface of the concrete structure. Optionally, the heating assembly includes heating elements formed of carbon fiber tape. Following formation of the concrete structure, the heating assembly is configured for unified movement with the concrete structure. The system optionally includes a control assembly operatively coupled to the heating assembly. The control assembly selectively powers the heating assembly and can be configured for remote operation. In use, the control assembly can be selectively activated from a remote location to power the heating assembly and heat the concrete structure. | 03-13-2014 |
Patent application number | Description | Published |
20090182683 | Method and System for Low Latency Basket Calculation - A basket calculation engine is deployed to receive a stream of data and accelerate the computation of basket values based on that data. In a preferred embodiment, the basket calculation engine is used to process financial market data to compute the net asset values (NAVs) of financial instrument baskets. The basket calculation engine can be deployed on a coprocessor and can also be realized via a pipeline, the pipeline preferably comprising a basket association lookup module and a basket value updating module. The coprocessor is preferably a reconfigurable logic device such as a field programmable gate array (FPGA). | 07-16-2009 |
20090287628 | Method and System for Accelerated Stream Processing - Disclosed herein is a method and system for hardware-accelerating various data processing operations in a rule-based decision-making system such as a business rules engine, an event stream processor, and a complex event stream processor. Preferably, incoming data streams are checked against a plurality of rule conditions. Among the data processing operations that are hardware-accelerated include rule condition check operations, filtering operations, and path merging operations. The rule condition check operations generate rule condition check results for the processed data streams, wherein the rule condition check results are indicative of any rule conditions which have been satisfied by the data streams. The generation of such results with a low degree of latency provides enterprises with the ability to perform timely decision-making based on the data present in received data streams. | 11-19-2009 |
20110040701 | Method and System for High Speed Options Pricing - A high speed technique for options pricing in the financial industry is disclosed that can provide both high throughput and low latency. Parallel/pipelined architectures are disclosed for computing an option's theoretical fair price. Preferably these parallel/pipelined architectures are deployed in hardware, and more preferably reconfigurable logic such as Field Programmable Gate Arrays (FPGAs) to accelerate the options pricing operations relative to conventional software-based options pricing operations. | 02-17-2011 |
20130086096 | Method and System for High Performance Pattern Indexing - Disclosed herein is a method and system for accelerating the generation of pattern indexes. In exemplary embodiments, regular expression pattern matching can be performed at high speeds on data to determine whether a pattern is present in the data. Pattern indexes can then be built based on the results of such regular expression pattern matching. Reconfigurable logic such a field programmable gate arrays (FPGAs) can be used to hardware accelerate these operations. | 04-04-2013 |
20130151458 | Method and Apparatus for Accelerated Data Quality Checking - Disclosed herein is a method and apparatus for hardware-accelerating various data quality checking operations. Incoming data streams can be processed with respect to a plurality of data quality check operations using offload engines (e.g., reconfigurable logic such as field programmable gate arrays (FPGAs)). Accelerated data quality checking can be highly advantageous for use in connection with Extract, Transfer, and Load (ETL) systems. | 06-13-2013 |