HIGH PERFORMANCE INTEGRATED CIRCUIT CHIP PACKAGE AND METHOD OF MAKING SAME

A high performance integrated circuit chip package includes a support substrate having conductors extending from one face to the opposite face thereof and a multilayer wiring substrate on the opposite face of the support substrate for connecting chips mounted thereon to one another and to the conductors. A heat sink includes microchannels at one face thereof, with thermally conductive cushions connecting the one face of the heat sink with the exposed back sides of the chips, to provide a high density chip package with high heat dissipation. The multilayer wiring substrate may be formed by a self-aligned thin film wiring method, with a self-aligned lift off method being employed to form internal wiring planes. The support substrate and heat sink may be formed of blocks of material having thermal expansion matching silicon. The cushions are a low melting point solder, preferably pure indium, and are sufficiently thick to absorb thermal stresses, but sufficiently thin to efficiently conduct ...

HIGH-RATE RLL ENCODING

An unencoded m-bit data input sequence is divided into a block of n bits and a block of m−n bits. The block of n bits is divided into a first set of n+1 encoded bits, wherein at least one of P1 subblocks of the first set satisfies a G, M and I constraints. The first set of n+1 encoded bits is mapped into a second set of n+1 encoded bits wherein at least one of P2 subblocks of the second set gives rise to at least Q1 transitions after 1/(1+D2) preceding. A second set of n+1 encoded bits is divided into P3 encoded subblocks and the P3 encoded subblocks are interleaved among (m−n)/s unencoded symbols so as to form a (m+1)-bit output sequence codeword which is then stored on a data storage medium.

Optimized deployment of analytic models in an edge topology

Provided are techniques for optimized deployment of analytic models in an edge topology. A description of a multi-tiered edge topology with a plurality of nodes, a multimedia stream analytics composition, and performance objectives are received, where the multimedia stream analytics composition includes tasks that use analytic models. The analytic models are optimized and clustered to form clusters of optimized analytic models. A representative optimized analytic model is selected from each of the clusters. A configuration recommendation is determined that indicates deployment of the tasks and of each selected representative optimized analytic model on the plurality of nodes to meet the performance objectives. One or more workflows are generated from the configuration recommendation and executed on the plurality of nodes to generate output for the multimedia stream analytics composition.

Tunable quantum coupler facilitating a quantum gate between qubits

Devices and/or computer-implemented methods to facilitate a quantum gate between qubits using a tunable coupler and a capacitor device are provided. According to an embodiment, a quantum coupler device can comprise a tunable coupler coupled between terminals of a same polarity of a first qubit and a second qubit, the tunable coupler configured to control a first coupling between the first qubit and the second qubit. The quantum coupler device can further comprise a capacitor device coupled to terminals of an opposite polarity of the first qubit and the second qubit, the capacitor device configured to provide a second coupling that is opposite in sign relative to the first coupling.

DYNAMIC DELIVERY OF WAYPOINT DATA ASSOCIATED WITH TRAVEL RESERVATIONS

Capabilities are added to a travel reservation system by delivering a traveler's destination information to a car reservation company computer for subsequent downloading as waypoint data into a global positioning system (GPS) device in the car being rented by the traveler. The traveler creates a travel itinerary, including a request for a rental car at a first destination and a second destination to which the traveler will drive the car. Information about the destinations is transmitted to the rental car company for downloading into a GPS receiver in the rental car for use by the traveler.

Cross Domain Single Sign On

The present application provides a method and system for Cross Domain Single Sign On. The method comprises: receiving a request from a user to a service provider; processing the user request prior to relaying the request to the service provider; forwarding the processed request to the corresponding service provider according, to the type of request; in response to receiving a response to the request from the service provider, processing the response, and forwarding the processed response to the user. By adopting the method and system of the present application, a Single Sign On management proxy is introduced as a united management system for a session lifetime of the user. The SSO management proxy manages operations of logging in, checking a session expiration and recovering, logging out, URL mapping, error processing, and access control, and effectively improves the availability, security, functional continuity of the service as well as the user's experience. 1. A method for processing Single Sign On via a computing device , wherein at least one service provider to be accessed by a user is located in at least one domain , the method comprising:receiving a user request for at least one service provider from the user;the computing device processing the request according to the type of request;sending the processed user request to the service provider;receiving a response from the service provider; andsending the response to the user request back to the user.2. The method as claimed in claim 1 , wherein processing the request according to the type of the request further comprises: in response to the request being an initial access request to a designated service provider claim 1 , generating a Single Sign On token for accessing the service provider and adding the Single Sign On token to the received user request to generate the processed user request.3. The method as claimed in claim 1 , wherein:processing the request according to the type of the request further ...

Neural network weight distribution from a grid of memory elements

Neural inference chips for computing neural activations are provided. In various embodiments, a neural inference chip comprises at least one neural core, a memory array, an instruction buffer, and an instruction memory. The instruction buffer has a position corresponding to each of a plurality of elements of the memory array. The instruction memory provides at least one instruction to the instruction buffer. The instruction buffer advances the at least one instruction between positions in the instruction buffer. The instruction buffer provides the at least one instruction to at least one of the plurality of elements of the memory array from its associated position in the instruction buffer when the memory of the at least one of the plurality of elements contains data associated with the at least one instruction. Each element of the memory array provides a data block from its memory to its horizontal buffer in response to the arrival of an associated instruction from the instruction buffer ...

Enhanced Coherency Tracking with Implementation of Region Victim Hash for Region Coherence Arrays

A method and system for precisely tracking lines evicted from a region coherence array (RCA) without requiring eviction of the lines from a processor's cache hierarchy. The RCA is a set-associative array which contains region entries consisting of a region address tag, a set of bits for the region coherence state, and a line-count for tracking the number of region lines cached by the processor. Tracking of the RCA is facilitated by a non-tagged hash table of counts represented by a Region Victim Hash (RVH). When a region is evicted from the RCA, and lines from the evicted region still reside in the processor's caches (i.e., the region's line-count is non-zero), the RCA line-count is added to the corresponding RVH count. The RVH count is decremented by the value of the region line count following a subsequent processor cache eviction/invalidation of the region previously evicted from the RCA.

SYSTEM AND SERVICE TO FACILITATE ENCRYPTION IN DATA STORAGE DEVICES

An encryption communications appliance provides data encryption management for a data storage library. The appliance is coupled to an encryption-capable storage device, a data storage library controller within the data storage library and with an encryption key manager (EKM). The encryption command communications appliance intercepts encryption key requests from the data storage device and transparently forwards the requests to the EKM. The appliance also forwards transparently communications between the library controller and the data storage device.

Mechanism for NPIV Client Recovery When NPIV Server Goes Down

With N_Port ID Virtualization (NPIV), a managed system can he configured so that multiple logical partitions (LPARs) can access independent physical storage through the same physical fibre channel adapter. An NPIV client recovery component of a virtualization management component, such as a Power Hypervisor (pHYP), provides the emulation mapping between server and client virtual fibre channel adapters. The pHYP also provides a mechanism that prevents client partition crashes when the NPIV server (e.g., a VIOS logical partition) goes down. When the NPIV server is rebooted or powers down, the pHYP handles the client LPARs to avoid a crash by removing processing resources from the client logical partition. Thereby, the client logical partition is prevented from attempting to access a root volume group in physical storage via the NPIV server. The pHYP allocates processor resources to the client LPAR when the NPIV server is again available for I/O processing. 1. A computer implemented method comprising:abstracting hardware resources to an operating system of a client logical partition;pairing a client virtual input/output adapter of the client logical partition and a server virtual input/output adaptor of a virtual input/output server partition;dispatching a virtual process of the operating system of the client logical partition to the hardware resources for processing;detecting an event that interrupts processing of the virtual input/output server partition;in response to detecting an event that interrupts processing of the virtual I/O server partition, discontinuing dispatch of the virtual process of the operating system of the client logical partition to the hardware resources for processing to prevent the client from attempting to utilize the virtual input/output adapter;detecting an end of the event that interrupts processing of the virtual input/output server partition; andin response to the detecting of the end of the event, resuming dispatching of the virtual ...

Low-power band-gap reference and temperature sensor circuit

A combined low-voltage, low-power band-gap reference and temperature sensor circuit is provided for providing a band-gap reference parameter and for sensing the temperature of a chip, such as an eDRAM memory unit or CPU chip, using the band-gap reference parameter. The combined sensor circuit is insensitive to supply voltage and a variation in the chip temperature. The power consumption of both circuits, i.e., the band-gap reference and the temperature sensor circuits, encompassing the combined sensor circuit is less than one muW. The combined sensor circuit can be used to monitor local or global chip temperature. The result can be used to (1) regulate DRAM array refresh cycle time, e.g., the higher the temperature, the shorter the refresh cycle time, (2) to activate an on-chip or off-chip cooling or heating device to regulate the chip temperature, (3) to adjust internally generated voltage level, and (4) to adjust the CPU (or microprocessor) clock rate, i.e., frequency, so that the chip ...

Interdependent Task Management

An illustrative embodiment of a computer-implemented process for interdependent task management selects a task from an execution task dependency chain to form a selected task, wherein a type selected from a set of types including “forAll,” “runOnce” and none is associated with the selected task and determines whether there is a “forAll” task. Responsive to a determination that there is no “forAll” task, determines whether there is a “runOnce” task and responsive to a determination that there is a “runOnce” task further determines whether there is a semaphore for the selected task. Responsive to a determination that there is a semaphore for the selected task, the computer-implemented process determines whether the semaphore is “on” for the selected task and responsive to a determination that the semaphore is “on,” sets the semaphore “off” and executes the selected task. 1. A computer-implemented process for interdependent task management , the computer-implemented process comprising:selecting a task from an execution task dependency chain to form a selected task, wherein a type selected from a set of types including “forAll,” “runOnce” and none is associated with the selected task;determining whether there is a “forAll” task;responsive to a determination that there is no “forAll” task, determining whether there is a “runOnce” task;responsive to a determination that there is a “runOnce” task; determining whether there is a semaphore for the selected task;responsive to a determination that there is a semaphore for the selected task, determining whether the semaphore is “on” for the selected task;responsive to a determination that the semaphore is “on,” setting the semaphore “off;” andexecuting the selected task.2. The computer-implemented process of wherein selecting a task from an execution task dependency chain to form a selected task further comprises:receiving a source code to form a received source code;parsing dependencies in the source code;computing an ...

Electron holography method

An inline electron holograph method for observing a specimen with a transmission electron microscope having an electron gun, a collimating lens system, two spaced objective lenses, a biprism, and an imaging means comprises the steps of: with the first objective lens forming a virtual image of a portion of the specimen; with the second objective lens focussing the virtual image at an intermediate image plane to form an intermediate image; and projecting the intermediate image onto the imaging means.

System and method of timecode repair and synchronization in MPEG streams

A method, apparatus and article of manufacture is provided for processing a previously encoded MPEG video high-resolution (HR) file and corresponding proxy file, for frame accurate timecode repair and synchronization of individual video frames of the HR and proxy files. Each video frame header of the HR and proxy files is modified by a compressed timecode packet having an identifying signature, an absolute timecode of the frame, and a relative timecode of the frame. The timecodes have the SMPTE timecode format HH:MM:SS:FF. The method automatically verifies the timecodes in the HR and proxy files timecode packets. If a repair of the HR file anomalous absolute timecodes is needed, the method automatically corrects the anomalous absolute timecodes in the HR file. If the proxy file starting video frame is offset from the HR file starting video frame, the method automatically synchronizes the proxy and the HR files absolute and relative timecodes.

A method, apparatus and computer program for verifying the order of a queue of work items

PRODUCING A CHANNEL STRUCTURE FORMED BY A PLURALITY OF RUNGS STRAINED SEMICONDUCTOR

Procédé de réalisation d'une structure à barreaux semi-conducteurs apte à former au moins un canal de transistor, comprenant des étapes consistant à : a) réaliser une structure semi-conductrice formée d'une alternance de premiers barreaux à base d'un premier matériau et de deuxièmes barreaux à base d'un deuxième matériau, le deuxième matériau étant un matériau semi-conducteur, puis b) retirer des portions de la structure à base du premier matériau dévoilées par une ouverture dans un masquage formé sur la structure, le retrait étant réalisé par gravure sélective dans l'ouverture du premier matériau vis-à-vis du deuxième matériau, de sorte à libérer un espace autour des deuxièmes barreaux, puis c) faire croitre, dans l'ouverture, un matériau semi-conducteur (25) donné autour des deuxièmes barreaux (6c), le matériau semi-conducteur donné ayant un paramètre de maille différent de celui du deuxième matériau (7), de sorte à induire une contrainte sur les gaines à base du matériau semi-conducteur ...

System and method of using a plurality of sensors for determining an individual's level of productivity

A system is provided having a plurality of sensors for affixing to a person's torso, hands, feet, head, etc. The function of each sensor is to determine the distance between itself and the other sensors to ascertain the distance between the hands and feet, for instance, in order to measure the relative activity of a person's hands and feet. Other sensors, placed on the individual or in the individual's environment, may obtain biological data relating to the person, such as heart pulse, blood pressure, or data relating to the individual's attention level, i.e., gaze data. The system further includes a processor having a memory for storing data collected from the sensors. The data collected by the sensors and stored in the memory provide at least information about different types of movements associated with a particular set of tasks. The processor is programmed with a set of instructions to relate the movements associated with work with different levels of productivity, and even different ...

Remote monitoring of computer programs

Systems and methods for remotely monitoring the execution of computer programs are provided. Monitoring instructions are added the computer program so that during execution of the program, data may be collected regarding the program execution. The collected data may be automatically sent to a remote system or site for analysis. The monitoring instructions create little or no performance impact on the client yet provide valuable information to the developer of the program. Additionally, the monitoring instructions may be changes during computer program development. ...

METHOD OF ASCERTAINING PRIMARY CAUSE OF MEMORY CONSUMPTION IN PROGRAM, AND COMPUTER SYSTEM AND COMPUTER PROGRAM FOR THE SAME

A method of holding information for identifying a cause for an object becoming problematic and presenting the information to a user. The method ascertains the cause of memory consumption by a program in a computer system. This method includes: acquiring a first call path related to the creation of an object from a memory; acquiring a second call path related to the connection to the object from the memory; and determining a common part of the acquired first and second call paths, wherein the common part indicates the cause in the program.

Hibernation and Remote Restarting Hibernation Data in a Cluster Environment

Hibernation and remote restore functions of a client logical partition (LPAR) that exists within a data processing system having cluster-aware Virtual Input/Output (I/O) Servers (VIOSes) is performed via receipt of commands via a virtual control panel (VCP) through an underlying hypervisor. The client hibernation data file is stored in a shared repository by a source/original VIOS assigned to the client. The hypervisor receives a remote restart command and assigns a target/remote client LPAR and a target VIOS. The source I/O adapters and target I/O adapters are locked and the target VIOS gathers adapter configuration information from the source VIOS and configures the target adapters to be able to perform the I/O functionality provided by the source adapters to the client LPAR. The target VIOS then retrieves the client's hibernation data file, and the client LPAR is restored at the remote LPAR with the target VIOS providing the client's I/O functionality.

METHOD AND APPARATUS FOR SAVING DEVICE STATE WHILE A COMPUTER SYSTEM IS IN SLEEP MODE

A serializable object, formed by a device driver and containing characteristics (device state) of the device, is held by a device driver and made known to a data processing system's power manager. The power manager provides a device driver independent mechanism for saving device state by retrieving each device driver's object containing device state and storing the object in a location that provides for efficient and quick retrieval. The power manager, being aware of power levels for all devices on the system, may determine where, how and when to store objects retrieved from the device drivers for most efficient retrieval. Upon receiving an interrupt indicating the system should power up, the serializable objects are retrieved by the power manager and restored to each device driver.

Method and System to Recover a Failed Flash of a Blade Service Processor in a Server Chassis

A method and system for recovering a server blade, in a multiple server blade computer, that is lost during a flash update operation on a service processor in the server blade. Because of the flash update failure, the lost server blade is unaware of its location on a management pathway, which in an exemplary form may be a midplane or a bus, which connects the server blade and a management module in a server blade chassis. The lost server blade puts a signal on the management pathway indicating that the flash failed. The signal is put on a special channel reserved for such messages. The management module receives the signal, and then determines which of the multiple server blades are lost due to the flash update failure.

SYSTEMS, METHODS, AND COMPUTER READABLE MEDIA FOR CONSISTENTLY RENDERING USER INTERFACE COMPONENTS

A system, method, and computer readable medium are provided for consistently rendering graphical user interface (GUI) components from disparate web server delivery mechanisms. To this end, a Javascript script is downloaded with a web page and, when executed, accesses a style sheet which is typically used when displaying HTML. From the style sheet, the Javascript script retrieves GUI information describing the look and feel of the user interface components composing the web page. Utilizing an application programming interface (API), a downloaded Java® applet retrieves the GUI information from the Javascript script. The Java® applet utilizes the retrieved GUI information to render subsequent GUI screens.

METHOD FOR DYNAMICALLY THROTTLING TRANSACTIONAL WORKLOADS

Systems () and methods () for managing transactional processing. The methods involve executing a first transaction () which is blocked by an exclusive lock of at least one second transaction () from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction. 1. A method for managing transactional processing , comprising:executing a first transaction which is blocked by an exclusive lock of at least one second transaction from accessing at least one of a plurality of resources of a Transaction Processing System (“TPS”);determining whether a first Service Level Agreement (“SLA”) associated with the first transaction is being met;identifying which of the plurality of resources are needed by the first transaction if it is determined that the first SLA is not being met;identifying all transactions that are currently being executed and that are using the resources needed by the first transaction; anddynamically slowing down or speeding up at least one of the transactions which was previously identified as a transaction that is currently executing and using the resources needed by the second transaction.2. The method according to claim 1 , wherein at least one of the first transaction and the second transaction is a long running transaction in which batches of N records are processed in a plurality of iterations ...

Autonomic recovery of PPRC errors detected by PPRC peer

A method for initiating a data storage facility recovery process in a data processing system having a first peer data storage facility and a second peer data storage facility communicating with the first peer data storage facility by a communication link. The method of initiating a recovery process is invoked by one peer data storage facility upon another peer data storage facility operating under a peer to peer remote copy (PPRC) protocol. Data copied from a first peer data storage facility to a second peer data storage facility is monitored for errors. Upon detection of an error by one peer data storage facility, recovery and data collection operations are initiated on the other peer data storage facility. Preferably, the initiation of recovery and data collection operations occurs out of band, over a second communication link between the peer data storage facilities.

Method for avoiding aliased tokens during abnormal communications

A data initiator device designates an initial data tag set for tagging data transfers to thereby attach data tags from the designated set to commands directed to data transfers between the data initiator device and a data target device subsequent to the designation of the initial data tag set. The data transfer commands are issued with the attached data tags from the designated data tag set until an occurrence of a reset error associated with one of the issued data transfer commands. In response to the reset error, the data initiator device designates a different data tag set for tagging data transfers to thereby attach data tags from the newly designated data tag set to commands directed to data transfers between the data initiator device and the data target device subsequent to the designation of the new data tag set.

ECC INTERLEAVING FOR MULTI-TRACK RECORDING ON MAGNETIC TAPE

Conventional C2 coding and interleaving for multi-track data tape in LTO-¾ do not support recording data onto a number of concurrent tracks which is not a power of two. Higher-rate longer C2 codes, which do not degrade error rate performance, are provided. An adjustable format and interleaving scheme accommodates future tape drives in which the number of concurrent tracks is not necessarily a power of two. A data set is segmented into a plurality of unencoded subdata sets and parity bytes are generated for each row and column. The parameters of the C2 code include N2 as the least common multiple of the number of possible tracks to which codeword objects are to be written. COs are formed from N2 C1 codewords, mapped onto a logical data track according to information within headers of the CO and modulation encoded into synchronized COs which are written to the tape.

REAL-TIME NOTIFICATION OF DEVICE EVENTS

Real-time notification is provided of an event which has occurred in a computer-related device. Upon the occurrence of an event, a record of the event is stored in a buffer, such as a Really Simple Syndication buffer, associated with the device. The buffer is updated based on indications and other events noted by a CIM agent in the device. One of a series of regular requests is received from an open browser window on a user computer, the request inquiring about any record of the event stored in the buffer. In response to the request, the record of the event is transmitted to an HTML event element in a page of the browser window whereby the record of the event is inserted into the HTML element and displayed in the browser window.

Method of making a semiconductor device

An improved method of making interconnect structures with self-aligned vias in semiconductor devices utilizes sidewall image transfer to define the trench pattern. The sidewall height acts as a sacrificial mask during etching of the via and subsequent etching of the trench, so that the underlying metal hard mask is protected. Thinner hard masks and/or a wider range of etch chemistries may thereby be utilized.

COMBINING INFORMATION FROM PARALLEL SERVO CHANNELS

A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module comprises two synchronous servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted parameter estimate and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. An offset computation module provides first and second offset terms which are summed with the unweighted parameter estimates. Multiplying nodes receive the unweighted parameter estimates and the weight signals and outputs offset weighted parameter estimates. A summing node receives the offset weighted parameter estimates and outputs a combined offset weighted parameter estimate to a servomechanism.

Arbiter circuitry and method to reduce latency when processing direct memory access requests on a main memory of a data processing system

Address resolution in ad-hoc networking

A method, system, and computer program product for resolving address information in an ad-hoc networking environment. Two indicators are defined to indicate whether (1) a device has a self-assigned (i.e. auto-configured) IP (Internet Protocol) address and (2) the device has an administered IP address (i.e. an IP address configured by an administrator or assigned by a service such as a Dynamic Host Configuration Protocol service). These indicators are communicated, along with a device's IP host name, IP address, subnet, and subnet mask, preferably as augmented information of existing protocol messages. The information may be communicated during establishment of the data link layer connection between two devices, or it may be communicated during service discovery protocol exchanges between two devices, or in a combination thereof.

Slave Mode Thermal Control with Throttling and Shutdown

Within a group of components in a circuit, each component in the group has a thermal detector that describes whether that component is operating at a temperature that is normal, high or fatal. A first signal representing a first component's temperature is sent downstream to a second component in the group. If the second component is operating at the first component's temperature or lower, then the first signal is passed on downstream from the second component. However, if the second component is at a higher temperature, then the second component generates a second signal that represents the second component's temperature, and sends that second signal downstream. A signal representing the highest temperature detected in the group eventually reaches a master controller that, depending on the signal received from the group, lets the group continue to operate normally, throttles the group down, or else shuts the group down.

Method and system for message content delivery

Distributed management communication system and method

Identifying a user of a charging station

Systems, methods, and other embodiments associated with identifying a user of a charging station. According to one embodiment, a system includes a communication logic and an authorization logic. The communication logic aggregates transaction data to an authorizing entity. The transaction data is associated with a user and a chargeable vehicle. The authorization logic receives an authorization request to authorize a transaction between the chargeable vehicle and the charging station. The authorization logic sends a response to the authorization request. The communication also enables the chargeable vehicle to receive a charge from the charging station based on the response to the authorization request.

Video conferencing using camera environment panoramas

Image data is communicated from a source system to a target system. At the source system, a background environment map is generated and communicated to the target system. The source system then captures a source image from position and field of view of a camera. In addition, the background environment map is rendered according to the position and field of view of the camera to generate a background image visible for the position and field of view of the camera. A difference image is generated representing difference between the source image and the background image. Finally, the difference image and the position and field of view of the camera is communicated to the target system. At the target system, the background environment map is received from the source system. In addition, the difference image and the position and field of view of the camera is received from the source system. The background environment map is rendered according to the position and field of view of the camera to ...

DOMAIN-BASED ISOLATION AND ACCESS CONTROL ON DYNAMIC OBJECTS

A technique for performing domain-based access control for granular isolation on a data processing system includes assigning, using the data processing system, one or more first domain tags to a dynamic object that is created by a first process that is executing on the data processing system. The technique also includes assigning, using the data processing system, one or more second domain tags to a second process that is executing on the data processing system. The first and second domain tags are evaluated, using the data processing system, according to one or more enforced rules to determine whether to grant or deny the second process access to data associated with the dynamic object. 1. A method of performing domain-based access control for granular isolation on a data processing system , comprising:assigning, using the data processing system, one or more first domain tags to a dynamic object that is created by a first process that is executing on the data processing system;assigning, using the data processing system, one or more second domain tags to a second process that is executing on the data processing system; andevaluating, using the data processing system, the first and second domain tags according to one or more enforced rules to determine whether to grant or deny the second process access to data associated with the dynamic object.2. The method of claim 1 , wherein the dynamic object is an inter-process communication claim 1 , a temporary file claim 1 , or a directory.3. The method of claim 2 , wherein the inter-process communication includes a semaphore claim 2 , a message queue claim 2 , or a shared memory.4. The method of claim 1 , wherein the one or more enforced rules include a first rule that specifies that a domain set of the dynamic object is required to be a subset of a domain set of the second process.5. The method of claim 4 , wherein the one or more enforced rules include a second rule that specifies that the domain set of the dynamic ...

Slider and disk storage apparatus with the slider

Unified SRAM cache system for an embedded DRAM system having a micro-cell architecture

A unified SRAM cache system is provided incorporated several SRAM macros of an embedded DRAM (eDRAM) system and their functions. Each incorporated SRAM macro can be independently accessed without interfering with the other incorporated SRAM macros within the unified SRAM cache system. The incorporated SRAM macros share a single set of support circuits, such as row decoders, bank decoders, sense amplifiers, wordline drivers, bank pre-decoders, row pre-decoders, I/O drivers, multiplexer switch circuits, and data buses, without compromising the performance of the eDRAM system.

METHOD TO DYNAMICALLY DISTRIBUTE A MULTI-DIMENSIONAL WORK SET ACROSS A MULTI-CORE SYSTEM

A method provides efficient dispatch/completion of an N Dimensional (ND) Range command in a data processing system (DPS). The method comprises: a compiler generating one or more commands from received program instructions; ND Range work processing (WP) logic determining when a command generated by the compiler will be implemented over an ND configuration of operands, where N is greater than one (1); automatically decomposing the ND configuration of operands into a one (1) dimension (1D) work element comprising P sequentially ordered work items that each represent one of the operands; placing the 1D work element within a command queue of the DPS; enabling sequential dispatching of 1D work items in ordered sequence from to one or more processing units; and generating an ND Range output by mapping the 1D work output result to an ND position corresponding to an original location of the operand represented by the 1D work item.

ERROR CORRECTION CAPABILITY FOR LONGITUDINAL POSITION DATA IN A TAPE STORAGE SYSTEM

A longitudinal position (LPOS) word L(n) is encoded with error correction capability. The LPOS word includes a plurality of LPOS symbols L0(n) through Lk(n) calculated as L  ( n ) = ∑ i = 0 5  L i  ( n )  14 i and representing a longitudinal position of a magnetic tape relative to a tape head in a tape storage system. A word type is determined in response to at least one of the plurality of LPOS symbols and, in response to the determined word type, at least one formatted symbol F(n) is generated from the plurality of LPOS symbols L(n). At least one parity symbol P(n) is generated from the formatted symbol F(n). The formatted and parity symbols are communicated to a servo channel of the tape storage system to be recorded onto a servo track of the magnetic tape. Adding redundancy to LPOS words provides the capability of correcting multiple bit errors without increasing the LPOS word length.

Centrally Controlled Proximity Based Software Installation

An illustrative embodiment of a computer-implemented process for a centrally controlled proximity based software installation receives a request to install a software package, sends a list of machines associated with the received request to a rules engine and generates a set of proximity groups using the list of machines. The computer-implemented process uploads the software package of the received request to a selected machine within a proximity group of the set of proximity groups, instructs the selected machine to install the software package and instructs the remaining machines associated with the proximity group of the selected machine to download the software package from the selected machine and to install the software package. Responsive to a determination that no more requests exist, the computer-implemented process reports to a central installer. 1. A computer-implemented process for a centrally controlled proximity based software installation , the computer-implemented process comprising: 'generating a set of proximity groups using a list of machines;', 'receiving a request to install a software package;'}uploading the software package of the received request to a selected machine within a proximity group of the set of proximity groups;instructing (a) the selected machine to install the software package and (b) the remaining machines associated with the proximity group of the selected machine to download the software package from the selected machine;instructing the remaining machines to install the software package; andresponsive to a determination that no more requests exist, reporting to a central installer.2. The computer-implemented process of claim 1 , wherein generating a set of proximity groups using the list of machines further comprises:sending the list of machines associated with the received request to a rules engine;determining whether the list of machines can be categorized into a set of proximity groups; andresponsive to a determination ...

SYSTEM FOR EFFECTIVE MEETING INVITEE RESPONSE STATUS

A system for visually representing an event as part of a larger schedule (e.g., calendar). The representation of the particular event may include an indicator configured to display invitee status. Functionality may also be configured to provide additional information, for example, by user interaction. In at least one instance, a user may move a mouse over the invitee status indicator to trigger a pop-up box with the additional information. Additional functionality, that may be implemented alone or in conjunction with the above exemplary embodiments of the present invention, may include the automatic execution of an activity in view of a threshold condition related to the event. For example, when an event is created, a threshold condition pertaining to one or more characteristics of the event and/or an activity may be configured. When the threshold condition is met and/or exceeded, the configured activity may be triggered.

REVERSE CONCATENATION FOR PRODUCT CODES

A system is provided to encode data for recording onto media whereby modulation and linear constraints from a concatenated code or product code are imposed. A first array of unencoded user data is generated. Each row is modulation encoded to enforce a first modulation constraint; the array is transformed into a second array which is transformed into a third array having predetermined empty locations in each column interleaved with the modulated data. A C2-parity byte is computed for at least some of the empty locations of the third array and a fourth array is generated. C1-parity symbols in each row are computed, generating a fifth array. A second modulation constraint is enforced on each C1-parity symbol in each row of the fifth array, generating a sixth array. The rows of the sixth array are assembled with header and sync fields for recording onto a recording media.

CONFIGURATION OF FIBRE CHANNEL SAN PATH

System and computer program product are provided to configure a path between nodes through a fabric in a fibre channel storage area network (SAN). A node name is provided for a target node on the SAN and a port name is provided for each port in the target node. A relationship is established in a data structure between each port name and a slot in which each port is physically located in the target node. Prior to configuring a path between a source node and a port in the target node, the ports which are physically connected and logged in to the fabric are identified by port address. The port names corresponding to the port addresses are then identified. The port names are used to generate interface_ids of the ports corresponding to the physical slots in which the ports are located. A data structure is created to maintain the relationship between interface_ids and port names. To establish a path connection between a port in the source node and a selected port in the target node, the node ...

Drift regularization to counteract variation in drift coefficients for analog accelerators

Drift regularization is provided to counteract variation in drift coefficients in analog neural networks. In various embodiments, a method of training an artificial neural network is illustrated. A plurality of weights is randomly initialized. Each of the plurality of weights corresponds to a synapse of an artificial neural network. At least one array of inputs is inputted to the artificial neural network. At least one array of outputs is determined by the artificial neural network based on the at least one array of inputs and the plurality of weights. The at least one array of outputs is compared to ground truth data to determine a first loss. A second loss is determined by adding a drift regularization to the first loss. The drift regularization is positively correlated to variance of the at least one array of outputs. The plurality of weights is updated based on the second loss by backpropagation.

ADAPTIVE AND PERSONALIZED TAG RECOMMENDATION

Embodiments of the invention relate to techniques for personalized tag recommendation for enterprise social bookmarking systems. According to one embodiment of the invention, a method comprises computing at least one set of candidate tags for a document in accordance with at least one factor, and combining the at least one set of candidate tags from different factors into an overall recommendation list of candidate tags. At least one suggested tag from the overall recommendation list is returned as a result of the combination. At least one applied tag that is applied to the document by a user of a computer system is recorded, and the combination is adjusted based on the at least one applied tag.

STALE TRACK INITIALIZATION IN A STORAGE CONTROLLER

Deleting a data volume from a storage system and freeing its storage space to make it available to be allocated to a new volume is accomplished by only zeroing associated metadata for the tracks contained in the freed storage space which is then reused in a new volume allocation and an attempt is made by the new volume to read a first record R0 of a track. A determination is made as to whether a first user record R1 of the volume is stale If the first record R0 is stale. If record R1 is stale, the metadata or track format description (TFD) is modified whereby the entire track is indicated as being uninitialized and the first record R0 is uninitialized. If record R1 is not stale, the first record R0 is regenerated and the TFD is modified whereby the entire track is indicated as being initialized.

ENHANCING REAL-TIME PERFORMANCE FOR JAVA APPLICATION SERVING

A method, system, and computer-readable medium with executable code for enhancing real-time performance of a client device connected to a java virtual machine by incorporating a java proxy server. Java routing logic of a java proxy server is used to receive a request from a client device to access a java virtual machine. The java proxy server may use the java routing logic to select a java virtual machine from among multiple accessible java virtual machines. The java proxy server selects the java virtual machine that has the greatest amount of free memory, and is not performing a garbage collection operation. Once a java virtual machine is chosen, incoming client device connections are routed to a chosen java virtual machine. Additionally, the java routing logic may instruct one or more of the multiple java virtual machines to only perform garbage collection operations when idle, and when no other java virtual machines are performing garbage collection operations.

Architecture for multiple disk file assemblies on a common base

Secure key exchange in a computing environment

Aspects of the invention include channel key loading of a host bus adapter (HBA) based on a secure key exchange (SKE) authentication response by a responder node of a computing environment. A non-limiting example computer-implemented method includes receiving an authentication response message at an initiator channel on an initiator node from a responder channel on a responder node to establish a secure communication, the receiving at a local key manager (LKM) executing on the initiator node. A state check can be performed based on a security association of the initiator node and the responder node. An identifier of a selected encryption algorithm can be extracted from the authentication response message. The initiator channel can request to communicate with the responder channel based at least in part on a successful state check and the selected encryption algorithm.

METHOD AND SYSTEM FOR DISTRIBUTED TASK DISPATCH IN A MULTI-APPLICATION ENVIRONMENT BASED ON CONSENSUS

A method and system for distributing tasks from an external application among concurrent database application server instances in a database system for optimum load balancing, based on consensus among the instances. Each application instance identifies a task partition ownership by those in a membership group based on a time window and generates a new membership group and partition ownership based on the current partition ownership. The instance makes the new membership group and partition ownership known to other members by recoding them in the membership table and partition map. Each participation by an instance in the membership group is identified by a random number. The new membership group and partition ownership are generated and adjusted based on an average partition allocation to achieve consensus among the instances.

Method and Apparatus to Reduce Impedance Discontinuity in Packages

A device and/or apparatus having plated through holes (PTHs) which are coated to reduce impedance discontinuity in electronic packages. PTH vias are imbedded in the core of a printed circuit board comprising a core layer, a plurality of buildup layers, a plurality of micro-vias, and a plurality of traces. Traces electrically interconnect each of the micro-vias to PTH vias, forming an electrically conductive path. PTHs are coated with a magnetic metal material, such as nickel, to increase the internal and external conductance of the PTHs, thereby providing decreased impedance discontinuity of the signals in electronic packages. 1. A device comprising:one or more first planar conductive layers;one or more second planar conductive layers substantially parallel to the one or more first planar conductive layers;a core dielectric disposed between the one or more first planar conductive layers and the one or more second planar conductive layers, said core dielectric having one or more plated through holes (PTH) coated with a layer of magnetic material to provide decreased impedance discontinuity of signals by increasing inductance of the PTH; andone or more traces electrically connected to the one or more PTH to provide an electrically conductive path to the PTH from the one or more first planar conductive layers and the one or more second planar conductive layers.2. The device of claim 1 , wherein said one or more PHT further comprises:an internal cavity filled with a resin; andan electrically conductive metal layer separating the magnetic material from the resin within the internal cavity and providing an electrical coupling of the PHT to the one or more traces.3. The device of claim 1 , wherein said core dielectric further comprises:one or more PTH vias, said PTH vias created as a hole through the dielectric layer, with (i) an interior surface area of the hole coated with a next layer of magnetic material layer, and (ii) the magnetic layer further coated with an ...

METHOD TO REDUCE QUEUE SYNCHRONIZATION OF MULTIPLE WORK ITEMS IN A SYSTEM WITH HIGH MEMORY LATENCY BETWEEN PROCESSING NODES

A method efficiently dispatches/completes a work element within a multi-node, data processing system that has a global command queue (GCQ) and at least one high latency node. The method comprises: at the high latency processor node, work scheduling logic establishing a local command/work queue (LCQ) in which multiple work items for execution by local processing units can be staged prior to execution; a first local processing unit retrieving via a work request a larger chunk size of work than can be completed in a normal work completion/execution cycle by the local processing unit; storing the larger chunk size of work retrieved in a local command/work queue (LCQ); enabling the first local processing unit to locally schedule and complete portions of the work stored within the LCQ; and transmitting a next work request to the GCQ only when all the work within the LCQ has been dispatched by the local processing units. 1. In a multi-node data processing system having at least one high latency processor node that exhibits high access latency to a global command queue (GCQ) , a method for efficient dispatch of a work element within the GCQ , said method comprising:at the at least one high latency processor node, work scheduling logic establishing a local command/work queue (LCQ) in which multiple work items for execution by local processing units are staged prior to execution;a first local processing unit generating a work request for retrieval of work from the GCQ;retrieving via the work request a larger chunk size of work than can be completed in a normal work completion/execution cycle by the local processing unit, wherein the larger chunk size is larger than a standard chunk size that is retrieved when the processing node is a low latency processing node;storing the larger chunk size of work retrieved in a local command/work queue (LCQ);enabling the first local processing unit to locally schedule and complete portions of the work stored within the LCQ; andgenerating a ...

Apparatus and method for handling data cache misses out-of-order for asynchronous pipelines

An apparatus and method for handling data cache misses out-of-order for asynchronous pipelines are provided. The apparatus and method associates load tag (LTAG) identifiers with the load instructions and uses them to track the load instruction across multiple pipelines as an index into a load table data structure of a load target buffer. The load table is used to manage cache “hits” and “misses” and to aid in the recycling of data from the L2 cache. With cache misses, the LTAG indexed load table permits load data to recycle from the L2 cache in any order. When the load instruction issues and sees its corresponding entry in the load table marked as a “miss,” the effects of issuance of the load instruction are canceled and the load instruction is stored in the load table for future reissuing to the instruction pipeline when the required data is recycled.

Low-power DC voltage generator system

A low-voltage, low-power DC voltage generator system is provided having two negative voltage pump circuits for generating voltages for operating negative wordline and substrate bias charge pump circuits, a reference generator for generating a reference voltage, and a two-stage cascaded positive pump system having a first stage pump circuit and a second stage pump circuit. The first stage converts a supply voltage to a higher voltage level, e.g., one volt to 1.5 volts, to be used for I/O drivers, and the second stage converts the output voltage from the first stage to a higher voltage level, e.g., from 1.5 volts to about 2.5 volts, for operating a boost wordline charge pump circuit. The DC voltage generator system further includes a micro pump circuit for providing a voltage level which is greater than one-volt to be used as reference voltages, even when an operating voltage of the DC voltage generator system is at or near one-volt. A one-volt negative voltage pump circuit is also included ...

Memory array with dual wordline operation

A DRAM array is provided capable of being interchanged between single-cell and twin-cell array operation for storing data in a single-cell or a twin-cell array format, respectively. Preferably, the DRAM array is operated in the single-cell array format during one operating mode and the DRAM array is operated in the twin-cell array format during another operating mode. Wordline decoding circuitry is included for interchanging the DRAM array between single-cell and twin-cell array operation. The wordline decoding circuitry includes a pre-decoder circuit for receiving a control signal and outputting logic outputs to wordline activation circuitry. The wordline activation circuitry then activates at least one wordline traversing the array for interchanging memory cells within the DRAM array between single-cell array operation and twin-cell array operation. Methods are also provided for converting data stored within the DRAM array from the single-cell to the twin-cell array format, and vice versa ...

SELECTIVELY DISTRIBUTING UPDATES OF CHANGING IMAGES TO CLIENT DEVICES

A network server for sharing images with mobile electronic devices having one or more processors, and image sharing client application, and an image distribution application. The image sharing client application is to be executed on one or more of the processors to receive an update to an image being shared over a network with mobile electronic devices that each have their own current zoom level and their own currently visible area of the image. The image distribution application is to be executed on one or more of the processors to keep a record of the current zoom level and currently visible area for each of the plurality of mobile electronic devices and to selectively send image updates to the plurality of mobile electronic devices based on the current zoom level and currently viewable area of the mobile electronic devices.

Targeted partial re-enrichment of a corpus based on nlp model enhancements

Techniques for targeted partial re-enrichment include determining that at least one natural language processing (NLP) request is associated with at least one surface form, the NLP request being for a corpus, a database comprising preexisting annotations associated with the corpus. An index query related to the at least one surface form is performed to generate index query results, the index query results including identification of portions of the corpus affected by the NLP request. A scope of the NLP request related to the database is determined based on the index query results, the scope including identification of impacted candidate annotations of the preexisting annotations affected by the NLP request. An NLP service is performed on the corpus according to the scope and the portions, thereby resulting in updates. The updates are committed to the database associated with the corpus.

Micromachined electromechanical (MEM) random access memory array and method of making same

A micromachined electromechanical random access memory (MEMRAM) array is disclosed which includes a plurality of MEM memory cells, where each MEM memory cell has an MEM switch and a capacitor. The MEM switch includes a contact portion configured for moving from a first position to a second position for reading out a charge stored within the capacitor or for writing the charge to the capacitor. A method is also disclosed for fabricating each MEM memory cell of the MEMRAM array.

RECORDING MULTIPLE CODEWORD SETS DURING LATENCY PERIOD

Writing data to magnetic tape is performed by receiving data from a host, establishing sub data sets, computing C1 and C2 ECC, forming Codeword Quad sets, writing a beginning Data Set Separator to a magnetic tape, writing a plurality of contiguous instances of the CQ Set to the magnetic tape and writing a closing DSS. The number of instances of each Codeword Pair is increased, thereby allowing the benefits of writing short tape records and improving reading reliability while reducing susceptibility to mis-tracking errors and large defects, and while reducing the negative impact on data reliability. Otherwise unused latency times are utilizing and therefore no performance penalty is incurred.

Distributed Management of Native Interface Metadata and Arrays

An illustrative embodiment provides a computer-implemented process for distributed management of native interface arrays. The computer-implemented process obtains an array type native interface call in a first system from a caller in a second system, identifies an array type of the array type native interface call to form an identified array type, and requests array elements associated with the identified array type to form requested array elements, wherein added metadata is associated with the requested array elements. The computer-implemented process builds an enhanced data structure using the requested array elements and the associated added metadata and returns a pointer within the enhanced data structure to the caller. The pointer can be used by the caller to manipulate array data of the array elements, and the first system can calculate an address of the added metadata in constant time from the pointer.

SYSTEM AND METHOD FOR PROVIDING GRAPHICAL REPRESENTATIONS OF SEARCH RESULTS IN MULTIPLE RELATED HISTOGRAMS

A system and method are provided for enabling a user to search for documents that the user has previously viewed on its local machine. The system includes three main components: the desktop integration module, the index module, and the graphical user interface module. The desktop integration module is an application which monitors documents with which the user interacts for predetermined events, and obtains content data and metadata from the monitored documents. The index module indexes the content data and metadata received from the desktop integration module. The graphical user interface module then permits a user to utilize the desktop integration module and index module by allowing a user to search for a document.

Temperature programmable timing delay system

The present invention provides a temperature programmable timing delay system utilizing circuitry for generating a band-gap reference and for sensing the on-chip temperature of an integrated circuit chip. The circuitry outputs the sensed temperature as a binary output which is received by a programmable table circuit of the timing delay system. The programmable table circuit outputs a binary output corresponding to the received binary output. The timing delay system further includes a temperature dependent timing delay circuit having inputs for receiving the binary output of the programmable table circuit and an output for outputting a timing delay signal for delaying a clock by a timing delay corresponding to the binary output of the programmable table circuit. The band-gap reference can be a temperature independent band-gap reference voltage having a constant-voltage value or a temperature dependent band-gap reference current having a constant-current value. A method is also provided ...

Methods, systems and computer program products for selecting an aggregator interface

Methods, systems and computer program products are provided for which associate physical links of a network device to aggregator ports of the network device where there are more physical links of the network device capable of aggregation than aggregator ports of the network device. Physical links are associated with the aggregator ports of the network device based on a session invariant characteristic of the physical links until either all of the aggregator ports of the network device have been associated with physical links or all of the physical links capable of aggregation have been associated with an aggregator port. The remaining physical links are then utilized as single links to the network device irrespective of the physical link's capability to aggregate.

TRANSLATING PROMPT AND USER INPUT

A method for intercepting an application prompt before it reaches the user interface, wherein the application prompt has been transmitted from the computer application and intended to reach the user interface. The method also includes translating the intercepted application prompt from a source language to a target user language, and in response to translating the intercepted application prompt, transmitting the translated application prompt to the user interface. The method also includes intercepting, in response to the application prompt, user input from the user interface, wherein the user input is intended to reach the computer application. The method also includes translating the user input from the target language to the source language, and in response to translating the intercepted application prompt, transmitting the translated user input to the computer application. 1. A method for handling computer interactions between a computer application and a user interface , the method comprising:intercepting, by a processor, an application prompt before it reaches the user interface, wherein the application prompt has been transmitted from the computer application and intended to reach the user interface;translating the intercepted application prompt from a source language to a target user language;in response to translating the intercepted application prompt, transmitting the translated application prompt to the user interface;intercepting, in response to the application prompt, user input from the user interface, wherein the user input is intended to reach the computer application;translating the user input from the target language to the source language; andin response to translating the intercepted application prompt, transmitting the translated user input to the computer application.2. The method of claim 1 , further comprising:generating a source language interface comprising the application prompts and user input in the source language.generating a target ...

Transcoding system and method for improved access by users with special needs

A system and method for providing transformed web pages to users with special needs is presented. In one aspect of the system and method, a Translator/Mediator Server is located between the user and the web site. The Translator/Mediator Server translates and transforms the web pages that the user requests from the web site. The translation and transformation of the web pages is directed towards the particular needs of the user.

EXTRACTING BUSINESS RULES OF A SERVICE-ORIENTED ARCHITECTURE (SOA) SYSTEM

The present disclosure discloses a method, system, and computer program product for extracting business rules of a Service-Oriented Architecture (SOA) system. Each of the method, system, and computer program product providing functions comprising: obtaining values of a plurality of business objects; obtaining structure units of the SOA system; establishing association relationships between the structure units and the values of the business objects; and generating business rules based on the association relationships. Using one or more embodiments of the present disclosure can break through the limitations of the conventional method of extracting business rules of a SOA system based on code, and can extract business rules of a complex SOA system. 1. A computer-implemented method for extracting business rules of Service-Oriented Architecture (SOA) system , the method comprising:obtaining one or more values of a plurality of business objects;obtaining one or more structure units of the SOA system;establishing one or more association relationships between the one or more structure units and the one or more values of the plurality of business objects; andgenerating one or more business rules based on the one or more association relationships.2. The method according to claim 1 , wherein an association relationship comprises one of a value of a business object that is an input of the structure unit and a value of a business object that is an output of the structure unit.3. The method according to claim 2 , wherein an association relationship further comprises a corresponding relationship between a value of a business object as an input of the structure unit and a value of a business object as an output of the structure unit with respect of the structure unit.4. The method according to claim 3 , wherein the generating one or more business rules based on the one or more association relationships further comprises:determining a condition of each of the one or more business ...

Flexible dynamic partitioning of resources in a cluster computing environment

The invention provides the mechanism, hereinafter referred to as Flexible Dynamic Partitioning (FDP), to allocate and reallocate resources among scheduling schemes of many types for multicomputing environments. Resources can include, but are not limited to, processors, disks and communications connections. Partitioning of resources can be initiated by both application and system triggers. Once dynamic partitioning is triggered, FDP allows a partition to invoke a set of resource allocation functions associated with its partition. The reallocation function performs a set of resource matchings and determine the necessary resource movement among partitions.

Concurrent Atomic Operations with Page Migration in PCIe

A method and data processing system enables scheduling of atomic operations within a Peripheral Component Interconnect Express (PCIe) architecture during page migration. In at least one embodiment, firmware detects the activation of a page migration operation and sets a migration bit in the page table. When the PCIe Host Bridge (PHB) receives an atomic operation, the PHB checks the migration bit associated with the memory page targeted by the atomic operation and if the migration bit is set, the PHB buffers the atomic operation and sets an atomic operation stall (AOS) bit associated with the buffer. The atomic operation is stalled until the migration bit is reset, at which time the PHB resets the AOS bit of the buffer. The atomic operations are permitted to continue when the migration bit of the target memory page is not set, and along with DMA operations, may bypass other stalled atomic operations. 1. In a data processing system having an input/output (I/O) subsystem including at least one I/O host bridge and a memory subsystem with a page table , a method comprising:firmware within the data processing system detecting the activation of a page migration operation, which migrates a memory page of data from a source memory location to a destination memory location;the firmware setting, within the page table, a migration bit corresponding to the memory page that is being migrated, wherein the migration bit is set to a pre-established value that indicates that there is an ongoing migration within the memory subsystem of the corresponding memory page;the I/O host bridge detecting receipt of an atomic operation; identifying which memory page is being targeted by the atomic operation;', 'autonomously checking the value of the migration bit corresponding to the targeted memory page within the page table; and', 'when the migration bit is set to the pre-established value, preventing the atomic operation from being completed within the memory subsystem until the migration ...

DETECTION AND CORRECTION OF DROPPED WRITE ERRORS IN A DATA STORAGE SYSTEM

Method, system and computer program product are provided for detecting and correcting dropped writes in a storage system. Data and a checksum are written to a storage device, such as a RAID array. The state of the data is classified as being in a “new data, unconfirmed” state. The state of written data is periodically checked, such as with a timer. If the data is in the “new data, unconfirmed” state, it is checked for a dropped write. If a dropped write has occurred, the state of the data is changed to a “single dropped write confirmed” state and the dropped write error is preferably corrected. If no dropped write is detected, the state is changed to a “confirmed good” state. If the data was updated through a read-modified-write prior to being checked for a dropped write event, its state is changed to an “unquantifiable” state.

Suppression of leakage currents in VLSI logic and memory circuits

An SRAM system is provided having an array of SRAM cells including at least one circuit receiving a first power voltage and a power control circuit for supplying a second power voltage to at least one selected circuit of the at least one circuit. The system is one of a memory array and a logic system, and a circuit of the at least one circuit is one of a memory cell of the memory array, a sense amplifier of the memory array and a path of the logic system. A method is also provided for providing a power supply voltage to at least one circuit of a system.

Demand-Based Memory Management of Non-pagable Data Storage

Management of a UNIX-style storage pools is enhanced by specially managing one or more memory management inodes associated with pinned and allocated pages of data storage by providing indirect access to the pinned and allocated pages by one or more user processes via a handle, while preventing direct access of the pinned and allocated pages by the user processes without use of the handles; scanning periodically hardware status bits in the inodes to determine which of the pinned and allocated pages have been recently accessed within a pre-determined period of time; requesting via a callback communication to each user process to determine which of the least-recently accessed pinned and allocated pages can be either deallocated or defragmented and compacted; and responsive to receiving one or more page indicators of pages unpinned by the user processes, compacting or deallocating one or more pages corresponding to the page indicators. 1. A computer program product for memory management of a storage pool consisting of a range of virtual addresses managed by a file system of a computing platform , the computer program product comprising: manage one or more memory management inodes associated with pinned and allocated pages of data storage by providing indirect access to the pinned and allocated pages by one or more user processes via a handle, and by preventing direct access of the pinned and allocated pages by the user processes without use of the handles;', 'scanning periodically hardware status bits in the inodes to determine which of the pinned and allocated pages have been recently accessed within a pre-determined period of time;', 'requesting via a callback communication to each user process to determine which of the least-recently accessed pinned and allocated pages can be either deallocated or defragmented and compacted; and', 'responsive to receiving one or more page indicators of pages unpinned by the user processes, compacting or deallocating one or more pages ...

Magnetic disk driving device

Controlling One or More Attributes of a Secondary Video Stream for Display in Combination with a Primary Video Stream

A method controls one or more attributes of a secondary video stream for display in combination with a primary video stream. The method comprises: identifying a primary video stream; identifying a secondary video stream; assigning one or more settings for one or more attributes of said secondary video stream to a predetermined set of one or more user identifiers; identifying the user identifier associated with a given video processing module; determining the one or more attribute settings assigned to the user identifier; and processing the secondary video stream for display in combination with the primary video stream in accordance with the one or more attribute settings for the user identifier.

REDUCING CROSS QUEUE SYNCHRONIZATION ON SYSTEMS WITH LOW MEMORY LATENCY ACROSS DISTRIBUTED PROCESSING NODES

A method for efficient dispatch/completion of a work element within a multi-node data processing system. The method comprises: selecting specific processing units from among the processing nodes to complete execution of a work element that has multiple individual work items that may be independently executed by different ones of the processing units; generating an allocated processor unit (APU) bit mask that identifies at least one of the processing units that has been selected; placing the work element in a first entry of a global command queue (GCQ); associating the APU mask with the work element in the GCQ; and responsive to receipt at the GCQ of work requests from each of the multiple processing nodes or the processing units, enabling only the selected specific ones of the processing nodes or the processing units to be able to retrieve work from the work element in the GCQ.

Power Management Server for Managing Power Consumption

A power management server and method for managing power consumption is disclosed. According to one embodiment, a power management server data processing system is provided, where the power management server data processing system comprises a power management communication port to communicatively couple the power management server data processing system to a power-managed server data processing system and a system management processor coupled to the power management communication port. In the described embodiment, the system management processor comprises power management logic configured to receive power management data from the power-managed server data processing system, to generate a power management command utilizing the power management data, and to transmit the power management command to the power-managed server data processing system utilizing the power management communication port. Moreover, the power management data of the described embodiment comprises power management capability ...

Optimal approximate approach to aggregating information

A system, method, and computer program product for automatically determining in a computationally efficient manner which objects in a collection best match specified target attribute criteria. The preferred embodiment of the invention enables interruption of such an automated determination at any time and provides a measure of how closely the results achieved up to the interruption point match the criteria. An alternate embodiment combines sequential and random data access to minimize the overall computational cost of the determination.

GAIN CONTROL FOR DATA-DEPENDENT DETECTION IN MAGNETIC STORAGE READ CHANNELS

Method, apparatus and computer program product adjust gain in a read channel of a magnetic media data storage device. A digital signal sample having a data-dependent noise component is received. A gain value, stored in a location in a gain table, is selected in a data-dependent manner. The gain of the signal sample is adjusted in response to the selected gain value. A bit pattern is detected from the gain-adjusted signal sample and a data output signal is output based upon the detected bit pattern.

Cross Enterprise Communication

Method and system for cross enterprise communication are provided in which intermediary communication components carry out cross enterprise communication. A method at a first sending enterprise comprises: receiving a signed encrypted message from a sender within a first enterprise; validating the sender; decrypting the message; encrypting the message for receipt by a second enterprise; signing the encrypted message by the first enterprise; and sending the re-signed re-encrypted message to a second enterprise. The method at the second receiving enterprise comprises: receiving a signed encrypted message from a first enterprise; validating that the first enterprise is the sender; decrypting the message; encrypting the message for receipt by one or more recipients at the second enterprise; signing the encrypted message by the second enterprise indicating that the message is from the first enterprise; and sending the re-signed re-encrypted message to the one or more recipients of the second enterprise. 1110. A method for cross enterprise communication at a first sending enterprise () , the method comprising:{'b': 401', '501', '111', '114', '110, 'receiving (, ) a signed, previously-encrypted message from a sender (-) within a first enterprise ();'}{'b': 402', '502, 'validating (, ) the sender;'}{'b': 403', '504, 'decrypting (, ) the message;'}{'b': 404', '503, 'encrypting (, ) the message for receipt by a second enterprise;'}{'b': 405', '505, 'signing (, ) the encrypted message by the first enterprise; and'}{'b': 406', '506', '120, 'sending (, ) the encrypted message signed by the first enterprise to the second enterprise ().'}2503504. The method as claimed in claim 1 , wherein the step of encrypting () the message is performed before the message is decrypted () in order to prevent the plain text of the message from being revealed.3. The method as claimed in claim 1 , further comprising:{'b': 116', '110, 'maintaining a first list of authorized senders () at the first ...

SYSTEM AND METHOD FOR UPDATING INITIALIZATION PARAMETERS FOR APPLICATION SOFTWARE FROM WITHIN A SOFTWARE DEVELOPMENT ENVIRONMENT

A computer implemented method for updating initialization parameters for application software from within a software development environment. The method involves changing a value of at least one initialization parameter contained in a configuration file of a developer computer system. The method also involves starting application software deployed on an application server in response to the value change. Thereafter, the configuration file including the changed value of the initialization parameter is communicated from the developer computer system to the application server. Once the configuration file is received at the application server, the application software is initialized using the configuration file. 1. A computer implemented method for updating initialization parameters for application software from within a software development environment , comprising the steps of:changing a value of at least one initialization parameter contained in a configuration file of a developer computer system;starting an application software deployed on an application server communicatively connected to said developer computer system;subsequent to starting said application software, communicating said configuration file including said changed value of said at least one initialization parameter from said developer computer system to said application server; andsubsequent to performing said communicating step, initializing said application software using said configuration file.2. The computer implemented method according to claim 1 , wherein said communicating step further involves communicating said configuration file to said application server using streaming technology.3. The computer implemented method according to claim 1 , further comprising the step of storing a notification in a queue of said application server claim 1 , wherein said notification comprises information indicating a mode of said application server.4. The computer implemented method according to claim 3 , ...

Checkpoint Debugging Using Mirrored Virtual Machines

A computer-implemented method of debugging computer code includes: obtaining state information corresponding to a first machine at a checkpoint initiated during execution of the computer code on the first machine; and configuring the second machine to a same operating state as the first machine at the checkpoint to create a mirrored version of the first machine. The method also includes receiving a notification that execution of the program on a first machine has failed, and in response to receiving the notification: triggering a processor of the second machine to initiate execution of a copy of the code from a specific code execution point at which the checkpoint was; activating a debugger module to run concurrently with the execution of the program on the second machine and collect and store the debug data as corresponding to execution failure of the computer code at the first machine. 1. A computer-implemented method of debugging computer code executing on a first machine , the method comprising:obtaining state information corresponding to a previous operating state of the first machine at a checkpoint performed during the execution of the computer code on the first machine;configuring, with the state information obtained, a second machine having a same physical configuration to a same operating state as the previous operating state of the first machine at the checkpoint, wherein the second machine is a mirrored version of the first machine relative to execution of the computer code;receiving a notification that execution of the computer code on the first machine has failed; and triggering a processor of the second machine to initiate execution of a copy of the computer code on the second machine from a specific code execution point at which the checkpoint was initiated on the first machine;', 'activating a debugger module to run concurrently with the execution of the copy of the computer code on the second machine and collect debug data corresponding to ...

METHOD FOR FABRICATION OF POLYCRYSTALLINE DIODES FOR RESISTIVE MEMORIES

The present invention, in one embodiment, provides a method of producing a PN junction the method including at least the steps of providing a Si-containing substrate; forming an insulating layer on the Si-containing substrate; forming a via through the insulating layer to expose at least a portion of the Si-containing substrate; forming a seed layer of the exposed portion of the Si containing substrate; forming amorphous Si on at least the seed layer; converting at least a portion of the amorphous Si to provide crystalline Si; and forming a first dopant region abutting a second dopant region in the crystalline Si.

Method and System for Providing a Longitudinally Shifted Servo Pattern for Increased Sampling Rate

A method and a system are provided for writing a plurality of servo bands on magnetic tape. The magnetic tape is moved longitudinally relative to at least one servo write head. The servo write head is positioned to write a plurality of parallel longitudinal servo bands. The plurality of servo bands comprise odd servo bands and even servo bands, and each of the odd servo bands lie between the each of the even servo bands. The at least one servo write head is operated to write the plurality of parallel longitudinal servo bands on the magnetic tape such that each of the plurality of servo bands comprise a plurality of frames, wherein each frame comprises a plurality of bursts of transition stripes, and each burst has a first transition stripe. The first transition stripe of each burst of each the odd servo band is longitudinally shifted from the first transition stripe of each burst of each even servo band by a substantially equal distance, D, such that servo information of the odd servo bands ...

Inductive current switching system and method

Multi-medla signal processor computer system

EARLY NOISE DETECTION AND NOISE AWARE ROUTING IN CIRCUIT DESIGN

A computerized method, data processing system and computer program product reduce noise for a buffered design of an electronic circuit which was already placed and routed. For all areas between a power stripe and a ground stripe (half bay) in the design, the shapes are divided in different criticality levels. The shapes are rearranged based on their criticality level such that shapes with higher criticality level are placed closer to the stripes than those with lower criticality level. 1. A computer-implemented method for noise aware routing in an integrated circuit chip design , the computer-implemented method comprising:a logic system performing an uplift timing analysis using a route-based extractor for a given routed placement of nets connecting electric circuits of an integrated circuit chip design;the logic system locating one or more affected shapes in a halfbay between a ground stripe and a power stripe based on a list of aggressor and victim nets and a proximity parameter;the logic system prioritizing the one or more affected shapes into different priorities based on one or more coupling uplift values associated with the one or more affected shapes from the uplift timing analysis and correlating, for the one or more affected shapes, timing uplift with cycle time due to noise;the logic system giving a higher priority to shapes having a higher coupling uplift value; andthe logic system rearranging the affected shapes within the integrated circuit chip design according to the respective priority to create an optimized integrated circuit chip design.2. The method of claim 1 , wherein rearranging the affected shapes further comprises placing a higher priority shape closer to one of a ground trace and a power trace than a lower priority shape.3. The method of claim 1 , wherein:rearranging the affected shapes further comprises placing a lower priority shape in between two higher priority shapes; andthe affected shapes are rearranged in order to meet at least one ...

EFFICIENT ACCUMULATION OF PERFORMANCE STATISTICS IN A MULTI-PORT NETWORK

Computer networks are provided with a resource efficient ability to generate link performance statistics. To calculate the average link utilization per I/O operation, a first counter accumulates the number of I/O operations processed by a link and a second counter accumulates the time required by the link to complete each I/O operation. The second value is then divided by the first value. The number of operations per second for a link may be computed by dividing the first number by a predetermined period of time and the average number of operations using the link may be computed by dividing the second number by the predetermined period of time. A third counter may be employed to accumulate the number of bytes transferred by a link during each I/O operation. Then, average size of an I/O operation may be computed by dividing the third number by the first number and the average bandwidth per link operation may be computed by dividing the third number by the predetermined period of time. Separate ...

Interconnect structures containing stress adjustment cap layer

Novel interconnect structures possessing a relatively low internal stress and dielectric constant for use in semiconductor devices are provided herein. The novel interconnect structures comprise a first layer having a coefficient of thermal expansion greater than about 20 ppm and a first internal stress associated therewith, the first layer having a first set of metallic lines formed therein; a second layer having a coefficient of thermal expansion less than about 20 ppm and a second internal stress associated therewith, the second layer having a second set of metallic lines formed therein; and one or more stress adjustment cap layers formed between the first layer and the second layer, the cap layer(s) having a third internal stress to offset the first stress of the first layer and the second stress of the second layer and inducing a favorable relief of stress on the interconnect structure. Methods for making a semiconductor device having a substantially reduced internal stress are also ...

Front-end proxy for transparently increasing web server functionality

A system and method for system for electronic communication, in which functional enhancements may be added that require no modification or replacement of the content-storing servers and is transparent to web browser software. The system includes a front-end proxy server and at least one back-end server. The front-end proxy server receives a content request from a user system, processes the content request, and transmits the processed content request to a back-end server. The front-end proxy server receives a content item corresponding to the processed content request from the back-end server and transmits the content item to the user system. The back-end server comprises a content storage device containing a plurality of content items. The back-end server receives processed content requests from the front-end proxy server, retrieves a content item corresponding to the content request and transmits the retrieved content item to the front-end proxy server.

Method for Recovering Data Processing System Failures

A method for recovering from software and/or hardware failures occurred in a data processing system is disclosed. A current version of boot code and an updated version of boot code are stored in a first memory region and a second memory region, respectively, of a non-volatile memory of the data processing system. The updated version of boot code is periodically replaced by a latest version of boot code downloaded from a support center. After an occurrence of a system crash, a determination is made if the system crash was caused by a known problem that can be remedied by the updated version of boot code. If so, the data processing system is rebooted using the updated version of boot code. Otherwise, data related to the system crash is collected, and the data processing system is rebooted using the current version of boot code.

Checkpoint Debugging Using Mirrored Virtual Machines

A system of debugging computer code includes a processor: obtaining state information corresponding to a first machine at a checkpoint initiated during execution of the computer code on the first machine; and configuring the second machine to a same operating state as the first machine at the checkpoint to create a mirrored version of the first machine. The system also includes receiving a notification that execution of the program on a first machine has failed, and in response to receiving the notification: triggering a processor of the second machine to initiate execution of a copy of the code from a specific code execution point at which the checkpoint was; activating a debugger module to run concurrently with the execution of the program on the second machine and collect and store the debug data as corresponding to execution failure of the computer code at the first machine. 17.-. (canceled)8. A computer readable storage medium comprising computer readable code for debugging a computer program executing in a mirrored virtualized data processing system environment , which code , when executed by a processor causes the processor to:obtain state information corresponding to a previous operating state of the first machine at a checkpoint performed during the execution of the computer code on the first machine;configure, with the state information obtained, a second machine having a same physical configuration to a same operating state as the previous operating state of the first machine at the checkpoint, wherein the second machine is a mirrored version of the first machine relative to execution of the computer code;receive a notification indicating that execution of the computer code on the first machine has failed; and trigger a processor of the second machine to initiate execution of a copy of the computer code on the second machine from a specific code execution point at which the checkpoint was initiated on the first machine;', 'activate a debugger module to ...

Tool for Analyzing Siebel Escripts

A method, system and computer program product for enabling automated analysis of an extracted eScript to identify one or more problems within a configuration and script. The eScript is extracted from a Siebel repository and received in a DAVID (Development Application Verification Information on Demand for Siebel application where the VB.NET application, called SiebelParser, is utilized to conduct the analysis of the eScript. Occurrences of issues within an eScript are detected by SiebelParser. Issues within the eScript may include one or more of: empty event handlers, explicit object release, setting field values utilizing hard coded values, unnecessarily activated fields, call to next record after a call to delete record, and functions containing unnecessary code. Results from the analysis are reported to one log file document. The results of SiebelParser's log file are later incorporated to a spreadsheet by DAVID, to provide a more readable output format.

DATA PROTECTION VIA SOFTWARE CONFIGURATION OF MULTIPLE DISK DRIVES

A data storage system and a method for managing a data storage system are provided. A storage controller is programmed with a disk configuration for each of one or more logical disk arrays and a protection level k. The available storage space from one or more disk drives in the data storage system is merged into a single virtual address space and the merged storage space is divided into storage segments. Next, the storage segments are allocated among the logical disk arrays and a configuration table is generated indicating the number of storage segments in each logical disk array and the physical location of each storage segment on a disk drive. The configuration table is stored in the storage controller and k copies of data may then be stored on the logical disk arrays.

System and Method for Instantiation of Distributed Applications from Disk Snapshots

A framework instantiates an application from its disk snapshots taken from a different network environment and migrated to a virtualized environment. Modifications to operating systems and hypervisors are avoided, and no special network isolation support is required. The framework is extensible and plug-in based, allowing product experts to provide knowledge about discovering, updating, starting and stopping of software components. This knowledge base is compiled into a plan that executes various interleaved configuration discovery, updates and start tasks such that a required configuration model can be discovered with minimal start and update task execution. The plan generation automatically stitches together knowledge for the various products, thus significantly simplifying the knowledge specification. Once discovery is complete, the framework utilizes the discovered model to update stale network configurations across software stack and customize configurations beyond network settings. 1. A computer implemented method for instantiating disk snapshots from a different network environment to a virtualized environment , the method comprising:accessing a product knowledge model;accessing a disk snapshot of a composite application executing in a first environment as a plurality of virtual machines;migrating the disk snapshot to a second environment;discovering network configuration settings using the product knowledge model; andconstructing a configuration model based in part upon the discovered network configuration settings.2. The computer implemented method of claim 1 , further comprising building the product knowledge model as a framework of a structural configuration meta-model of component types of selected configurations with knowledge specified on top of the framework as task specifications claim 1 , each specification comprising actions selected from a group consisting of discovery claim 1 , update claim 1 , start and stop taken on a selected component type.3. ...

METHOD OF PRODUCING A CHANNEL STRUCTURE FORMED FROM A PLURALITY OF STRAINED SEMICONDUCTOR BARS

Method of manufacturing a structure with semiconducting bars suitable for forming one at least one transistor channel, including the following steps: a) make a semiconducting structure, composed of an alternation of first bars based on a first material and second bars based on a second material, the second material being a semiconducting material, then b) remove exposed portions of the structure based on the first material through an opening in a mask formed on the structure, the removal being made by selective etching in the opening of the first material relative to the second material, so as to expose a space around the second bars, then c) grow a given semiconducting material (25) around the second bars (6c) in the opening, the given semiconducting material having a mesh parameter different from the mesh parameter of the second material (7) so as to induce a strain on the sheaths based on the given semiconducting material.

LIMITING RECEIPT OF UNSOLICITED EVENTS BY A LOGICAL PARTITION IN A DATA STORAGE SYSTEM

A logical partition (LPAR) is managed in a data processing system by performing an initial program load (IPL), commencing execution of an application on the LPAR and selecting from a plurality of unsolicited events of which the application is to receive notice. A command is transmitted to a storage controller indicating the identity of the selected unsolicited events, wherein the storage controller will store the information in a data structure. Upon the later occurrence of an unsolicited event, the storage controller will transmit to the LPAR only notices of the selected unsolicited events.

AVOIDING FAILURE OF AN INITIAL PROGRAM LOAD IN A LOGICAL PARTITION OF A DATA STORAGE SYSTEM

An initial program load (IPL) of a logical partition (LPAR) is managed by establishing a logical path to the LPAR from a storage controller. When a notice is received by the storage controller from the LPAR that the IPL has commenced, the LPAR address is stored in a data structure. After the storage controller initiates a pack change state interrupt, the stored address is compared with the addresses in a list of all LPARS to which the interrupt is directed. If the list of addresses includes the stored address, the stored address is removed from the list. Thus, the pack change state interrupt is transmitted only to the addresses in the list, leaving the LPAR to complete the IPL without interruption. After the storage controller receives a notice from the LPAR that the IPL has completed, the address of the LPAR is removed from the data structure.

System for selecting a computer solution from a pre-defined set

An expert system selects a computer solution from a set of predefined, proven solution to meet a specific need. Each of the predefined solutions comprises a plurality of hardware platforms and associated software, and a communication facility between the hardware platforms. The system identifies and directs display of a multiplicity of different characteristics of computer solutions within the set. Then, the user selects one of the characteristics to reduce the number of possible solutions from the set. In response, the system may then display other characteristics which can be selected to further reduce the number of possible solutions from those identified after the one characteristic was selected. According to a preferred embodiment of the present invention, this narrowing process always results in one or more solutions from the set; there are no "dead ends". After the last characteristic is selected, the system identifies and directs display of a final subset of the set corresponding ...

Atomic Operations with Page Migration in PCIe

A method and data processing system enables scheduling of atomic operations within a Peripheral Component Interconnect Express (PCIe) architecture during page migration. In at least one embodiment, firmware detects the activation of a page migration operation. The firmware notifies the I/O host bridge, which responds by setting an atomic operation stall (AOS) bit to a pre-established value that indicates that there is an ongoing migration within the memory subsystem of a memory page that is mapped to that I/O host bridge. When the AOS bit is set to the pre-established value, the I/O host bridge prevents/stalls any received atomic operations from completing. The I/O host bridge responds to receipt of receipt of an atomic operation by preventing the atomic operation from being initiated within the memory subsystem, when the AOS bit is set to the pre-established value. The AOS bit is reset when the migration operation has completed. 1. In a data processing system having an input/output (I/O) subsystem including at least one I/O host bridge and a memory subsystem with a page table , a method comprising:firmware within the data processing system detecting the activation of a page migration operation, which migrates a memory page of data from a source memory location to a destination memory location;the firmware notifying the I/O host bridge of the page migration operation;the I/O host bridge setting an atomic operation stall (AOS) bit to a pre-established value that indicates that there is an ongoing migration within the memory subsystem of a memory page that is mapped to the I/O host bridge, wherein when the AOS bit is set to the pre-established value, the I/O host bridge prevents/stalls any received atomic operations from completing;the I/O host bridge detecting receipt of an atomic operation for scheduling; the I/O host bridge autonomously checking the value of the AOS bit; and', 'when the AOS bit is set to the pre-established value, preventing the atomic operation ...

Data Sharing for File Clones Using Reverse Ditto References

A method, system, and computer program product for creating and implementing file clones using reverse ditto references. A clone inode is created as a copy of an original inode. The clone inode and the original inode are indistinguishable to an end user. Each additional file clone created spawns a clone inode. An immutable clone-parent inode is created that contains the disk block addresses, while writable clones inode instead contain dittos linking the clone inode to data blocks referenced in the clone-parent inode. Data block address links in the original inode are moved to the new clone-parent inode and dittos replace the original data block address links in the original inode. When a clone file is updated, the new data is written to a new disk location and a corresponding ditto in the clone inode is replaced with a data block link address, keeping the data of the clone-parent inode intact. 1. In a data processing system having a processor and access to a file storage and file management facility , a processor implemented method comprising:selecting an original inode corresponding to an original file, the original inode having one or more data block address links;creating a clone inode;receiving a name entry and target directory for the clone inode;in response to receiving the name entry, inserting a directory entry containing the name entry into the target directory;initializing the clone inode as a clone parent that is immutable; andupdating an inode map to identify the clone inode as in-use.2. The method of claim 1 , wherein initializing the clone inode as a clone parent further comprises:copying the one or more data block address links and a header of the original inode to the clone inode;updating a block count of the clone inode to equal the number of data block address links, wherein the block count of the clone inode is a same number of data blocks as is stored in the original inode;setting a link count in the clone inode to two (2);copying inode time ...

Automatically Reviewing Information Mappings Across Different Information Models

A computer-implemented method, system, and program product for automatically reviewing a mapping between information models. The method includes: receiving a mapping between an element in the first information model to an element in the second information model. Each element is associated with an element identifier and an element value, and the mapping signifies a relationship between the element in the first information model and the element in the second information model. The method further includes comparing the received mapping against one or more known indications of suspicious mappings to determine if the received mapping resembles one of the indications of suspicious mappings. If the received mapping is determined to be suspicious, identifying the received mapping as one that requires review. 1. A computer-implemented method of automatically reviewing a mapping between a first information model and a second information model comprising the steps of:receiving a mapping between an element in the first information model to an element in the second information model, wherein each element is associated with an element identifier and an element value, and wherein the mapping signifies a relationship between the element in the first information model and the element in the second information model;comparing the received mapping against one or more known indications of suspicious mappings to determine if the received mapping resembles one of the indications of suspicious mappings; andif the received mapping is determined to be suspicious, identifying the received mapping as one that requires review.2. The method according to claim 1 , wherein comparing the received mapping against one or more known indications of suspicious mappings comprises evaluating a pattern expression associated with each of the one or more known indications of suspicious mapping against the received mapping.3. The method of claim 2 , wherein the pattern expression is stored a query in a query ...

SYSTEM AND METHOD TO VALIDATE AND REPAIR PROCESS FLOW DRAWINGS

Disclosed is a system and method for validating and repairing flow diagrams using a process modeling validation method in conjunction with a process modeling repair method. The process modeling validation method points out structural ambiguities in a flow diagram that can make its automatic interpretation difficult. It also proposes fix to resolve such ambiguities. The method discloses a process semantic annotation scheme that can interpret process semantics in a flow graph implicit in a flow diagram. Further, the validation process compares one or more components of one or more drawings to a set of rules determined by a business process modeling standards and provides a set of semantic errors describing faulty parts of the drawing that do not comply with the business process modeling standards. The process modeling repair method corrects the drawing to ease and enable its automatic interpretation of the flow diagram and make the faulty parts of the drawing comply with the business process modeling standards. 1. A system comprising one or more computer systems and further comprising:one or more memories that contain one or more flow diagrams, each flow diagram having one or more drawings;one or more flow graphs stored in the memory and having been interpreted from the flow diagram, each of the flow graphs having one or more nodes and one or more edges, each edge connecting two of the nodes; identifying one or more structural errors in one or more drawings of one or more flow diagrams, the structural errors causing one or more interpretation difficulties in an automatic interpretation of at least one of the flow diagrams;', 'annotating one or more of the nodes and edges with process semantics following a set of process annotation rules to create a semantically annotated flow graph;', 'comparing one or more components of the flow diagram and the corresponding semantically annotated flow graph to a set of rules defined by a business process modeling standard; and', ' ...

Framework and Methodology for a Real-Time Fine-Grained Power Profiling with Integrated Modeling

A method, a system and a computer program product for determining power consumption levels for granular segments of program code in a data processing system. A power profiling utility (PPU) utilizes/comprises a power monitoring module, a power profiler module, a performance profiler and a power modeling component which enables PPU to efficiently characterize power consumption of various types of applications. The PPU uses a power measurement device to obtain power consumption measurements corresponding to execution of a first code segment. Additionally, the PPU identifies information about program characteristics of granular code segments within the first code segment. The PPU then determines total power consumption for execution of the first code segment from an aggregation of power consumption measurements corresponding to all iterations of the first code segment. Ultimately, the PPU derives from the total power consumption calculated for the first code segment a finer grained power profile by using the program characteristics information and power modeling information. 1. In a data processing system , a computer-implemented method comprising:measuring a first level of power consumption corresponding to execution of a first segment of program code;identifying information about program characteristics of the first segment of program code;obtaining power model information for the first segment of program code;determining total power consumption for execution of said first segment of program code by aggregating levels of measured power consumption corresponding to a plurality of iterations of execution of said first segment of program code; andderiving from said total power consumption a second level of power consumption corresponding to a granular segment of code contained within said first segment of code by using the program characteristics information and the power model information that are mapped to particular code segments.2. The method of claim 1 , further ...

Mechanism for NPIV Client Recovery When NPIV Server Goes Down

With N_Port ID Virtualization (NPIV), a managed system can be configured so that multiple logical partitions (LPARs) can access independent physical storage through the same physical fibre channel adapter. An NPIV client recovery component of a virtualization management component, such as a Power Hypervisor (pHYP), provides the emulation mapping between server and client virtual fibre channel adapters. The pHYP also provides a mechanism that prevents client partition crashes when the NPIV server (e.g., a VIOS logical partition) goes down. When the NPIV server is rebooted or powers down, the pHYP handles the client LPARs to avoid a crash by removing processing resources from the client logical partition. Thereby, the client logical partition is prevented from attempting to access a root volume group in physical storage via the NPIV server. The pHYP allocates processor resources to the client LPAR when the NPIV server is again available for UO processing. 1. A computer implemented method comprising:abstracting hardware resources to an operating system of a client logical partition;pairing a client virtual input/output adapter of the client logical partition and a server virtual input/output adaptor of a virtual input/output server partition;dispatching a virtual process of the operating system of the client logical partition to the hardware resources for processing;detecting an event that interrupts processing of the virtual input/output server partition;in response to detecting an event that interrupts processing of the virtual I/O server partition, discontinuing dispatch of the virtual process of the operating system of the client logical partition to the hardware resources for processing to prevent the client from attempting to utilize the virtual input/output adapter;detecting an end of the event that interrupts processing of the virtual input/output server partition; andin response to the detecting of the end of the event, resuming dispatching of the virtual ...

Methodology and Framework for Run-Time Coverage Measurement of Architectural Events of a Microprocessor

A post-silicon testing apparatus, method, and computer program product provide for runtime coverage measurement methodology to measure the architectural events in hardware. Measurement of all architectural events discernable from the instructions and architectural state changes are tracked and recorded. A mechanism to ensure capturing of maskable events is also provided. A feedback driven test-generation approach is enabled by the runtime coverage measurement. The runtime coverage measurement system presents a live view of the comprehensive architectural event coverage to the user/tester. The methodology can be implemented on an operating system environment and also as a standalone/bare-metal tool. 1. A computer implemented method for integrated circuit (IC) testing , comprising: analyzing a current architecture state of test hardware under test to detect architectural state events;', 'decoding a next instruction;', 'discerning a coverage statistic from the next instruction; and', 'determining whether any architectural state event is subject to being masked based on execution of the next instruction, wherein the event that is subject to being masked is a maskable event;, 'for each of a plurality of instructions of a test caserecording the architectural state events including any maskable event due to execution of a prior instruction;resetting the maskable event; andforwarding the decoded next instruction to the hardware under test for a single step execution.2. The computer implemented method of claim 1 , further comprising:determining that the test case is complete; andcollating coverage statistics.3. The computer implemented method of claim 1 , further comprising:merging the architectural state events by performing bitwise logical operations between a current architectural state and saved maskable values of a prior architecture state.4. The computer-implemented method of claim 1 , further comprising measuring coverage in the hardware under test during execution of ...

Data Driven Metric for Service Quality

A data processing system establishes a mapping between each of a plurality of plurality of internal data sources within a service organization and a respective one of multiple service quality factors. The data processing system determines a mathematical transformation of internal service quality data obtained from the plurality of internal data sources to obtain a customer satisfaction value. The data processing system estimates and reports a service quality delivered by the service organization by applying the mathematical transformation to at least some of the internal service quality data obtained from the plurality of internal data sources. 1. A method of data processing , comprising:a data processing system establishing a mapping between each of a plurality of plurality of internal data sources within a service organization and a respective one of multiple service quality factors;the data processing system determining a mathematical transformation of internal service quality data obtained from the plurality of internal data sources so mapped to obtain a customer satisfaction value; andthe data processing system estimating and reporting a service quality delivered by the service organization by applying the mathematical transformation to at least some of the internal service quality data obtained from the plurality of internal data sources.2. The method of claim 1 , wherein the determining includes applying a respective weight to each of the multiple service quality factors.3. The method of claim 1 , and further comprising tuning the mathematical transformation based upon an updated customer satisfaction value.4. The method of claim 1 , and further comprising obtaining the customer satisfaction value from customer surveys.5. The method of claim 1 , and further comprising verifying compliance of the service organization with a service level agreement based on the estimated service quality.6. The method of claim 1 , wherein the reporting includes storing the ...

OPTIMIZED CUSTOMER TARGETING BASED ON TEMPLATE CRM OFFERS

A Customer Relationship Management (CRM) offer template is established in data storage and includes at least one variable field and having at least one offer attribute. For each of a plurality of customer groups, a data processing system calculates an expected benefit to be obtained by sending an instantiated CRM offer to a customer based upon historical responses, offer cost, and legal values of the at least one variable field. The data processing system outputs a CRM offer instance and target list of customers that maximizes the expected benefit. 1. A method of data processing , comprising:establishing a Customer Relationship Management (CRM) offer template in data storage, the CRM offer template including a variable field and having an offer attribute;for each of a plurality of customer groups, a data processing system calculating an expected benefit to be obtained by sending an instantiated CRM offer to a customer based upon historical responses, offer cost, and legal values of the at least one variable field; andthe data processing system outputting a CRM offer instance and target list of customers that maximizes the expected benefit.2. The method of claim 1 , wherein the calculating includes adjusting the benefit obtained by a positive response based upon the historical responses.3. The method of claim 1 , wherein:the variable field is a first variable field;the CRM offer template includes a second variable field; andthe adjusting includes applying a function to combine probabilities associated with the first and second variable fields.4. The method of claim 1 , wherein:the CRM offer template is a first CRM offer template;the establishing comprises establishing a plurality of CRM offer templates, said plurality of CRM offer templates including the first CRM offer template;the outputting includes outputting a set of CRM offer templates for a marketing campaign, the set including the first CRM offer template and at least a second CRM offer template among the ...

Operating System Image Management

In a data processing system including multiple logical partitions (LPARs), an application executes on a first logical partition (LPAR) of the multiple LPARs, where the application uses a first operation system stored in a first memory partition of a shared pool memory of the data processing system. A virtualization management component (a) initiates an update process that quiesces operations of the first LPAR, (b) pages in, via a virtual input/output server coupled to a first paging device, a first image of a second operating system from the first paging device to the shared pool memory; (c) changes one or more pointers associated with the application to point to one or more portions of the second operating system, such that the application uses the second operating system, when resumed; and (b) resumes execution the application. 1. In a data processing system including: a processor , a memory coupled to the processor , at least one virtual I/O server (VIOS) that enables communications with a plurality of paging devices , a plurality of logical partitions , and a virtualization management component executing within the data processing system and controlling one or more operations of the plurality of logical partitions , a method comprising:executing, on a first logical partition of the plurality of logical partitions, an application that uses a first operating system stored in a first memory partition of a shared pool memory of the memory coupled to the processor, wherein the first logical partition uses the first memory partition as a first memory of the first logical partition;initiating an update process that quiesces execution of the application;paging in, via the VIOS coupled to a first paging device of the plurality of paging devices, a first image of a second operating system from the first paging device to the shared pool memory;changing one or more pointers associated with the application to point to one or more portions of the second operating system; ...

Supporting Virtual Input/Output (I/O) Server (VIOS) Active Memory Sharing in a Cluster Environment

A method, system, and computer program product provide a shared virtual memory space via a cluster-aware virtual input/output (I/O) server (VIOS). The VIOS receives a paging file request from a first LPAR and thin-provisions a logical unit (LU) within the virtual memory space as a shared paging file of the same storage amount as the minimum required capacity. The VIOS also autonomously maintains a logical redundancy LU (redundant LU) as a real-time copy of the provisioned/allocated LU, where the redundant LU is a dynamic copy of the allocated LU that is autonomously updated responsive to any changes within the allocated LU. Responsive to a second VIOS attempting to read a LU currently utilized by a first VIOS, the read request is autonomously redirected to the logical redundancy LU. The redundant LU can be utilized to facilitate migration of a client LPAR to a different computing electronic complex (CEC). 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system to generate a plurality of operating system (OS) partitions including one or more virtual input/output (I/O) server (VIOS) and one or more client logical partitions (LPAR) , a method comprising:providing, by a first VIOS, a virtual memory space of a distributed storage repository, wherein the virtual memory space is actively shared by two or more client LPARs;the first VIOS receiving a paging file request from an application running on a first client LPAR of the two or more client LPARs, wherein the paging file request indicates a minimum required capacity, and wherein the minimum required capacity is a minimum amount of paging file storage required by the application;determining if an existing logical unit (LU) of a plurality of LUs within the distributed storage repository ...

Accelerating Generic Loop Iterators Using Speculative Execution

A method, a system and a computer program product for effectively accelerating loop iterators using speculative execution of iterators. An Efficient Loop Iterator (ELI) utility detects initiation of a target program and initiates/spawns a speculative iterator thread at the start of the basic code block ahead of the code block that initiates a nested loop. The ELI utility assigns the iterator thread to a dedicated processor in a multi-processor system. The speculative thread runs/executes ahead of the execution of the nested loop and calculates indices in a corresponding multidimensional array. The iterator thread adds all the precomputed indices to a single queue. As a result, the ELI utility effectively enables a multidimensional loop to be replaced by a single dimensional loop. At the beginning of (or during) each iteration of the iterator, the ELI utility “dequeues” an entry from the queue to use the entry to access the array upon which the ELI utility iterates. The ELI utility performs concurrent iterations on the array by using the queue entries. 1. In a multiple processor computer system , a computer-implemented method comprising:pre-assigning an iterator thread to a dedicated processor in the multiple processor system;initiating the iterator thread at a start of a basic code block, ahead of a code block for a nested loop;pre-computing, via the iterator thread, indices for a multidimensional array associated with the nested loop;inserting the pre-computed indices as entries within a queue;initiating iteration of the multi-dimensional array associated with the code block for the nested loop;dequeueing an entry from the queue to access the array on which the iteration is initiated utilizing the dequeued entry; andperforming iterations on the array by using the queue entries.2. The method of claim 1 , wherein said initiating the iterator thread further comprises:monitoring, via the iterator thread, values of a Boolean flag for a value that indicates that an empty ...

METHOD AND SYSTEM FOR STORING MEMORY COMPRESSED DATA ONTO MEMORY COMPRESSED DISKS

In a computer system supporting memory compression, wherein memory compressed data is managed in units of memory sectors of size S, wherein data is stored on disk in a different compressed format, and wherein data on said disk is managed in units of disk sectors of size D, a method for storing memory compressed data on a compressed disk includes combining at least one of compressed memory directory information, a system header, compressed data controls, and pads into a data structure having a same size S as a memory sector, grouping the data structure and the data contained in the desired memory sectors into groups of D/S items, and storing each of the groups in a separate disk sector. 1. In a computer system supporting memory compression , wherein memory compressed data is managed in units of memory sectors of size S , wherein data is stored on disk in a different compressed format , and wherein data on said disk is managed in units of disk sectors of size D , a method for storing memory compressed data on a compressed disk , said method comprising:combining at least one of compressed memory directory information, a system header, compressed data controls, and pads into a data structure having a same size S as a memory sector;grouping said data structure and the data contained in the desired memory sectors into groups of D/S items; andstoring each of said groups in a separate disk sector.2. The method of claim 1 , further comprising:determining a size of the data from the compressed memory directory information; andallocating a corresponding number of disk sectors to store the data while data is being transferred from said main memory.3. In a computer system supporting memory compression claim 1 , wherein memory compressed data is managed in units of memory granules of size G claim 1 , wherein data is stored on disk in a different compressed format claim 1 , and wherein data on said disk is managed in units of disk sectors of size D claim 1 , a method for storing ...

Method and Device for Preventing CSRF Attack

The disclosure provides a device and method for preventing CSRF attacks, in which the method comprises: intercepting request sent from a client browser to a server; generating a token; generating a response to the request; inserting the token into the response to the request; and sending the response to the request to the client browser with the token inserted into the response. With the method and device of the disclosure, it is assured that a token is inserted into all the requests made by a user through a client browser for accessing a resource. And it can be assured that the request is issued by the user himself by verifying whether the token in the request is valid, thereby preventing a CSRF attack. 1. A device for preventing a Cross-Site Request Forgery (CSRF) attack , the device comprising:a request intercepting module for intercepting request(s) sent from a client browser to a server;a token generating module for generating a token;a response generating module for generating a response to the request;a token inserting module for inserting the token into the response to the request; anda response sending module for sending the response to the request to the client browser with the token inserted in the response.2. The device according to claim 1 , wherein:the response is a hypertext transfer protocol (HTTP) 307 response.3. The device according to claim 1 , wherein:the request intercepting module intercepts subsequent request sent from the client browser to the server; and a token reading module for reading token in the subsequent request sent from the client browser to the server;', 'a token verifying module for verifying whether the token in the subsequent request sent from the client browser to the server is valid., 'the device further comprises4. The device according to claim 3 , further comprising:a request forwarding module for forwarding to the server the subsequent request sent from the client browser to the server.5. The device according to claim 4 , ...

Database Redistribution Utilizing Virtual Partitions

In some embodiments, a partitioned database is stored in a plurality of logical or physical partitions on at least a logical or physical first data storage node, and a subset of a first partition among the plurality of logical partitions is configured as a virtual partition. An input indicating an allocation of a second physical data storage node to store the partitioned database is received. A second partition is configured on the second data storage node. In response to the input, the partitioned database is redistributed over the first and second data storage nodes by moving data within the virtual partition on the first partition to the second partition. 1. A method of data processing , comprising:storing a partitioned database in a plurality of partitions on at least a first data storage node of a data processing system;configuring a subset of a first partition among the plurality of partitions as a virtual partition;receiving an input indicating an allocation of a second data storage node to store the partitioned database;configuring a second partition of the partitioned database on the second data storage node; andin response to the input, redistributing the partitioned database over the first and second data storage nodes by moving data within the virtual partition on the first partition to the second partition.2. The method of claim 1 , wherein the virtual partition comprises one or more data blocks of the first partition.3. The method of claim 2 , wherein the virtual partition includes only data within the first partition.4. The method of claim 1 , wherein:the method includes establishing a partition configuration data structure associating the virtual partition and the first partition; andthe redistributing includes updating the partition configuration data structure to indicate that the data moved to the second partition does not reside in a virtual partition.5. The method of claim 1 , wherein:the method includes establishing a partition map mapping data ...

Method and Apparatus for Performing Refresh Operations in High-Density Memories

A method for performing refresh operations is disclosed. In response to a completion of a memory operation, a determination is made whether or not a refresh backlog count is greater than a first predetermined value. In a determination that the refresh backlog count is greater than the first predetermined value, a refresh operation is performed as soon as possible. In a determination that the refresh backlog count is not greater than the first predetermined value, a refresh operation is performed after a delay of an idle count value. 1. A method for performing refresh operations , said method comprising:in response to a completion of a memory operation, determining whether or not a refresh backlog count is greater than a first predetermined value;in a determination that said refresh backlog count is greater than said first predetermined value, performing a refresh operation as soon as possible; andin a determination that said refresh backlog count is not greater than said first predetermined value, performing a refresh operation after a delay of an idle count value.2. The method of claim 1 , wherein said first predetermined value is 7.3. The method of claim 1 , wherein said idle count value is negatively proportional to said refresh backlog count.4. The method of claim 1 , wherein said method further includesdetermining whether or not said refresh backlog count is less than a second predetermined value;in a determination that said refresh backlog count is less than said second predetermined value, performing a refresh operation after a delay of a maximum idle count value.5. The method of claim 3 , wherein said second predetermined value is 3.6. A computer readable medium having a computer program product for performing refresh operations claim 3 , said computer readable medium comprising:computer program code for, in response to a completion of a memory operation, determining whether or not a refresh backlog count is greater than a first predetermined value;computer ...

Efficient Serialization of Mutable Objects

A method of serialization in a data processing system includes serializing a mutable object utilizing a full serialization process, caching primitive data and metadata regarding the mutable object in binary format in cache and then checking whether primitive fields of the mutable object are modified. Thereafter, the mutable object is again serialized utilizing an abbreviated serialization process by reference to the cached primitive data and metadata if the primitive fields of the object are not modified. In the event that primitive fields of the object are modified, the full serialization process is utilized. Thereafter, the serialized mutable object is communicated to a distributed code element. 1. A method of serializing a program object in a data processing system , the method comprising:serializing a mutable object utilizing a full serialization process and caching primitive data and metadata regarding the mutable object in binary format in cache; again serializing the mutable object utilizing an abbreviated serialization process by reference to the cached primitive data and metadata; and', 'communicating the serialized mutable object to a distributed code element., 'thereafter2. The method of claim 1 , wherein the caching includes:caching the metadata data in a metadata cache; andcaching the primitive data in a separate primitive data cache.3. The method of claim 1 , wherein:the mutable object includes a field indicating whether or not the mutable object has changed since last serialized; andagain serializing the mutable object utilizing an abbreviated serialization process includes again serializing the mutable object utilizing the abbreviated serialization process in response to the field indicating that the mutable object has not changed since last serialized.4. The method of claim 3 , wherein:the mutable object includes a primitive field and an object header, the object header containing the field;the method further comprises setting the field to indicate ...

Efficient Backup and Restore of a Cluster Aware Virtual Input/Output Server (VIOS) Within a VIOS Cluster

In a Virtual Input/Output (I/O) Server (VIOS) partition within a data processing system that comprises cluster-aware VIOSes, a method includes: performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a backup operation on the first VIOS partition, which creates a first configuration backup file having configuration information about the hardware, logical and virtual devices of the VIOS partition; storing the configuration backup file within local storage; and responsive to receipt of a VIOS restore command: retrieving the configuration backup file from the local storage; and restoring the configuration of the hardware, logical and virtual devices of the first VIOS to a state that existed at a time at which the backup operation creating the configuration backup file was performed. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system to generate a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition of multiple VIOS partitions communicatively coupled to create a VIOS cluster , a method comprising:performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a backup operation on the first VIOS partition, which creates a first configuration backup file having configuration information about the hardware, logical and virtual devices of the first VIOS partition;storing the configuration backup file within local storage;storing a copy of the configuration backup file within a VIOS database (DB) of the VIOS cluster; and retrieving the configuration backup file from the local storage; and', 'restoring the ...

EFFICIENT BACKUP AND RESTORE OF VIRTUAL INPUT/OUTPUT SERVER (VIOS) CLUSTER

A method enables cluster-level backup and restore functionality of all Virtual Input/Output Server (VIOS) configuration data within a VIOS cluster and the data of a shared VIOS cluster database. The method comprises: performing, via a backup/restore utility of a VIOS partition, a cluster level backup, which creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from the shared VIOS database of the VIOS cluster; storing the VIOS cluster configuration backup file within a storage location; and responsive to receipt of a VIOS restore command at a VIOS partition: retrieving the configuration backup file from the storage location; restoring a configuration of the hardware, logical and virtual devices of each VIOS within the VIOS cluster to prior state; and restoring the shared VIOS database with the backed-up cluster data. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system to generate a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition , a method comprising:performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a cluster level backup operation from one or more VIOS partitions, including the first VIOS partition and at least one second VIOS partition, wherein the cluster level backup operation creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from a shared VIOS database of the VIOS cluster;storing the ...

METHOD AND TOOL TO OVERCOME VIOS CONFIGURATION VALIDATION AND RESTORATION FAILURE DUE TO DRC NAME MISMATCH

In a Virtual Input/Output (I/O) Server (VIOS) partition, a method comprises a cluster aware (CA) operating system (OS) of a VIOS partition performing the functions of: responsive to a restore command: retrieving a configuration backup file from storage; comparing a DRC name from the retrieved file with a DRC name of the current VIOS partition performing the restore operation; in response to an occurrence of a DRC name mismatch: retrieving an initial UUID of the VIOS from the configuration backup file; accessing a UUID table within a management tool; locating a matching UUID to the initial UUID within the UUID table; and in response to locating the matching UUID: verifying that the configuration data file belongs to the current VIOS initiating the restore operation; and performing the restore operation to restore the configurations of the hardware, logical and virtual devices of the first VIOS to an earlier configuration state. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system to generate a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition of multiple VIOS partitions communicatively coupled to create a VIOS cluster , a method comprising: retrieving the configuration backup file from a local storage;', 'comparing a DRC name retrieved from the retrieved configuration backup file with a current DRC name associated with the VIOS partition in which the OS instance is executing; and, 'responsive to receipt of a VIOS restore command at a first VIOS within the VIOS cluster retrieving an initial UUID of the VIOS from within the configuration backup file;', 'accessing a UUID table within a management tool;', 'locating a matching UUID to the initial UUID within the UUID table; and', ...

ENFORCING LOGICAL UNIT (LU) PERSISTENT RESERVATIONS UPON A SHARED VIRTUAL STORAGE DEVICE

A method, system, and computer program product utilizes cluster-awareness to effectively maintain and update Persistent Reserve (PR) state data and provide nodes with notification of changes to PR state data within a Virtual Input/Output (I/O) Server (VIOS) cluster. A Persistent Reserve (PR) utility identifies a database that is accessible to other VIOSes in the cluster, in which database information about the current state of the Persistent Reservation is maintained. The PR utility checks the current Persistent Reserve state in the database to verify whether an initiator of a PR command is allowed to perform the command. If the initiator is allowed to perform the command, the PR utility modifies/updates the Persistent Reserve state in the database to reflect the received Persistent Reserve command. The PR utility updates the initiator's local copy of the modified PR state data and sends a corresponding notification message to other VIOSes in the cluster. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system and which generates a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition that operates within a cluster of VIOSes having a shared database , where each VIOS is cluster aware , a method comprising:receiving a Persistent Reserve (PR) command to access a shared database from an initiator VIOS;determining whether an initiator of the PR command is allowed to perform the command; updating PR state data in the shared database to reflect the received PR command;', 'updating a local copy of the updated PR state data, wherein the local copy is associated with the initiator VIOS; and', 'sending a notification message corresponding to the updated PR state data to other VIOSes in the ...

SUPPORTING CLUSTER LEVEL SYSTEM DUMPS IN A CLUSTER ENVIRONMENT

A method, system, and computer program product provides simultaneous debugging of multiple OS image and/or system dump pairs in a distributed storage repository. A management console receives a terminal debugging session request and a cluster selection from an interface and starts a debugger instance. The debugger instance autonomously identifies client LPARs and loads the system dump images assigned to the client LPARs. In response to receiving a selection of a first and second client LPARs, the debugger analyzes the first and second system dump images, respectively, and calculates relational information between the first analysis and the second analysis via one or more logical reasoning utilities of the management console. The debugger then loads the relational information to the management console interface with an analysis of one or more similarities between the first and second system dumps. 1. In a cluster-aware data processing system (DPS) having a Virtual Input/Output (I/O) Server (VIOS) cluster with a plurality of cluster aware VIOSes , a method comprising:receiving a terminal debugging session request from a management console interface of a management console that is communicatively connected to at least a first VIOS of the VIOS cluster;in response to receiving the terminal debugging session request, starting a debugger instance;receiving a cluster selection via the management console interface, wherein the cluster selection identifies a selected VIOS cluster which has a plurality of client logical partitions (LPARs), each client LPAR having a system dump image stored within a distributed storage repository of the cluster-aware DPS;the debugger instance receiving, from the management console interface, a selection of a first client LPAR and a second client LPAR from the plurality of client LPARs for analysis;analyzing a first system dump image and a second system dump image, wherein the first system dump image is the system dump image associated with a ...

AUTONOMOUS PRIMARY NODE ELECTION WITHIN A VIRTUAL INPUT/OUTPUT SERVER CLUSTER

In a data processing system having a plurality of virtual input/output servers (VIOSes) configured within a VIOS cluster, a method, data processing system and computer program product provide for autonomous election of a primary node within a virtual input/output server (VIOS) cluster. A first VIOS performs the functions of: detecting that a primary node is required for the VIOS cluster; and autonomously initiating an election process to elect a next primary node from among the VIOSes within the VIOS cluster. When the first VIOS meets the pre-established requirements for becoming a primary node, the first VIOS obtains a lock on a primary node ID field within a VIOS database (DB) and then initiates a primary node commit process to assign the first VIOS as the primary node. The first VIOS issues a notification to the VIOS cluster to notify the other VIOSes that a primary node has been elected. 1. In a data processing system having one or more computing electronic complexes (CECs) that comprise a plurality of virtual input/output (I/O) servers (VIOSes) configured within a VIOS cluster , which has an associated VIOS database (DB) and in which each VIOS provides I/O resources to one or more logical partitions (LPARs) executing within the one or more CECs , a first VIOS of the VIOS cluster executing code on a processing resource to perform a method comprising:the first VIOS of the VIOS cluster detecting that a primary node is required for the VIOS cluster; andautonomously initiating an election process to elect a next primary node from among one or more VIOSes within the VIOS cluster.2. The method of claim 1 , further comprising:determining whether a first node meets one or more pre-established requirements to become a primary node by checking one or more configuration parameters of the first node against the one or more pre-established requirements for a node to become the primary node; andin response to the first node not meeting the pre-established requirements, ...

COMMUNICATION PROTOCOL FOR VIRTUAL INPUT/OUTPUT SERVER (VIOS) CLUSTER COMMUNICATION

A first Virtual Input/Output Server (VIOS) of a VIOS cluster performs the functions of: generating, at a sending daemon of the first VIOS, a send message that is to be transmitted to a receiving daemon at a second VIOS; in response to completion of the generating of the send message, forwarding the send message to a sending virtual small computer systems interface (vscsi) kernel extension (VKE) via a system call interface; and in response to the sending VKE receiving the send message from the sending daemon, forwarding the send message to one or more second VIOSes within the VIOS cluster utilizing a kcluster interface. The sending VKE parses at least one of a message header and a sub-header of the send message; and responsive to detection of a broadcast setting for the send message, the VKE forwards the send message to all nodes within the cluster via a cluster broadcast. 1. In a data processing system having one or more computing electronic complexes (CECs) that comprise a plurality of virtual input/output (I/O) servers (VIOSes) configured within a VIOS cluster , which has an associated VIOS database (DB) and in which each VIOS provides I/O resources to one or more logical partitions (LPARs) executing within the one or more CECs , a first VIOS of the VIOS cluster performing a method comprising:generating, at a sending daemon of the first VIOS, a send message that is to be transmitted to a receiving daemon at a second VIOS;in response to completion of the generating of the send message, forwarding the send message to a sending virtual small computer systems interface (vscsi) kernel extension (VKE) via a system call interface; andin response to the sending VKE receiving the send message from the sending daemon, forwarding the send message to one or more second VIOSes within the VIOS cluster utilizing a kcluster interface.2. The method of claim 1 , wherein the generating of the send message comprises:providing a header for the send message, wherein the header includes ...

SINGLE POINT, SCALABLE DATA SYNCHRONIZATION FOR MANAGEMENT OF A VIRTUAL INPUT/OUTPUT SERVER CLUSTER

A method, data processing system and computer program product provide scalable data synchronization for a virtual input/output server (VIOS) cluster and one or more registered callers. A first VIOS is commits as a primary node of the VIOS cluster and performs the functions of: registering one or more callers to receive notification from the first VIOS of specific events occurring within the cluster; receiving notification of an occurrence of one of the specific events; and in response to receiving notification of the specific events, a deamon of the first VIOS retrieving a message payload file from a message payload file directory within the shared VIOS DB and passing the message payload file to the API, which forwards/posts the relevant event notification information from the message payload file to the TCP socket of each registered caller. 1. In a data processing system having one or more computing electronic complexes (CECs) that comprise a plurality of virtual input/output (I/O) servers (VIOSes) configured within a VIOS cluster having a shared VIOS database (DB) , wherein each VIOS provides I/O resources to one or more logical partitions (LPARs) executing within the one or more CECs , a first VIOS of the VIOS cluster executing code on a processing resource to perform a method comprising:committing the first VIOS as a primary node of the VIOS cluster;registering one or more callers to receive notification from the first VIOS of specific events occurring within the cluster;receiving notification of an occurrence of one of the specific events; andin response to receiving notification of the occurrence of one of the specific events, automatically forwarding information of the specific event to each of the one or more registered callers.2. The method of claim 1 , wherein registering the one or more callers to receive notification comprises registering a transmission control protocol (TCP) socket of each caller with an application programming interface (API) of the ...

Structure for Performing Cacheline Polling Utilizing a Store and Reserve Instruction

A design structure for performing cacheline polling utilizing a store and reserve instruction are disclosed. In accordance with one embodiment of the present invention, a first process initially requests an action to be performed by a second process. A reservation is set at a cacheable memory location via a store operation. The first process reads the cacheable memory location via a load operation to determine whether or not the requested action has been completed by the second process. The load operation of the first process is stalled until the reservation on the cacheable memory location is lost. After the requested action has been completed, the reservation in the cacheable memory location is reset by the second process. 1. A method in a computer aided design system for generating a functional design model of a mechanism for performing cacheline polling in a data processing system having a plurality of processes , said method comprising:generating a functional computer-simulated representation of a mechanism for requesting an action by a first process to be performed by a second process, and setting a reservation on a memory location via a store operation;generating a functional computer-simulated representation of a mechanism for reading a memory location by said first process via a load operation to determine whether or not said requested action has been completed by said second process;generating a functional computer-simulated representation of a mechanism for stalling said load operation until said reservation on said memory location is lost; andgenerating a functional computer-simulated representation of a mechanism for resetting said reservation in said memory location by said second process after said requested action has been completed.2. The method of claim 1 , wherein said generating a mechanism for setting further includes generating a mechanism for setting a Buffer Busy indicator on said cacheable memory location.3. (canceled)4. The method of claim ...

Method for Changing Ethernet MTU Size on Demand with No Data Loss

A method and system for substantially avoiding loss of data and enabling continuing connection to the application during an MTU size changing operation in an active network computing device. Logic is added to the device driver, which logic provides several enhancements to the MTU size changing operation/process. Among these enhancements are: (1) logic for temporarily pausing the data coming in from the linked partner while changing the MTU size; (2) logic for returning a “device busy” status to higher-protocol transmit requests during the MTU size changing process. This second logic prevents the application from issuing new requests until the busy signal is removed; and (3) logic for enabling resumption of both flows when the MTU size change is completed. With this new logic, the device driver/adapter does not have any transmit and receive packets to process for a short period of time, while the MTU size change is ongoing. 1. In a data processing system , a method comprising:receiving a request to change a size of a Maximum Transmission Unit (MTU) utilized with network-level communication, wherein the request is received during an ongoing session between a network adapter and a link partner; anddynamically completing the change of the size of the MTU to a new size by: setting an operating state of the adapter to a busy state that is communicated to a higher layer space from which transmit packets are generated; generating and issuing control packets to a network port flow to prevent additional packets coming from the link partner; and completing the change in the size of the MTU while the operating state is set to the busy state and the control packets are being issued to the network port flow, wherein the change in the size of the MTU occurs without shutting down the network adapter.2. The method of claim 1 , further comprising:providing the busy state in response to requests for transmission received from higher layer components, wherein said requests are denied ...

METHOD AND APPARATUS FOR PERFORMING REFRESH OPERATIONS IN HIGH-DENSITY MEMORIES

A method for performing refresh operations is disclosed. In response to a completion of a memory operation, a determination is made whether or not a refresh backlog count is greater than a first predetermined value. In a determination that the refresh backlog count is greater than the first predetermined value, a refresh operation is performed as soon as possible. In a determination that the refresh backlog count is not greater than the first predetermined value, a refresh operation is performed after a delay of an idle count value. 1. A method for performing refresh operations , said method comprising:in response to a completion of a memory operation, determining whether or not a refresh backlog count is greater than a first predetermined value;in a determination that said refresh backlog count is greater than said first predetermined value, performing a refresh operation as soon as possible; andin a determination that said refresh backlog count is not greater than said first predetermined value, performing a refresh operation after a delay of an idle count value.2. The method of claim 1 , wherein said first predetermined value is 7.3. The method of claim 1 , wherein said idle count value is negatively proportional to said refresh backlog count.4. The method of claim 1 , wherein said method further includesdetermining whether or not said refresh backlog count is less than a second predetermined value;in a determination that said refresh backlog count is less than said second predetermined value, performing a refresh operation after a delay of a maximum idle count value.5. The method of claim 3 , wherein said second predetermined value is 3. The present application is a continuation of U.S. patent application Ser. No. 12/959,637, filed on Dec. 3, 2010, the contents of which are incorporated herein by reference.1. Technical FieldThe present disclosure relates to memory refresh operations in general, and in particular to a method and apparatus for performing refresh ...

Electronic System for Selecting the Best Card from a Collection of Consumer Credit, Debit and Discount Cards

A method, system and computer program product for enabling completion of purchase transactions by retrieving purchase card information from an electronic database of consumer cards and applying the appropriate card to the transaction. The database, managed by a central card authority, stores client account information for cards such as debit, credit, phone, and discount cards, which are accessible via a unique, secure login/access credential, such as a username and password combination. During registration with the central card authority, a client classifies key/important factors to consider when performing purchases. The central card authority is accessed by the client during purchases from a retail facility and/or other purchasing environment. The central card authority automatically selects the best card to utilize during a purchase, after weighing the important purchasing factors related to the credit, debit, phone, and discount cards registered with the central card authority. 1. A method comprising:receiving a first credential that is linked to a customer account containing one or more pre-established electronic payment mechanisms; and accessing the customer account;', 'dynamically selecting one of the electronic payment mechanisms as a best mechanism for providing an electronic payment for a financial transaction; and', 'outputting the selected one of the electronic payment mechanisms for use in completing electronic payment for the financial transaction., 'responsive to authenticating the first credential2. The method of further comprising:displaying a graphical user interface to receive one or more of a customer identifier (ID), database login credential information, payment access credential, and payment mechanism identifier (ID) and selection criteria;receiving one or more of the customer identifier (ID), the database login credential information, the payment access credential, and the payment mechanism ID and selection criteria;storing the received one ...

METHOD FOR PRESERVING MEMORY AFFINITY IN A NON-UNIFORM MEMORY ACCESS DATA PROCESSING SYSTEM

A method for preserving memory affinity in a computer system is disclosed. The method reduces and sometimes eliminates memory affinity loss due to process migration by restoring the proper memory affinity through dynamic page migration. The memory affinity access patterns of individual pages are tracked continuously. If a particular page is found almost always to be accessed from a particular remote access affinity domain for a certain number of times, and without any intervening requests from other access affinity domain, the page will migrate to that particular remote affinity domain so that the subsequent memory access becomes local memory access. As a result, the proper pages are migrated to increase memory affinity. 1. A method for preserving memory affinity in a non-uniform memory access data processing system , said method comprising:in response to a request for memory access to a page within a first memory affinity domain, determining whether or not said request is initiated by a processor associated with said memory affinity domain;in response to the determination that said request is not initiated by a processor associated with said memory affinity domain, determining whether or not there is a page ID match with an entry within a page migration tracking module associated with said memory affinity domain;in response to the determination that there is no page ID match with any entry within said page migration tracking module, selecting an entry within said page migration tracking module and providing said entry with a new page ID and a new memory affinity ID;in response to the determination that there is a page ID match with an entry within said page migration tracking module, determining whether or not there is a memory affinity ID match with said entry with the page ID field match;in response to the determination that there is no memory affinity ID match, updating said entry with the page ID field match with a new memory affinity ID; andin response to the ...

Method for Manufacturing an Electronic Device

During manufacture of an electronic device, an aerogel coating is applied to a first side of an IC substrate of a first IC. A bonding procedure is initiated, during which IC interconnects are either placed on the coated side of the substrate or on the opposite side of the substrate. The first IC is connected on a carrier to a second IC with the coated side of the first IC facing the second IC to reduce heat transmission to the second IC during operation of the first IC. The aerogel coating reduces thermal stress to the circuit board and surrounding components, reduces the risk of overheating of critical circuit components, provides chemical and mechanical insulation from contamination during subsequent wafer handling operations, and provides a thermal isolator between IC regions of dissimilar power dissipation, which isolator facilitates efficient thermal extraction from localized hotspots. 1. An electronic device comprising:a plurality of integrated circuits, including a first IC and a second IC both having a substrate;an aerogel coating applied to a first surface of the substrate of at least the first IC; anda die attach material physically connecting the first surface of the first IC to a second surface of the second IC, wherein the first IC is connected with the aerogel coating between the first surface of the first IC and the second surface of the second IC;wherein the aerogel coating provides isolation from heat dissipation between at least the first IC and the second IC during operation of the electronic device;2. The electronic device of claim 1 , further comprising:a carrier substrate; andone or more interconnects coupling the carrier substrate to at least one of the first IC and the second IC.3. The electronic device of claim 1 , further comprising one or more interconnects attached to at least one of the first IC and the second IC and which provide signal and power transmission to and from a connected IC.4. The electronic device of claim 1 , wherein a ...

DATA PROCESSING

Disclosed is a method for identifying inactive objects in an entity. The inactive objects may be purged from an entity to reduce the size of the entity. 1. A method comprisingidentifying inactive objects in an entity; andpurging the inactive objects from the entity thereby reducing the size of the entity.2. The method as claimed in claim 1 , further comprisinggathering the inactive objects; andchecking if the inactive objects have been inactive based on predefined criteria.3. The method as claimed in wherein the predefined criteria comprises at least one from a time stamp of last use or an input provided by a user or created by the user or comparing the time stamp of creation and at a later date and determining if the time stamp is greater than a predefined threshold.4. The method as claimed in claim 1 , wherein the objects within the entity have a parent-child relationship.5. The method as claimed in claim 1 , wherein identifying an inactive object comprises identifying at least one node from a parent node or child node as an inactive object.6. The method as claimed in claim 5 , wherein all child nodes below the identified node inactive objects.7. The method as claimed in claim 1 , wherein the entity may comprise at least one of a structured or unstructured metadata format.8. The method as claimed in claim 7 , wherein the entity may comprise a database.9. The method as claimed in claim 7 , wherein the entity may comprise a set of fields linked to each other.10. The method as claimed in claim 1 , wherein a log of all inactive objects purged in a file is maintained.11. A system comprising at least a processor and a memory configured for identifying inactive objects in an entity; and purging the inactive objects from the entity thereby reducing the size of the entity.12. The system as claimed in claim 11 , further configured for gathering the inactive objects; and checking if the inactive objects have been inactive based on predefined criteria.13. The system as ...

PROVIDING FIRST FIELD DATA CAPTURE IN A VIRTUAL INPUT/OUTPUT SERVER (VIOS) CLUSTER ENVIRONMENT WITH CLUSTER-AWARE VIOSES

A first virtual I/O server (VIOS) provides a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS to register the first VIOS within a VIOS cluster. The first VIOS comprises a first field/failure data capture (FFDC) module that executes within the first VIOS and performs the functions of: receiving from an event listener a signal indicating that an FFFDC event/condition has been detected by the first VIOS; and automatically transmitting FFDC data to the shared storage repository for storage of the FFDC data within the shared storage repository. The FFDC module further performs the functions of: transmitting to one or more second VIOSes within the VIOS cluster, one or more messages to inform the one or more second VIOSes of an occurrence of the FFDC event/condition that was detected by the first VIOS. 1. In a data processing system having: a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network and a shared storage repository , a virtualization management component executing within the data processing system to generate a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition , a method comprising:processing a cluster aware (CA) operating system (OS) via a processor resource of the first VIOS partition to register the first VIOS within a VIOS cluster having one or more second VIOSes and a shared VIOS database;processing a first field/failure data capture (FFDC) module within the first VIOS to performs the functions of: receiving from an event listener a signal indicating that a first field data capture (FFDC) condition has been detected by the first VIOS; and automatically transmitting FFDC data of the FFDC condition to the shared storage repository for storage of the FFDC data within the shared storage repository.2. The method of claim 1 , wherein the FFDC module further performs the functions of ...

Management of File Images in a Virtual Environment

A method, system, and computer program product provides effective management and deployment of image files within a Virtual Input/Output (I/O) Server (VIOS) cluster. An Image Management (IM) utility utilizes a discovery process to establish connections with objects in order to manage these objects. Following discovery of an ICP client, the IM utility enables creation of a virtual server partition and initiates the importing of a captured image to a VIOS cluster Storage Pool (SP). The IM utility creates logical units (LUs) within the Image Management Fileset (IMF) for each file within the captured image. The IM utility maps the LUs to the VIOS Cluster SP using unique image file handles. The IM utility configures the new storage that comprises the created LUs. The IM utility copies image files to the appropriate storage device/LU. When import/copy of the image is completed, the IM utility activates the virtual server partition. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system and which generates a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition that operates within a VIOS cluster having a shared VIOS database , a method comprising:deploying an image capture program (ICP) agent from a management server to a first VIOS;discovering, within the VIOS cluster via the ICP agent, one or more of: (a) an image management client; and (b) a virtual storage device;creating a virtual server partition associated with the first VIOS;capturing, from within an image repository within a storage pool, an image having one or more files that can be subsequently imported by the first VIOS to the virtual storage device;importing the captured image to the virtual storage device;deploying the ...

ENVIRONMENTAL CONTROL OF LIQUID COOLED ELECTRONICS

A method, system, and computer program product are provided for controlling liquid-cooled electronics, which includes measuring a first set point temperature, T, wherein the Tis based on a dew point temperature, Tof a computer room. A second set point temperature, T, is measured, wherein the Tis based on a facility chilled liquid inlet temperature, T, and a rack power, P, of an electronics rack. A Modular Cooling Unit (MCU) set point temperature, T, is selected. The Tis the higher value of said Tand said T. Responsive to the selected T, a control valve is regulated. The control valve controls a flow of liquid that passes through a heat exchanger. 1. A method for controlling liquid-cooled electronics , said method comprising:{'sub': a', 'a', 'dp, 'measuring a first set point temperature, T, wherein said Tis based on a dew point temperature, Tof a computer room;'}{'sub': b', 'b', 'ci', 'rack, 'measuring a second set point temperature, T, wherein said Tis based on a facility chilled liquid inlet temperature, T, and a rack power, P, of an electronics rack;'}{'sub': sp', 'sp', 'a', 'b, 'selecting a Modular Cooling Unit (MCU) set point temperature, T, wherein said Tis the higher value of said Tand said T; and'}{'sub': 'sp', 'regulating a control valve that controls a flow of liquid that passes through a heat exchanger, wherein said regulating is responsive to said selected T.'}2. The method of claim 1 , said method further comprising:{'sub': sp', 'a', 'b, 'selecting a default value of said T, in response to determining said Tand said Tare not rationalized.'}3. The method of claim 2 , said method further comprising:{'sub': a', 'dp, 'selecting said default value for Tin response to determining said Tis not rationalized.'}4. The method of claim 2 , said method further comprising:{'sub': b', 'ci, 'selecting said default value for Tin response to determining said Tis not rationalized.'}5. The method of claim 1 , wherein said Tis set to a first temperature constant of 15 ...

Zero Indication Forwarding for Floating Point Unit Power Reduction

A method and system for reducing power consumption when processing mathematical operations. Power may be reduced in processor hardware devices that receive one or more operands from an execution unit that executes instructions. A circuit detects when at least one operand of multiple operands is a zero operand, prior to the operand being forwarded to an execution component for completing a mathematical operation. When at least one operand is a zero operand or at least one operand is “unordered”, a flag is set that triggers a gating of a clock signal. The gating of the clock signal disables one or more processing stages and/or devices, which perform the mathematical operation. Disabling the stages and/or devices enables computing the correct result of the mathematical operation on a reduced data path. When a device(s) is disabled, the device may be powered off until the device is again required by subsequent operations. 1. In a data processor , a method for reducing power consumption when processing mathematical operations by utilizing processor hardware devices that receive one or more operands from an execution unit , the method comprising:detecting when at least one operand of multiple operands is a zero operand before the operand is forwarded to an execution component for completing a mathematical operation;in response to at least one operand being a zero operand or being unordered, setting a first flag that triggers a gating of a clock signal, wherein the gating reduces an active floating point unit (FPU) data path by disabling select processing devices/stages of one or more processing stages/devices within the FPU data path and enables a bypassing of the completion of the mathematical operation, wherein an operand is unordered if the operand is one of a non-number or infinity; andin response to the first flag being set, gating the clock signal to disable only select processing stages/devices of the one or more processing stages/devices within the FPU data path, ...

MECHANISM TO ENABLE AND ENSURE FAILOVER INTEGRITY AND HIGH AVAILABILITY OF BATCH PROCESSING

A method, system and computer program product manages a batch processing job by: partitioning the batch processing job for execution in a plurality of batch execution servers from a cluster of computers; designating one computer from the cluster as a primary command server that oversees and coordinates execution of the batch processing job; selecting a second computer from the cluster to serve as a failover command server; storing an object data grid structure in the primary command server; replicating the object grid structure to create and store a replicated object grid structure in the failover command server; in response to the primary command server failing, restarting, by the failover command server, execution of batch processes from the batch processing job in the plurality of batch execution servers utilizing objects within the replicated object grid structure, and executing the batch processes with processing states at the time of the failover. 1. A method of managing a batch processing job , the method comprising:partitioning a batch processing job for execution in a plurality of batch execution servers from a cluster of computers;designating one computer from the cluster of computers as a primary command server, wherein the primary command server oversees and coordinates execution of the batch processing job;selecting a second computer from the cluster of computers to serve as a failover command server;storing an object data grid structure in the primary command server;replicating the object grid structure to create a replicated object grid structure that is stored in the failover command server;in response to the primary command server failing, restarting, by the failover command server, execution of batch processes from the batch processing job in the plurality of batch execution servers utilizing objects within the replicated object grid structure, wherein the execution of the batch processes is performed with processing states of the plurality of ...

Multiple Node/Virtual Input/Output (I/O) Server (VIOS) Failure Recovery in Clustered Partition Mobility

A method, system, and computer program product utilizes cluster-awareness to effectively support a live partition mobility (LPM) event and provide recovery from node failure within a Virtual Input/Output (I/O) Server (VIOS) cluster. An LPM utility creates a monitoring thread on a first VIOS on initiation of a corresponding LPM event. The monitoring thread tracks a status of an LPM and records status information in the mobility table of a database. The LPM utility creates other monitoring threads on other VIOSes running on the (same) source server. If the first VIOS VIOS sustains one of multiple failures, the LPM utility provides notification to other functioning nodes/VIOSes. The LPM utility enables a functioning monitoring thread to update the LPM status. In particular, a last monitoring thread may perform cleanup/update operations within the database based on an indication that there are nodes on the first server that are in failed state. 16-. (canceled)7. A computing electronic complex comprising:a processor;a distributed data storage;an input/output (I/O) interface coupled to an external network; and a hypervisor;', 'a plurality of operating system (OS) partitions; and', 'a utility which when executed on the processor provides the functions of:, 'a memory coupled to said processor, wherein said memory includesactivating a first monitoring thread on a first VIOS of a first server to track a status of a live partition mobility (LPM) event;recording information about the LPM event within the shared database by using said first monitoring thread;in response to the first VIOS sustaining a failure condition, identifying one or more functioning monitoring threads that continue to function on a source server, wherein the failure condition results in a loss of LPM event monitoring by the first monitoring thread;determining whether said one or more functioning monitoring threads is a single, last monitoring thread; andin response to a first VIOS on the first server being ...

EFFICIENT SERIALIZATION OF MUTABLE OBJECTS

A method of serialization in a data processing system includes serializing a mutable object utilizing a full serialization process, caching primitive data and metadata regarding the mutable object in binary format in cache and then checking whether primitive fields of the mutable object are modified. Thereafter, the mutable object is again serialized utilizing an abbreviated serialization process by reference to the cached primitive data and metadata if the primitive fields of the object are not modified. In the event that primitive fields of the object are modified, the full serialization process is utilized. Thereafter, the serialized mutable object is communicated to a distributed code element. 1. A method of serializing a program object in a data processing system , the method comprising:serializing a mutable object utilizing a full serialization process and caching primitive data and metadata regarding the mutable object in binary format in cache; again serializing the mutable object utilizing an abbreviated serialization process by reference to the cached primitive data and metadata; and', 'communicating the serialized mutable object to a distributed code element., 'thereafter2. The method of claim 1 , wherein the caching includes:caching the metadata data in a metadata cache; andcaching the primitive data in a separate primitive data cache.3. The method of claim 1 , wherein:the mutable object includes a field indicating whether or not the mutable object has changed since last serialized; andagain serializing the mutable object utilizing an abbreviated serialization process includes again serializing the mutable object utilizing the abbreviated serialization process in response to the field indicating that the mutable object has not changed since last serialized.4. The method of claim 3 , wherein:the mutable object includes a primitive field and an object header, the object header containing the field;the method further comprises setting the field to indicate ...

Method and Arrangement for Fault Handling in a Distributed IT Environment

An improved method for fault handling in a distributed IT environment. The distributed IT environment executes at least one workflow application interacting with at least one application by using interface information about the at least one application. The method comprises: storing at least one fault handling description in a implementation-independent meta language associated with the at least one application; associating the interface information with the at least one fault handling description based on at least one defined fault handling policy, created based on at least one service definition; and the workflow application if a fault response from the at least one application is received: retrieving at least one associated fault handling description based on at least one fault handling policy, and interpreting and executing a particular meta language code of the at least one associated fault handling description in order to continue the defined workflow application. 12104040. A method for fault handling in a distributed IT environment that executes at least one workflow application () interacting with at least one application () by using interface information about said at least one application () , [{'b': 9', '40, 'storing at least one fault handling description () in an implementation-independent meta language associated with said at least one application ();'}, {'b': 40', '9', '7', '5, 'associating said interface information about said at least one application () with said at least one fault handling description () based on at least one defined fault handling policy (), which is created based on at least one service definition ();'}, {'b': 40', '210, 'claim-text': [{'b': 9', '7', '7, 'retrieving at least one associated fault handling description () based on at least one fault handling policy (, ′), and'}, {'b': 9', '210, 'interpreting and executing a particular meta language code of said at least one associated fault handling description () in order to ...

Efficient Backup and Restore of Virtual Input/Output Server (VIOS) Cluster

A method enables cluster-level backup and restore functionality of all Virtual Input/Output Server (VIOS) configuration data within a VIOS cluster and the data of a shared VIOS cluster database. The method comprises: performing, via a backup/restore utility of a VIOS partition, a cluster level backup, which creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from the shared VIOS database of the VIOS cluster; storing the VIOS cluster configuration backup file within a storage location; and responsive to receipt of a VIOS restore command at a VIOS partition: retrieving the configuration backup file from the storage location; restoring a configuration of the hardware, logical and virtual devices of each VIOS within the VIOS cluster to prior state; and restoring the shared VIOS database with the backed-up cluster data. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system to generate a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition , a method comprising:performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a cluster level backup operation from one or more VIOS partitions, including the first VIOS partition and at least one second VIOS partition, wherein the cluster level backup operation creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from a shared VIOS database of the VIOS cluster;storing the ...

METHOD TO DYNAMICALLY DISTRIBUTE A MULTI-DIMENSIONAL WORK SET ACROSS A MULTI-CORE SYSTEM

A method provides efficient dispatch/completion of an N Dimensional (ND) Range command in a data processing system (DPS). The method comprises: a compiler generating one or more commands from received program instructions; ND Range work processing (WP) logic determining when a command generated by the compiler will be implemented over an ND configuration of operands, where N is greater than one (1); automatically decomposing the ND configuration of operands into a one (1) dimension (1D) work element comprising P sequentially ordered work items that each represent one of the operands; placing the 1D work element within a command queue of the DPS; enabling sequential dispatching of 1D work items in ordered sequence from to one or more processing units; and generating an ND Range output by mapping the 1D work output result to an ND position corresponding to an original location of the operand represented by the 1D work item. 1. In a data processing system , a method for efficient dispatch/completion of an N Dimensional (ND) Range command , said method comprising:a compiler generating one or more commands from received program instructions, wherein said one or more commands are utilized by a runtime scheduler to schedule work for execution on one or more processing units within the data processing system;ND Range work scheduling (WS) logic associated with the compiler determining when a command generated by the compiler will be implemented over an ND Range of operands that are arranged in an N dimensional configuration, where N is greater than one;when N is greater than one, automatically decomposing the ND Range of operands into a one (1) dimension work element comprising P sequentially ordered work items that each represent, within the one dimensional work element, one of the ND Range of operands;placing the single dimension work element within one or more entries of a command queue of the data processing system, wherein each of the one or more entries holds a 1D ...

Method for using a temporary object handle

A method is provided for using a temporary object handle. The method performed at a resource manager includes: receiving an open temporary handle request from an application for a resource object, wherein a temporary handle can by asynchronously invalidated by the resource manager at any time; and creating a handle control block at the resource manager for the object, including an indication that the handle is a temporary handle. The method then includes: responsive to receiving a request from an application to use a handle, which has been invalidated by the resource manager, sending a response to the application that the handle is invalidated. 1. A computer implemented method for using a temporary object handle at a resource manager , comprising:receiving an open temporary handle request from an application for a resource object, wherein a temporary handle can by asynchronously invalidated by the resource manager at any time; andallocating a handle control block at the resource manager for the object including an indication that the handle is a temporary handle.2. The method as claimed in claim 1 , further comprising:receiving a request from an application to use a handle which has been invalidated by the resource manager; andsending a response to the application that the handle is invalidated.3. The method as claimed in claim 1 , further comprising referencing the handle control block to an object control block as an indirect reference to the object.4. The method as claimed in claim 1 , further comprising:the resource manager asynchronously invalidating the temporary handle by indicating in the handle control block that the handle is invalid.5. The method as claimed in claim 4 , further comprising de-referencing the handle control block from the object control block.6. The method as claimed in claim 1 , wherein an open temporary handle request has a priority attribute and the resource manager invalidates any existing temporary handle on the resource object with a ...

Method and Device for Preventing CSRF Attack

The disclosure provides method for preventing CSRF attacks, in which the method provides: intercepting request sent from a client browser to a server; generating a token; generating a response to the request; inserting the token into the response to the request; and sending the response to the request to the client browser with the token inserted into the response. With the method of the disclosure, it is assured that a token is inserted into all the requests made by a user through a client browser for accessing a resource. And it can be assured that the request is issued by the user himself by verifying whether the token in the request is valid, thereby preventing a CSRF attack. 1. A method for preventing a CSRF attack , the method comprising:intercepting a request sent from a client browser to a server;generating a token;generating a response to the request;inserting the token into the response to the request; andsending the response to the request to the client browser with the token inserted in the response.2. The method according to claim 1 , wherein:the response is a HTTP 307 response.3. The method according to claim 1 , further comprising:intercepting a subsequent request sent from the client browser to the server;reading a token in the subsequent request sent from the client browser to the server;verifying whether the token in the subsequent request sent from the client browser to the server is valid.4. The method according to claim 3 , further comprising:if there is a token in a URL requested in the subsequent request sent from the client browser to the server and the token is valid, then forwarding the subsequent request to the server.5. The method according to claim 3 , further comprising: generating a response to the subsequent request;', 'inserting the token into the response to the subsequent request; and', 'sending the response to the subsequent request to the client browser with the token inserted in the response., 'if there is no token in a URL ...

Multiple Node/Virtual Input/Output (I/O) Server (VIOS) Failure Recovery in Clustered Partition Mobility

A method utilizes cluster-awareness to effectively support a live partition mobility (LPM) event and provide recovery from node failure within a Virtual Input/Output (I/O) Server (VIOS) cluster. An LPM utility creates a monitoring thread on a first VIOS on initiation of a corresponding LPM event. The monitoring thread tracks a status of an LPM and records status information in the mobility table of a database. The LPM utility creates other monitoring threads on other VIOSes running on the (same) source server. If the first VIOS VIOS sustains one of multiple failures, the LPM utility provides notification to other functioning nodes/VIOSes. The LPM utility enables a functioning monitoring thread to update the LPM status. In particular, a last monitoring thread may perform cleanup/update operations within the database based on an indication that there are nodes on the first server that are in failed state. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a plurality of virtual I/O servers (VIOSes) that form a VIOS cluster with a shared database , where each VIOS is cluster aware , a method comprising:activating a first monitoring thread on a first VIOS of a first server to track a status of a live partition mobility (LPM) event;recording information about the LPM event within the shared database by using said first monitoring thread;in response to the first VIOS sustaining a failure condition, identifying one or more functioning monitoring threads that continue to function on a source server, wherein the failure condition results in a loss of LPM event monitoring by the first monitoring thread;determining whether said one or more functioning monitoring threads is a single, last monitoring thread; andin response to a first VIOS on the first server being in failed state, performing, via said last monitoring ...

Check-point Based High Availability: Network Packet Buffering in Hardware

A method, system, and computer program product enhances resource/process availability by providing hardware based buffering of network packets during checkpointing in a virtualized environment. A High Availability Checkpoint (HAC) utility pre-configures a physical network adapter to buffer outgoing network packets from virtual machines that employ a checkpointing technology. In response to receiving an outgoing network packet from a virtual machine and determining that the virtual machine employs a pre-specified checkpointing technology, the physical network adapter buffers the outgoing network packet. In addition, a primary host performs/facilitates checkpoint operations (associated with the virtual machine) with a secondary host. When checkpoint operations are successfully completed, the HAC utility triggers the transmission of the buffered network packets from the network adapter to a network destination. The physical network adapter minimizes checkpointing network latency by pre-assigning a higher priority to a buffered network packet from a checkpointing virtual machine than to a new network packet that originates from a non-checkpointing virtual machine. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network and a virtualization management component executing within the data processing system and which generates (a) a plurality of operating system (OS) partitions , a method comprising:receiving, at the physical network adapter, configuration information that provides an indication that one or more virtual machines respectively employ a checkpointing technology;receiving at the physical network adapter one or more outgoing network packets from a first virtual machine; determines whether the virtual machine that originated the outgoing network packet employs a checkpointing technology; and', 'in response to a determination that the virtual ...

ENERGY BASED RESOURCE ALLOCATION ACROSS VIRTUALIZED MACHINES AND DATA CENTERS

A system and computer program product allocates energy entitlement to a logical partition (LPAR) executing on a data processing system. An energy entitlement allocation (EEA) utility enables an administrator to specify a minimum and/or maximum energy entitlement and An LPAR priority. When the relevant LPARs utilize the respective minimum energy entitlement based on respective energy consumption, the EEA utility determines whether the LPAR (and other LPARs) has satisfied a respective maximum energy entitlement. When the LPAR has not satisfied its maximum energy entitlement, the EEA utility allocates unused energy entitlement from the data processing system to the LPAR, according to an allocation policy. Additionally, the EEA utility dynamically adjusts a priority level for the LPAR to efficiently control resource allocation, according to the LPAR's energy consumption relative to its energy entitlement. In addition, the EEA utility is able to transfer unused energy entitlement to other data processing systems requiring further allocation of energy entitlement. 17.-. (canceled)8. A computing electronic complex comprising:a processor;an input/output (I/O) interface coupled to an external network; and a hypervisor;', 'a plurality of operating system (OS) partitions;', 'a plurality of logical partitions (LPARs); and', 'a utility which when executed on the processor causes the computing electronic complex to:, 'a memory coupled to said processor, wherein said memory includesestablish a minimum energy entitlement for an LPAR;determine one or more of: (a) an amount of energy consumed by the LPAR; and (b) an amount of energy respectively consumed by other LPARs;determine whether: (a) said amount of energy consumed by the LPAR is adequate to satisfy the minimum energy entitlement; and (b) said amount of energy consumed by the other LPARs respectively satisfy corresponding minimum energy entitlements;in response to the amount of energy consumed by the LPAR being adequate to ...

Energy Based Resource Allocation Across Virtualized Machines and Data Centers

A method allocates energy entitlement to a logical partition (LPAR) executing on a data processing system. An energy entitlement allocation (EEA) utility enables an administrator to specify a minimum and/or maximum energy entitlement and an LPAR priority. When the relevant LPARs utilize the respective minimum energy entitlement based on a respective energy consumption, the EEA utility determines whether the LPAR(s) has satisfied a respective maximum energy entitlement. When the LPAR has not satisfied its maximum energy entitlement, the EEA utility allocates unused energy entitlement from the data processing system to the LPAR, according to an allocation policy. Additionally, the EEA utility dynamically adjusts a priority level for the LPAR to efficiently control resource allocation, according to the LPAR's energy consumption relative to its energy entitlement. In addition, the EEA utility is able to transfer unused energy entitlement to other data processing systems requiring further allocation of energy entitlement. 1. In a data processing system having one or more processors , one or more memories coupled to the one or more processors , at least one input/output (I/O) adapter that enables connection to an external network , and a virtualization management component executing within the data processing system and which generates a plurality of operating system (OS) partitions and one or more logical partitions (LPARs) , a method comprising:establishing a minimum energy entitlement for an LPAR;determining at least one of: (a) an amount of energy consumed by the LPAR; and (b) an amount of energy respectively consumed by other LPARs;determining whether: (a) said amount of energy consumed by the LPAR is adequate to satisfy the minimum energy entitlement; and (b) said amount of energy consumed by the other LPARs respectively satisfy corresponding minimum energy entitlements;in response to the amount of energy consumed by the LPAR being adequate to satisfy the minimum ...

Selecting a Primary-Secondary Host Pair for Mirroring Virtual Machines

A system and a computer program product for selecting a primary-secondary host pair for mirroring virtual machines. The system includes a processor collecting data related to each of a plurality of potential primary-secondary host pairs in a computer network. The processor analyzes each of the plurality of potential primary-secondary host pairs in the computer network utilizing performance metrics. An ideal primary-secondary host pair in the computer network is determined by the processor based on the analysis of the performance metrics of each of the plurality of potential primary-secondary host pairs. In response to determining the ideal primary-secondary host pair, a primary host virtual machine is mirrored onto the secondary host of the primary-secondary host pair. 17.-. (canceled)8. A data processing system comprising:at least one memory having a set of instructions located therein; andat least one processor in communication with the at least one memory, the at least one processor operable to execute the set of instructions which cause the at least one processor to:collect data related to each of a plurality of potential primary-secondary host pairs in the computer network;analyze each of the plurality of potential primary-secondary host pairs in the computer network utilizing performance metrics;determine an ideal primary-secondary host pair in the computer network based on the analysis of each of the plurality of potential primary-secondary host pairs; andin response to the determination of the ideal primary-secondary host pair, mirror a primary host virtual machine onto the secondary host of the primary-secondary host pair.9. The data processing system of claim 8 , further comprising instructions that cause the at least one processor to analyze each of the plurality of potential primary-secondary host pairs in the computer network utilizing performance metrics claim 8 , wherein the performance metrics comprise one or more metrics selected from a group ...

Mirroring Virtual Machines from a Primary Host to a Secondary Host

A method for mirroring virtual machines from a primary host to a secondary host. The method includes tracking changes for each of a plurality of memory pages and processor states for one or more primary host virtual machines. Responsive to an occurrence of a checkpoint, the primary host virtual machines are stopped. A determination is made if each of the memory pages is frequently changed. In response to the memory page being frequently changed, the frequently changed memory page is marked as being writeable and copied to a buffer. In response to the memory page being infrequently changed, the infrequently changed memory page is marked as being read only. The one or more primary host virtual machines are resumed. A copy of the memory pages, the buffer and changes to the processor states are transmitted to the secondary host. 1. A computer implemented method of mirroring contents of a primary host computer system onto a secondary host computer system , the method comprising:tracking changes for each of a plurality of memory pages for one or more primary host virtual machines;tracking changes to a plurality of processor states for one or more primary host virtual machines;responsive to an occurrence of a checkpoint, stopping one or more of the primary host virtual machines;determining for the memory pages, if at least one particular memory page of the plurality of memory pages is a frequently changed memory page;in response to at least one particular memory page being a frequently changed memory page, marking the frequently changed memory page as writeable and copying the frequently changed memory page to a buffer;in response to a memory page being infrequently changed, marking the infrequently changed memory page as read only;resuming the one or more primary host virtual machines; andtransmitting a copy of the memory pages, the buffer, and the changes to the processor states to the secondary host.2. The method of claim 1 , further comprising maintaining a count of a ...

Maintaining Consistency of Storage in a Mirrored Virtual Environment

A method of achieving data consistency in a shared storage accessible by a first and second machine. The method includes, in response to receiving state information of the first machine, configuring the second machine to a mirrored operating state corresponding to an operating state of the first machine, receiving a notification that the first machine will overwrite existing data stored in the shared storage, and, in response to the notification, reading the existing data, storing a copy of existing data in a local storage of the second machine, and sending an acknowledgment to the first machine that the copy has been stored in the local storage, to enable the first machine to overwrite the existing data with newly written data. The method also includes, in response to receiving a failure notification, retrieving the copy of the existing data, overwriting the newly written data with the copy of the existing data. 1. A method of achieving data consistency in a shared storage accessible by a first machine and a second machine , the method comprising:receiving a notification that the first machine will overwrite existing data that is stored in the shared storage, wherein the notification is received following a first checkpoint at the first machine, and wherein the first machine and the second machine are configured to perform work that modifies data in the shared storage; and storing a copy of the existing data in a local storage of the second machine; and', 'sending an acknowledgment to the first machine that the copy of the existing data has been successfully stored in the local storage, to trigger the first machine to proceed with overwriting the existing data in the shared storage with new data;, 'in response to receiving the notification that the first machine will overwrite the existing data that is stored in the shared storage retrieving the copy of the existing data from the local storage of the second machine,', 'overwriting the new data in the shared storage ...

RESOURCE RECOVERY FOR CHECKPOINT-BASED HIGH-AVAILABILITY IN A VIRTUALIZED ENVIRONMENT

A computer-implemented method, computer program product and data processing system provide checkpoint high-available for an application in a virtualized environment with reduced network demands. An application executes on a primary host machine comprising a first virtual machine. A virtualization module receives a designation from the application of a portion of the memory of the first virtual machine as purgeable memory, wherein the purgeable memory can be reconstructed by the application when the purgeable memory is unavailable. Changes are tracked to a processor state and to a remaining portion that is not purgeable memory and the changes are periodically forwarded at checkpoints to a secondary host machine. In response to an occurrence of a failure condition on the first virtual machine, the secondary host machine is signaled to continue execution of the application by using the forwarded changes to the remaining portion of the memory and by reconstructing the purgeable memory. 1. A computer-implemented method for resource recovery , the method comprising:a processor executing an application on a primary host machine comprising a first virtual machine with the processor and a memory;receiving a designation from the application of a portion of the memory of the first virtual machine as purgeable memory, wherein the purgeable memory represents portions of memory that can be reconstructed by the application when the purgeable memory is unavailable;tracking changes to a processor state and to a remaining portion of the memory that is not designated by the application as purgeable memory;periodically stopping the first virtual machine;in response to stopping the first virtual machine, forwarding the changes to the remaining portion of the memory to a secondary host machine comprising a second virtual machine;in response to completing the forwarding of the changes, resuming execution of the first virtual machine; andin response to an occurrence of a failure condition ...

MEMORY RECORDER QUEUE BIASING PRECEDING HIGH LATENCY OPERATIONS

A memory system and data processing system for controlling memory refresh operations in dynamic random access memories. The memory controller comprises logic that: tracks a time remaining before a scheduled time for performing a high priority, high latency operation a first memory rank of the memory system; responsive to the time remaining reaching a pre-established early notification time before the schedule time for performing the high priority, high latency operation, biases the re-order queue containing memory access operations targeting the plurality of ranks to prioritize scheduling of any first memory access operations that target the first memory rank. The logic further: schedules the first memory access operations to the first memory rank for early completion relative to other memory access operations in the re-order queue that target other memory ranks; and performs the high priority, high latency operation at the first memory rank at the scheduled time. 17-. (canceled)8. (canceled)9. A memory system comprising:at least one memory device having a plurality of individually accessible ranks; tracks a time remaining before a scheduled time for performing a high priority, high latency operation a first memory rank of the memory system, wherein the memory system comprises a plurality of ranks that are individually accessible by different memory access operations scheduled from a command re-order queue of the memory controller;', 'responsive to the time remaining reaching a pre-established early notification time before the schedule time for performing the high priority, high latency operation, biases the re-order queue containing memory access operations targeting the plurality of ranks to prioritize scheduling of any first memory access operations that target the first memory rank;', 'schedules the first memory access operations to the first memory rank for early completion relative to other memory access operations in the re-order queue that target other ...

Efficient Backup and Restore of a Cluster Aware Virtual Input/Output Server (VIOS) Within a VIOS Cluster

In a Virtual Input/Output (I/O) Server (VIOS) partition within a data processing system that comprises cluster-aware VIOSes, a method includes: performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a backup operation on the first VIOS partition, which creates a first configuration backup file having configuration information about the hardware, logical and virtual devices of the VIOS partition; storing the configuration backup file within local storage; and responsive to receipt of a VIOS restore command: retrieving the configuration backup file from the local storage; and restoring the configuration of the hardware, logical and virtual devices of the first VIOS to a state that existed at a time at which the backup operation creating the configuration backup file was performed. 1. In a data processing system having a processor , a memory coupled to the processor , at least one input/output (I/O) adapter that enables connection to an external network with a shared storage repository , and a virtualization management component executing within the data processing system to generate a plurality of operating system (OS) partitions including a first virtual I/O server (VIOS) partition of multiple VIOS partitions communicatively coupled to create a VIOS cluster , a method comprising:performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a backup operation on the first VIOS partition, which creates a first configuration backup file having configuration information about the hardware, logical and virtual devices of the first VIOS partition;storing the configuration backup file within local storage;storing a copy of the configuration backup file within a VIOS database (DB) of the VIOS cluster; and retrieving the configuration backup file from the local storage; and', 'restoring the ...

Demand-Based Memory Management of Non-pagable Data Storage

Management of a UNIX-style storage pools is enhanced by specially managing one or more memory management inodes associated with pinned and allocated pages of data storage by providing indirect access to the pinned and allocated pages by one or more user processes via a handle, while preventing direct access of the pinned and allocated pages by the user processes without use of the handles; scanning periodically hardware status bits in the inodes to determine which of the pinned and allocated pages have been recently accessed within a pre-determined period of time; requesting via a callback communication to each user process to determine which of the least-recently accessed pinned and allocated pages can be either deallocated or defragmented and compacted; and responsive to receiving one or more page indicators of pages unpinned by the user processes, compacting or deallocating one or more pages corresponding to the page indicators. 1. A computer program product for memory management of a storage pool consisting of a range of virtual addresses managed by a file system of a computing platform , the computer program product comprising a computer readable storage medium having program code embodied therewith , the program code executable by a processor to:manage by a processor a memory storage pool consisting of a range of virtual addresses associated with allocated pages of data storage by providing indirect access to the allocated pages by one or more user processes via a handle;scan by the processor hardware status bits to determine which of the allocated pages have been accessed within a pre-determined period of time;request by the processor to at least one user process of at least one of the allocated pages to determine if at least one accessed allocated page can be managed by one or more memory management actions selected from the group consisting of deallocation, defragmentation and compacting; andresponsive to receiving from the user process and indicator of at ...

CONSTRUCTING INDUCTIVE COUNTEREXAMPLES IN A MULTI-ALGORITHM VERIFICATION FRAMEWORK

A computer-implemented method simplifies a netlist, verifies the simplified netlist using induction, and remaps resulting inductive counterexamples via inductive trace lifting within a multi-algorithm verification framework. The method includes: a processor deriving a first unreachable state information that can be utilized to simplify the netlist; performing a simplification of the netlist utilizing the first unreachable state information; determining whether the first unreachable state information can be inductively proved on an original version of the netlist; and in response to the first unreachable state information not being inductively provable on the original netlist: projecting the first unreachable state information to a minimal subset; and adding the projected unreachable state information as an invariant to further constrain a child induction process. Adding the projected state information as an invariant ensures that any resulting induction counterexamples can be mapped to valid induction counterexamples on the original netlist before undergoing the simplification. 1. A computer-implemented method for simplifying a netlist via an inductive trace lifting within a multi-algorithm verification framework , the method comprising:a processor of a computing device deriving first unreachable state information that can be utilized to simplify the netlist;performing a simplification of the netlist utilizing the first unreachable state information;determining whether the first unreachable state information can be inductively proved on an original version of the netlist; and projecting the first unreachable state information to a minimal subset; and', 'said adding the projected unreachable state information as an invariant to further constrain a child induction process, wherein adding the projected first unreachable state information as an invariant ensures that any resulting induction counterexamples can be mapped to valid induction counterexamples on the original ...

METHOD AND SYSTEM FOR OPTIMAL DIAMETER BOUNDING OF DESIGNS WITH COMPLEX FEED-FORWARD COMPONENTS

A computer-implemented method includes a processor identifying, within the netlist, at least one strongly connected components (SCCs) that has a reconvergent fanin input with at least two input paths from the reconvergent fanin input having a different propagation delay to the SCC. The method then computes an additive diameter for the netlist comprising at least one SCC, where the additive diameter includes a fanin additive diameter determined based on a propagation delay difference of the at least two input paths to a SCC and a number of complex feed-forward components within at least one input path. In response to the reconvergent fanin input to the SCC providing a binate function, the method computes a multiplicative diameter for the SCC utilizing a least common multiple (LCM) derived from one or more propagation delay differences across each reconvergent fanin input leading to the SCC. 1. A computer-implemented method for determining a tight diameter bound of a netlist having at least one complex feed-forward component , the method comprising:a processor of a computing device identifying, within the netlist, one or more strongly connected components (SCCs), and identifying at least one SCC of the one or more SCCs that has a reconvergent fanin input with at least two input paths from the reconvergent fanin input having a different propagation delay to the SCC;in response to identifying the at least one SCC, computing an additive diameter for the at least one SCC, wherein the additive diameter includes a fanin additive diameter determined based on a propagation delay difference of the at least two input paths to the SCC;in response to the reconvergent fanin input to the SCC providing a binate function, computing a multiplicative diameter for the SCC utilizing a least common multiple (LCM) derived from one or more propagation delay differences across each reconvergent fanin input leading to the SCC; computing a final additive diameter for the netlist, wherein the ...

Fused Multiply-Adder with Booth-Encoding

A fused multiply-adder is disclosed. The fused multiply-adder includes a Booth encoder, a fraction multiplier, a carry corrector, and an adder. The Booth encoder initially encodes a first operand. The fraction multiplier multiplies the Booth-encoded first operand by a second operand to produce partial products, and then reduces the partial products into a set of redundant sum and carry vectors. The carry corrector then generates a carry correction factor for correcting the carry vectors. The adder adds the redundant sum and carry vectors and the carry correction factor to a third operand to yield a final result. 1. A fused multiply-adder comprising:a Booth encoder for encoding a first operand;a fraction multiplier for multiplying said encoded first operand by a second operand to produce partial products, and for reducing said partial products to a set of sum and carry vectors;a carry corrector for generating a carry correction factor for correcting a carry bit stemmed from a Booth encoding of said first operand that is less than full-precision of said fused multiply-adder; andan adder circuit for adding said sum and carry vectors and said carry correction factors to a third operand to produce a final result.2. The fused multiply-adder of claim 1 , wherein one of said sum vectors includes a high sum vector and a low sum vector claim 1 , and one of said carry vectors includes a high carry vector and a low carry vector.3. The fused multiply-adder of claim 2 , wherein said carry corrector uses said carry correction factor to correct one bit within said high carry vector and one bit within said low carry vector.4. The fused multiply-adder of claim 2 , wherein said carry correction factor is determined by SOR C claim 2 , wherein said Sis a boundary bit position located between said high sum vector and said low sum vector claim 2 , said Cis a boundary bit position located between said high carry vector and said low carry vector.5. The fused multiply-adder of claim 1 , ...

EFFICIENT MANAGEMENT OF COMPUTER MEMORY USING MEMORY PAGE ASSOCIATIONS AND MEMORY

A system for managing memory operations. The system includes a processor executing instructions that cause the processor to read a first memory page from a storage device responsive to a request for the first memory page and store the first memory page to system memory. Based on a pre-established set of association rules, one or more associated memory pages are identified that are related to the first memory page. The associated memory pages are read from the storage device and compressed to generate corresponding compressed associated memory pages. The compressed associated memory pages are also stored to the system memory to enable faster access to the associated memory pages during processing of the first memory page. The compressed associated memory pages are individually decompressed in response to the particular page being required for use during processing. 17-. (canceled)8. A data processing system comprising:at least one memory;one or more processors in communication with the memory, the processors operable to execute instructions which cause the processor to:responsive to a request for a first memory page, read the first memory page from a storage device;store the first memory page to a system memory;identify one or more associated memory pages that are related to the first memory page by a set of pre-established association rules;read each of the one or more associated memory pages from the storage device;compress each of the one or more associated memory pages to generate a corresponding compressed associated memory page; andstore the compressed associated memory page to the system memory to enable faster access to the associated memory pages during processing of the first memory page.9. The data processing system of claim 8 , further comprising instructions that cause the processor to:determine if the first memory page has been removed from the system memory; andresponsive to the first memory page being removed from the system memory, remove the one or ...

Memory Reorder Queue Biasing Preceding High Latency Operations

A method for controlling memory refresh operations in dynamic random access memories. The method includes determining a count of deferred memory refresh operations for a first memory rank. Responsive to the count approaching a high priority threshold, issuing an early high priority refresh notification for the first memory rank, which indicates the pre-determined time for performing a high priority memory refresh operation at the first memory rank. Responsive to the early high priority refresh notification, the behavior of a read reorder queue is dynamically modified to give priority scheduling to at least one read command targeting the first memory rank, and one or more of the at least one read command is executed on the first memory rank according to the priority scheduling. Priority scheduling removes these commands from the re-order queue before the refresh operation is initiated at the first memory rank. 1. A method of operating a memory system comprising:a memory controller tracking a time remaining before a scheduled time for performing a high priority, high latency operation to a first memory rank of the memory system, wherein the memory system comprises a plurality of ranks that are individually accessible by different memory access operations scheduled from a command re-order queue of the memory controller;responsive to the time remaining reaching a pre-established early notification time before the schedule time for performing the high priority, high latency operation, biasing the re-order queue containing memory access operations targeting the plurality of ranks to prioritize scheduling of any first memory access operations that target the first memory rank;scheduling the first memory access operations to the first memory rank for early completion relative to other memory access operations in the re-order queue that target other memory ranks; andperforming the high priority, high latency operation at the first memory rank at the scheduled time;wherein ...

CROSS ENTERPRISE COMMUNICATION

A method provides cross enterprise communication in which intermediary communication components carry out cross enterprise communication. The method at a first sending enterprise comprises: receiving a signed encrypted message from a sender within a first enterprise; validating the sender; decrypting the message; encrypting the message for receipt by a second enterprise; signing the encrypted message by the first enterprise; and sending the re-signed re-encrypted message to a second enterprise. The method at the second receiving enterprise comprises: receiving a signed encrypted message from a first enterprise; validating that the first enterprise is the sender; decrypting the message; encrypting the message for receipt by one or more recipients at the second enterprise; signing the encrypted message by the second enterprise indicating that the message is from the first enterprise; and sending the re-signed re-encrypted message to the one or more recipients of the second enterprise. 1110. A method for cross enterprise communication at a first sending enterprise () , the method comprising:{'b': 401', '501', '111', '114', '110, 'receiving (, ) a signed, previously-encrypted message from a sender (-) within a first enterprise ();'}{'b': 402', '502, 'validating (, ) the sender;'}{'b': 403', '504, 'decrypting (, ) the message;'}{'b': 404', '503, 'encrypting (, ) the message for receipt by a second enterprise;'}{'b': 405', '505, 'signing (, ) the encrypted message by the first enterprise; and'}{'b': 406', '506', '120, 'sending (, ) the encrypted message signed by the first enterprise to the second enterprise ().'}2503504. The method as claimed in claim 1 , wherein the step of encrypting () the message is performed before the message is decrypted () in order to prevent the plain text of the message from being revealed.3. The method as claimed in claim 1 , further comprising:{'b': 116', '110, 'maintaining a first list of authorized senders () at the first enterprise ().'}4. ...

STRING CACHE FILE FOR OPTIMIZING MEMORY USAGE IN A JAVA VIRTUAL MACHINE

A method, system and computer program product for optimizing memory usage associated with duplicate string objects in a Java virtual machine. The method comprises scanning a heap of the Java virtual machine at the end of the start-up process of the virtual machine to identify duplicate strings associated with the virtual machine, storing the identified strings in a string cache file, and determining whether a new string that needs to be created during start-up already exists in the string cache file. The duplicate strings are added to an interned strings table. A reference to a duplicate string is returned if a string to be created is already in the string cache file. 1. A computer-implemented method for optimizing memory usage in a virtual machine having a memory heap , comprising:scanning the memory heap at the end of a start-up process of the virtual machine to identify duplicate strings associated with the virtual machine;storing the identified duplicate strings in a string cache file; anddetermining whether a string created by the virtual machine during the start-up process is already in the string cache file.2. The method of claim 1 , wherein if the string cache file exists at the beginning of the start-up process claim 1 , then the strings in the string cache file are added to an interned strings table.3. The method of claim 2 , further comprising loading a class file into the virtual machine and wherein the added strings are associated with the loaded class file.4. The method of claim 1 , wherein the virtual machine continues with the start-up process if no string was created during the start-up process.5. The method of claim 4 , further comprising determining whether the string cache file currently exists for the virtual machine if a string was created during the start-up process.6. The method of claim 5 , further comprising determining whether the created string is already in an interned strings table and if so claim 5 , returning a reference to the ...

EFFICIENT MANAGEMENT OF COMPUTER MEMORY USING MEMORY PAGE ASSOCIATIONS AND MEMORY COMPRESSION

A method for managing memory operations includes reading a first memory page from a storage device responsive to a request for the first memory page. The first memory page is stored to a system memory. Based on a pre-established set of association rules, one or more associated memory pages are identified that are related to the first memory page. The associated memory pages are read from the storage device and compressed to generate corresponding compressed associated memory pages. The compressed associated memory pages are also stored to the system memory to enable faster access to the associated memory pages during processing of the first memory page. The compressed associated memory pages are individually decompressed in response to the particular page being required for use during processing. 1. A computer implemented method of managing memory operations , the method comprising:responsive to a request for a first memory page, reading the first memory page from a storage device;storing the first memory page to a system memory;identifying one or more associated memory pages that are related to the first memory page by a set of pre-established association rules;reading each of the one or more associated memory pages from the storage device;compressing each of the one or more associated memory pages to generate a corresponding compressed associated memory page; andstoring the compressed associated memory page to the system memory to enable faster access to the associated memory pages during processing of the first memory page.2. The method of claim 1 , further comprising:determining if the first memory page has been removed from the system memory; andresponsive to the first memory page being removed from the system memory, removing the one or more compressed associated memory pages from the system memory.3. The method of claim 1 , further comprising:determining at least one page association for the first memory page based on a pre-established set of association ...

Improved adaptive reference scheme for magnetic memory aplications

A circuit and method for adaptive trimming of the reference signal for sensing data during a read operation of magnetic memory cells to improve read margin for the magnetic memory cells. The circuit has a trim one-time programmable memory array programmed with offset trim data applied to magnetic memory array sense amplifiers. Sense amplifier trimming circuits receive and decode the trim data to determine offset trim signal magnitude to adjust the reference signal to improve the read margin. The method sets the offset trim level to each increment of the offset trim level. Data is written and read to the magnetic memory array, the number of errors in the array is accumulated for each setting of the offset trim level. The error levels are compared and the appropriate trim level is programmed to the trim memory cells such that a read margin of the sense amplifier is improved.

Adaptive reference scheme for magnetic memory

A circuit and method for adaptive trimming of the reference signal for sensing data during a read operation of magnetic memory cells to improve read margin for the magnetic memory cells. The circuit has a trim one-time programmable memory array programmed with offset trim data applied to magnetic memory array sense amplifiers. Sense amplifier trimming circuits receive and decode the trim data to determine offset trim signal magnitude to adjust the reference signal to improve the read margin. The method sets the offset trim level to each increment of the offset trim level. Data is written and read to the magnetic memory array, the number of errors in the array is accumulated for each setting of the offset trim level. The error levels are compared and the appropriate trim level is programmed to the trim memory cells such that a read margin of the sense amplifier is improved.

Gated recording of holograms using rare-earth doped ferroelectric materials

Rare earth doped ferroelectric materials are disclosed as reversible holographic recording medium (25) for use in two-photon recording systems. Such rare earth elements provide long-lived electronic states intermediate the ferroelectric material's valence and conduction bands. In some cases, these rare earth intermediate states have a sufficiently long life that low-power continuous wave ('cw') lasers (1) can be used to record interference patterns on them. Thus, two-photon holographic recording systems are also disclosed which do not require high-power, short pulse length, mode-locked or Q-switched lasers. Rather, the disclosed holographic recording systems employ cw lasers such as diode lasers. The rare earth dopants include praseodymium, neodymium, dysprosium, holmium, erbium, and thulium. These dopants provide ions having 4f excited states that give rise to absorptions in the near infra-red and visible spectral regions and typically have lifetimes on the order of 0.1 to 1 milliseconds. The disclosed two-photon holographic recording systems provide for absorption of a first photon which excites electrons of a holographic recording medium to a rare-earth intermediate state. Thereafter, upon absorption of a second photon, the electrons are promoted to the medium's conduction band where they are arranged according to the interference pattern provided by the recording system.