Abstract: 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.

Abstract: A system and method for acquiring, releasing, and reclaiming a lock of a data structure in a network file system (“NFS”) is disclosed. Generally, a text file is created in a management library of the data structure. The name of the text file comprises 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 is saved in the contents of the text file and a hard line is created pointing to the text file. Finally, a number of links pointing to the text file is determined and a lock of the data structure is granted based on the number of links pointing to the text file.

Abstract: A system and method for automatic recovery of a unit of work in a batch processing system is disclosed. Generally, a unit of work is placed in a todo queue to store the unit of work for processing. Access to the unit of work is provided to a data structure for processing and the unit of work is moved from the todo queue to an in-progress queue. An error is detected in the processing of the unit of work and a retry count of the unit of work is compared to a maximum retry count of the unit of work. Finally, the unit of work is moved to the todo queue for re-processing or to a failed queue for further analysis based on the comparison of the retry count to the maximum retry count.

Abstract: 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.

Abstract: A system and method for providing transaction support across a plurality of data structures is disclosed. Generally, a transaction status directory indicating a transaction is in a prepare state is created. It is determined whether a first data structure is able to perform a first set of operations to complete the transaction. The first data structure is locked in response to determining the first data structure is able to perform the first set of instructions and instructions are sent to the first data structure to perform the set of operations. The first data structure is modified and a log of each modification of the first data structure is kept in case modification needs to be undone. It is then determined if a second data structure is able to perform a second set of operations to complete the transaction. In one embodiment, the second data structure is locked and instructions are sent to the second data structure to perform the set of operations.

Abstract: 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.

Abstract: 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.