Red Hat, Inc.

Red Hal, Inc.

James P Schneider

Bill Clifford Riemers

Luke R Meyer

Anirudha Subhash Karandikar

Marshall Smith

David Parker

Ronald P Wen

A method and apparatus for installing a network appliance. In one embodiment, the method includes copying an install image pertaining to the network appliance to an install staging area in a memory device of the network appliance, obtaining current installation object data from a server, and saving an up-to-date set of installation objects in the install staging area using the installation object data received from the server. The method may further include marking the install staging area as bootable, rebooting the network appliance, and installing from the install staging area onto the network appliance.

Image install of a network appliance

An advertisement platform system makes advertisement placement decision via context modeling. The advertisement platform system receives advertisements and a plurality of advertisement target pages, wherein each of the advertisements is associated with one of the advertisement target pages. Furthermore, the advertisement platform system computes a similarity metric between one of the advertisement target and a displayed page. The advertisement platform system selects one of the advertisements for display in the display page based on the computed similarity metric between one of the plurality of advertisement target that corresponds to the selected one of the advertisement and the display page.

Placing resources in displayed web pages via context modeling

An apparatus and a method for maintaining a file system is described. A method may include receiving a request for allocating a first block of a file system to a file, the first block comprising a first data from the file. The method also includes computing a first hash value by hashing the first data with a first hashing procedure and computing a second hash value by hashing the first data with a second hashing procedure. The method also includes using the first and the second hash values to determine whether a tree structure among a plurality of tree structures has a matching hash value among a plurality of hash values. Each of the plurality of hash values in the tree structure correspond to a block among a plurality of blocks stored in the file system. The method further includes in response to determining that the tree structure has the matching hash value, allocating the corresponding block to the file and updating a reference count of the corresponding block in the tree structure.

Deduplicated file system

An online advertisement system determines which of a plurality of advertisement clickthroughs are successful online events. A successful online event is based on an advertisement online reference and a success online reference. The system further correlates the number of successful online events for a traffic originator. In addition, the online advertisement system computes an advertisement penalty based on the computed correlation.

Collaborative optimization of online advertisement return on investment

An apparatus and a method for maintaining a file system is described. A method may include receiving a request for allocating a first block of a file system to a file, the first block comprising a first data and computing, by a processing device, a first hash value of the first block. The method also includes comparing, by the processing device, the first hash value with a plurality of hash values in a tree structure, wherein each of the plurality of values correspond to a block among a plurality of blocks stored in the file system. The method further includes in response to determining that a match exists between the first hash value and at least one of the plurality of hash values in the tree structure, allocating, by the processing device, the corresponding block to the file; and updating, by the processing device, a reference count of the corresponding block in the tree structure.

String hashing using a random number generator is disclosed. A method of implementations includes dividing an input stream provided to a hashing module into a plurality of subsets of bits, wherein each subset comprises a same number of bits and wherein each of the subsets of bits comprises an overlapping subset, augmenting a subset of the subsets of bits with a constant, entangling, by a mixer of the hashing module, the subset by an output of a number generator, adding a result of the entangling to an accumulator of the hashing module, repeating the augmenting, the entangling, and the adding on at least a portion of a next sequential subset of the subset of bits, and when all of the subsets of bits have been processed, returning a value in the accumulator as a hash result value.

String hashing using a random number generator

A server communicates with a network appliance. The server includes an agent. The network appliance sends a request to the agent. The request includes an identification of a port. The agent negotiates a secured communication channel with the network appliance on the identified port to retrieve further instructions from the network appliance. The instructions includes one or more commands. The server reports the results of the executed command to the network appliance on the initial channel.

Secured agent communications

Implementing aspects via callback in a virtual machine, where an aspect weaver weaves the aspect with a module to provide primary and crosscutting functionality in the runtime execution of the module. The virtual machine has multiple modules that are part of an application implementing separation of concerns. Each of the multiple modules has a distinct functionality portion and a common functionality portion, common to all modules. The common functionality is referenced by the virtual machine via callback for the multiple modules. Aspect code is loaded as a callback that is applied to the multiple modules by the virtual machine. Loading the aspect code as a callback can implement the aspect at any point in the modules, including conditional statements, calls to methods of objects or classes, loops, any point in an exception handler, or to monitor changes in variables.

Implementing aspects with callbacks in virtual machines

A search engine tracks search queries from a user received at the search engine to generate a search query history. A prediction engine compares the search query history from the user with search query histories from other users on the search engine. A predicted search query for the user that the user is predicted to use to perform a next search in relation to other possible searches is generated in view of the comparison. Search query histories of the other users with greater similarities to the search query history of the user have a greater computation weight in generating the predicted search query than the search query histories of the other users with fewer similarities to the search query history of the user.

Search prediction using context modeling

Some embodiments of automated recording and playback of application interactions have been presented. In one embodiment, an application proxy server communicatively coupled between an application server and a client records responses and requests between an application server and a client during a transaction. Furthermore, the application proxy server generates a script based on the responses and requests recorded.

Automated recording and playback of application interactions

A method and apparatus for scheduling processing jobs is described. In one embodiment, a scheduler receives a request to process one or more computation jobs. The scheduler generates a size metric corresponding to a size of an executable image of each computation job and a corresponding data set associated with each computation job. The scheduler adjusts a priority of each computation job based on a system configuration setting and schedules the process of each computation job according to the priority of each computation job. In another embodiment, the scheduler distributes the plurality of computation jobs on one or more processors of a computing system, where the system configuration setting prioritizes a computation job with a smaller size metric than a computation job with a larger size metric. In another embodiment, the scheduler distributes the computation jobs across a network of computing systems with one or more computation jobs distributed over one or more computing systems, where the system configuration setting prioritizes a computation job with a smaller size metric than a computation job with a larger size metric.

Scheduling network distributed jobs based on observing an allocated memory size and open files of a running computation job

An apparatus and a method for validating compressed encrypted archive keys is described. In one embodiment, a pseudo-stream is generated for an archive. The pseudo-stream is made of a small amount of random text. The pseudo-stream is attached to a stream of the archive. The pseudo-stream and stream are compressed using the compression algorithm that includes validation data. The compressed pseudo-stream is then enciphered with an archive key.

Validating compressed archive keys

An apparatus and a method for maintaining a file system is described. An allocation module receives a request from a kernel module to allocate a block of the file system to a file. The allocation module examines an other block of the file system to determine whether the other block contain a same data as the block. The allocation module also determines an external reference count of the other block containing the same data. The other block is then allocated to the file and the external reference count is updated accordingly.

A method and system distributes shares of a secret among cooperating entities using linear interpolation. In one embodiment, a linear equation is formed using the secret and random elements. The linear equation represents a K-dimensional hyperplane, where K is the number of shares to reconstruct the secret. Shares of the secrets are created, with each share corresponding to a point on the secret hyperplane. The shares are then distributed to cooperating entities for secret sharing.

Sharing a secret via linear interpolation

A networked projector system includes a projection display device, a projector computer, and a network adapter. The projector computer negotiates an IP address of a local network, and periodically broadcasts the IP address on the local network. The network adapter connects with a client on the local network with the IP address.

Growing community of inventors

Raleigh, NC, United States of America

James P Schneider