Abstract: A method, system and computer program product for managing a batch processing job is presented. The method includes partitioning a batch processing job for execution by a cluster of computers. One of the computers from the cluster of computers is designated as a primary command server that oversees and coordinates execution of the batch processing job. Stored in an object data grid structure in the primary command server is an alarm setpoint, boundaries, waiting batch processes and executing batch process states. The object data grid structure is replicated and stored as a replicated object grid structure in a failover command server. If the primary command server fails, the failover command server freezes all of the currently executing batch processes, interrogates processing states of the cluster of computers, and restarts execution of the batch processes in the cluster of computers in accordance with the processing states of the cluster of computers.

Abstract: An encryption method encrypts a clear text twice using a first encryption engine to produce a first cipher text and a second encryption engine to produce a second cipher text. The method compares the first cipher text with the second cipher text, or compares a checksum of the first cipher text with a checksum of the second cipher text. If the comparison succeeds, the method transmits the data. In some embodiments, the method uses a first instance of an encryption key to produce the first cipher text and a second instance of the encryption key to produce the second cipher text.

Abstract: A technique for accessing a memory array includes receiving, from multiple requesters, memory access requests directed to a single port of the memory array. The memory access requests associated with each of the multiple requesters are serviced, based on a priority assigned to each of the multiple requesters, while maintaining a fixed timing for the memory access requests.

Abstract: A method, computer program product, and data processing system for performing efficient communication between software entities residing in the same operating system using conventional network communications APIs are disclosed. According to a preferred embodiment, when a software entity (e.g., a process) attempts to communicate through a networking API, the operating system determines whether the other end of the communication refers to the same hardware node. If so, the operating system replaces the network protocol connection (socket connection) with a direct interprocess communication construct. The operating system provides additional code to simulate the appearance of an actual network (socket) connection at the API level while performing all actual I/O using the interprocess communication construct.

Abstract: A method and system for configuring a cache memory system in order to efficiently process processor requests. A group of cache elements, which include a Region Cache, a Region Coherence Array, and a lowest level cache, is configured based on a tradeoff of latency and power consumption requirements. A selected cache configuration differs from other feasible configurations in the order in which cache elements are accessed relative to each other. The Region Cache is employed in a number of configurations to reduce the power consumption, latency, and bandwidth requirements of the Region Coherence Array. The Region Cache is accessed by processor requests before (or in parallel with) the larger Region Coherence Array, providing the region coherence state and power efficiently to requests that hit in the Region Cache.

Abstract: A presentation authoring tool is used to create presentation data for later projection, to determine a recommended font size for the created presentation data displayed on a display screen of a computer executing the presentation authoring tool. The user interface presents a display screen for receiving input of an expected viewing distance for the later projection of the presentation. The recommended font is determined based upon the expected viewing distance of the later projection having a projected font size viewable by a person, having a certain vision capability, at the expected viewing distance. The expected viewing distance may be a maximum viewing distance or a room depth of a room in which the later projection takes place.

Abstract: A method, a system and a computer program product for re-using verification results associated with a circuit design to eliminate a formal verification re-run associated with a subsequent verification of the circuit design. A Verification Data Re-use (VDR) utility initiates the creation of a first netlist data structure and a first set of target signatures for the circuit design. The VDR utility initiates an initial functional verification run of the circuit design and stores the results of the verification run. When a subsequent verification of the initial design is initiated, the VDR utility compares the first set of target signatures with a second set of target signatures for the subsequent verification run. A match of target signatures indicates that corresponding design targets have an identical functionality and the VDR utility re-uses verification results from the initial verification run to eliminate an extensive formal verification re-run for the circuit design.

Abstract: A system and method for selecting calendar events based on examining the content of a user's recent e-mail activity. According to an embodiment of the present invention, a scheduling manager assembles a keyword list, wherein the keyword list includes a collection of keywords with associated weights for each keyword among the collection of keywords. If the scheduling manager detects at least two conflicting calendar events scheduled within a calendar program, the scheduling manager searches the at least two conflicting calendar events for at least one keyword on the keyword list. The scheduling manager computes a keyword weight score for each of the at least two conflicting calendar events. If one calendar event among the at least two conflicting calendar events has a highest keyword weight score, the scheduling manager schedules the one calendar event within the calendar program.

Abstract: A method for providing audio-guided deployment of a data processing system is disclosed. An unpack instruction related to a data processing system in a first container for audio presentation is designated, and one or more position sensors in the first container are queried to determine whether the position sensors are spatially configured for audible presentation of the unpack instruction. In response to determining that the position sensors are not spatially configured for the audible presentation of the unpack instruction, a position sensor error message is audibly presented. One or more radio frequency sensors associated with the first container are queried to determine whether the first container contents are ready for audible presentation of the instruction, and in response to determining that the first container contents are not ready for audible presentation of the unpack instruction, a radio-frequency sensor error message is audibly presented.

Abstract: A data processing system for efficiently attaching files to electronic mail message. In a multi-level hierarchical file storage system within the data processing system wherein one or more files may be active, only those files, which are active, are initially proffered as candidates for attachment in response to a user's indicated desire to attach a file to an electronic mail message. If the user fails to select an active file for attachment, the user is prompted to select a file from the multi-level hierarchical file storage system for attachment. After attachment, the electronic mail message and attachment are transmitted.

Abstract: A method for performing verification includes selecting a first set containing a seed register and adding to a second set a result of a subtraction of a fanout of the first set from a fanin of the first set. A third set is rendered equal to a result of a subtraction of a fanin of the second set from a fanout of the second set, and whether a combination of the first set and the third set is equivalent to the first set is determined. In response to determining that the combination of the first set and the second set is not equivalent to the first set, a min-cut of the first set and the second set containing a minimal set of predicates between a first component and the logic to which the component fans out, wherein the logic is bordered by the second set is returned.

Abstract: A method of dynamic real time translation of first program code written for a first programmable machine into second program code (target code) for running on a second programmable machine employing run time generation of an intermediate representation of the first program code. Upon first encountering a given portion of program code, only the target code necessary to execute that portion of program code under a prevailing set of entry conditions is initially generated and stored. When the same portion of program code is again encountered, a determination is made as to whether intermediate representation corresponding to a second subsequent set of conditions has been generated. If not, the target code necessary to execute the same portion of program code under that second set of conditions is generated.

Abstract: A method of building compound extensible Asynchronous JavaScript And eXtensible Markup Language (AJAX) applications. A server-side web component utility searches an extension registry for Jazz web User Interface (UI) components and generates cached strings of JavaScript code based on the Jazz web UI components. When a browser accesses a Jazz web UI home page, the web component utility uses script tags to download the cached strings of JavaScript code. The web component utility executes the cached strings of JavaScript code and registers multiple available Jazz web UI components with an AJAX package management system. The web component utility serializes a subset of the extension registry that includes multiple extension points declared within the available Jazz web UI components. The Jazz web browser-based functionality downloads the extension registry subset data, parses the data, and makes the data available through one or more JavaScript Application Programming Interfaces (APIs).

Abstract: A method and service for handling incoming customer calls. The invention uses an Access Point Model (APM) that includes an inventory of access entry points for voice, text, and/or web communication from a customer; a process network that lists the names and roles of customer contacts within the enterprise; an APM diagram of optimized pathways to be taken by particular incoming customer calls; rules for the customer contacts to follow when handling the incoming customer calls; and a synchronization of the customer calls with back-end processes within the enterprise that are responsive to instructions from the customer contacts.

Abstract: A technique for providing presentation material in an on-going virtual meeting includes converting a real-world (RW) presentation into a virtual-world (VW) presentation. A media format of the VW presentation corresponds to a media format utilized by a target VW. The VW presentation is then stored in an RW media repository. The VW presentation is associated with an RW media uniform resource locator (URL). A VW screen control script is used to set a VW media URL associated with a VW screen parcel to the RW media URL. The VW presentation is then provided to participants of the VW meeting by accessing the RW media repository using the VW media URL.

Abstract: A method of and system for preventing viewing by bystanders of information displayed on a display screen displays simultaneously an active image and a second image. The display screen has a first viewing angle and a second viewing angle. The first image is visible from the first viewing angle and invisible from said second viewing angle. The obfuscating image is invisible from the first viewing and visible from the second viewing angle. The system simultaneously manipulates the first and obfuscating images in response to input by a user.

Abstract: Methods, data processing systems, and program products supporting the insertion of clone latches within a digital design are disclosed. According to one method, a parent latch within the digital design is specified in an HDL statement in one of the HDL files representing a digital design. In addition, a clone latch is specified within the digital design utilizing an HDL clone latch declaration. An HDL attribute-value pair is associated with the HDL clone latch declaration to indicate a relationship between the clone latch and the parent latch according to which the clone latch is automatically set to a same value as the parent latch when the parent latch is set. Thereafter, when a configuration compiler receives one or more design intermediate files containing the clone latch declaration, the configuration compiler creates at least one data structure in a configuration database representing the clone latch and the relationship between the clone latch and the parent latch.

Abstract: Disclosed are a method, a system and a computer program product for dynamically allocating and/or de-allocating resources and/or partitions that provide I/O and/or active storage access services in a supercomputing system. The supercomputing system can include multiple compute nodes, high performance computing (HPC) switches coupled to the compute nodes, and active non-volatile storage devices coupled to the compute nodes. Each of the compute nodes can be configured to communicate with another compute node through at least one of the HPC switches. In one or more embodiments, each of at least two compute nodes includes a storage controller and is configured to dynamically allocate and de-allocate a storage controller partition to provide storage services to the supercomputing system, and each of at least two compute nodes includes an I/O controller and is configured to dynamically allocate and de-allocate an I/O controller partition to provide I/O services to the supercomputing system.

Abstract: According to a method of data processing in a multiprocessor data processing system, in response to a processor request to read a target granule of a target cache line of data containing multiple granules, a processing unit originates on an interconnect of the multiprocessor data processing system a partial read request that requests permission to read only the target granule of the target cache line. In response to a combined response to the partial read request indicating success, the combined response representing a system-wide response to the partial read request, the processing unit receives the target granule of the target cache line, supplies the target granule to a requesting processor core, and updates a coherency state of the target granule while retaining a coherency state of at least one other granule of the target cache line.

Abstract: A method, system and computer program product are disclosed for simulating a storage area network including a set of correlated devices, each of the devices having a device agent. The method comprises the step of forming a set of simulation agents representing said device agents, including the steps of, (i) for each of the simulation agents, obtaining a set of agent profiles, and storing said agent profiles in a data store, and (ii) obtaining files describing class definitions for the simulation agents, and storing said files in the data store. With this information and data, a Visual Workbench is used to generate a display of said simulation agents. The preferred embodiment provides a framework and implementation that simulates the CIM agent of any SAN device. Each individual device CIM agent can be simulated in this framework based on the specification defined in an XML file and/or through snapshot mechanism.