Yahoo! Inc.

International Business Machines Corporation

Excalibur Ip, LLC

Prabhakar Goyal

Jatin Patel

Ilya Slain

James Darrell Heath

Grama Kasturi Harish

Rampradeep Dodda

Prashant T R Rao

Vishwanath Venkataramappa

Sam P Hamilton

Eyal Ramakrishnan

Marcus F Doemling

Chakravarthy Jagannadhan

Sanjay Kumar Gupta

Sumit Mishra

Methods and Systems for facilitating caching of advertisements are described. The methods include receiving an ad request and generating a serving plan in response to said receiving the ad request. The serving plan includes multiple cache lines that identify corresponding advertisements. Each of the cache lines is associated with a corresponding expiration. Also, each cache line is readable by logic to display one of the advertisements corresponding to the cache line. The cache lines include a first cache line. The first cache line includes ad information, which is associated with a first one of the advertisements. Moreover, the ad information includes one or more parameters for expiration of the first cache line of a client device. The client device is configured to display the plurality of advertisements. The method includes sending the serving plan to the client device to store in the client device.

Methods and systems for facilitating caching of advertisements

A method, apparatus, and computer program product for measuring inline internet ad performance for third-party ad serving. The method comprises receiving an original third-party internet ad and recoding the original third-party internet ad for producing a recoded third-party internet ad where the recoded third-party internet ad comprises ad instrumentation code. In real-time, as the internet ad is composited and rendered, the instrumentation code measures the response latency of the server or servers in the third-party network using the ad instrumentation code. In some cases, the original third-party internet ad comprises ad code using a markup language such as HTML language, and/or JavaScript language (e.g. in ad code segments). The recoding comprises recoding an ad code segment of the ad by transforming the ad code segment into a JavaScript literal, which in exemplary embodiments includes emitting a specialized document.write( ) call. Response latency measurements are collected and included in a latency table.

Measuring inline ad performance for third-party ad serving

A system and method are disclosed for rotating an advertisement on a single page or screen. The advertisement may be rotated when the user is active on the page or screen. In addition, the advertisement that replaces the original ad may be based on the user's activity, or may be based on the content displayed in the page or screen. This system and method may increase advertising inventory that is displayed on a page or screen by displaying advertisements for a set time interval, which results in increased flexibility for sellers and buyers of online advertising.

Time slicing web based advertisements

A dynamic advertisement creative is generated from a static advertisement creative. An advertisement creative is received. The advertisement creative is decompiled into a plurality of static elements. A user is enabled to select a static element of the plurality of static elements to be converted into a dynamic element. A dynamic version of the received advertisement creative is generated that includes a placeholder corresponding to the selected static element. The placeholder is configured to be dynamically populated with data. The data populating the placeholder may be dynamically selected each time the dynamic advertisement creative is displayed.

Decompilation used to generate dynamic data driven advertisements

Systems and methods for acquiring, releasing, and reclaiming a lock of a data structure in a network file system ('NFS') are discussed. Generally, a text file is created in a management library of the data structure. The name of the text file includes an identifier of the lock, an identifier of a process attempting to acquire the lock, and an identifier of a machine on which the process attempting to acquire the lock is running. The identifier of the process attempting to acquire the lock and the identifier of the machine on which the process attempting to acquire the lock is running are is saved in the contents of the text file and a hard line is created pointing to the text file. Finally, a lock of the data structure is granted based on a number of links pointing to the text file.

System and method for resource lock acquisition and reclamation in a network file system environment

A system and method for automated recovery of processing of a unit of work during an error in a batch processing system is disclosed. Generally, at least a portion of a unit of work and instructions of operations to perform to process the portion of the unit of work is sent to a worker data structure. A periodic heartbeat is received from the worker data structure indicating the worker data structure is processing the at least a portion of the unit of work. If an unexpected termination of the worker data structure is detected, a signal is sent to a crash handler data structure instructing the crash handler data structure to detect and store a current input location of the at a portion of the unit of work. The records from the current location at the crash are skipped during reprocessing of the unit of work to increase the chances of success during reprocessing.

System and method for automated recovery after an error in a batch processing system caused by malformatted or unsupported data

A system and method for compressing portions of the operating system in a ROM image and for executing the system from the compressed image. Compression is used to reduce the size of the ROM image to reduce component cost. Low use segments are compressed. The operating system is initialized into a virtual address space with entries only for the uncompressed segments. Attempts to execute a compressed segment result in a page fault. The page fault handler determines that the segment is compressed, allocates a new page and decompresses the page into RAM for execution. The RAM copy of the segment is used for execution until the page is reused for another purpose. Later execution causes a new page fault and reallocation. A memory object reference is created for components of the image; a virtual memory page reference is then made for each component not in a compressed form; instructions are then executed by reference to the image; a page fault is detected when attempting to execute an instruction in a component not having a page table reference; a compressed image is then decompressed into the random access memory in response to the page fault.

Computer system and method for selectively decompressing operating

A method and apparatus for patching ROM pages using minimal RAM pages is accomplished by reserving a limited number of RAM pages which are shared to facilitate a patching process. The patching process begins when a flagged page of ROM (i.e., a page that is to be patched) is copied into one of the reserved pages of RAM. Having copied the flagged page, a patch file is accessed to retrieve updated code and outdated code of the flagged page. The process overwrites the outdated code with the updated code to produce a patched code. The patched code is read by a processor and is subsequently overwritten by another patched code that represents another flagged page of ROM.

Growing community of inventors

Sunnyvale, CA, United States of America

Prabhakar Goyal