| Patent application number | Description | Published |
|---|
| 20080235668 | OPERATING SYSTEM SUPPORT FOR THREAD-LEVEL BREAKPOINTS - A computer implemented method, apparatus, and computer usable program code for processing breakpoints. A breakpoint is detected during execution of a process. A thread that is currently executing is identified as an identified thread. A determination is made as to whether the breakpoint is applicable to the identified thread. In response to the determination that the breakpoint is applicable to the identified thread, the execution of the process is halted. Execution of the process continues without halting execution of the process if the breakpoint is inapplicable to the identified thread. | 09-25-2008 |
| 20090024706 | GRANULARLY SELECTING A SUBSET OF RECIPIENTS WHO CAN REPLY TO A SENDER'S E-MAIL - A method, system, and computer program product for assigning reply status to an outgoing electronic mail (e-mail) message. While creating an e-mail message, an interface is provided for granularly assigning or denying reply privileges to recipients of an outgoing e-mail message. Reply status is assigned by selecting a subset of recipients by name, e-mail address, and/or e-mail group who may reply to the e-mail. As the recipient's reply status is modified, the outgoing e-mail is updated, revising the reply e-mail address for each recipient. When the recipient is granted reply status, the e-mail address of the original sender is provided as the reply e-mail address. However, in the event the recipient is not granted reply status, the e-mail address of an automated, unmanned e-mail account is provided as the reply e-mail address. | 01-22-2009 |
| 20090037703 | CONDITIONAL DATA WATCHPOINT MANAGEMENT - A method, system and computer program product for managing a conditional data watchpoint in a set of instructions being traced is shown in accordance with illustrative embodiments. In one particular embodiment, the method comprises initializing a conditional data watchpoint and determining the watchpoint has been encountered. Upon that determination, examining a current instruction context associated with the encountered watchpoint prior to completion of the current instruction execution, further determining a first action responsive to a positive context examination; otherwise, determining a second action. | 02-05-2009 |
| 20090276756 | Method To Apply Persistence To Selected Attributes Of Static And Dynamic Operating System Components - A process for managing customizations for components in a component tree includes for each customization associated with the parent of a component, matching the pathname of the component with the customization path. The process further includes associating the customization with the component, if the matching results in a partial match. The process further includes applying the customization to the component, if the matching results in a complete match. | 11-05-2009 |
| 20090313610 | Advisory warning and workaround indications to user when stopped between load and store conditional instructions while using source level debuggers - A load store advisory program sets a breakpoint within a portion of a program, determines if the breakpoint will cause unexpected behavior, and generates a warning if it is determined that the breakpoint will cause unexpected behavior. The unexpected behavior may be the result of setting a breakpoint within a load-store sequence that, because of the breakpoint, will repeatedly fail. | 12-17-2009 |
| 20100174946 | Method for Debugging a Hang Condition in a Process Without Affecting the Process State - Embodiments of the invention are associated with an application process that comprises multiple threads, wherein threads of the process are disposes to run on a data processing system, and each thread can have a user mode or a kernel mode machine state, or both, selectively, when it is running. An embodiment directed to a method comprises the steps of allocating a specified memory location for each of the threads, and responsive to a given thread entering a sleep state, selectively saving the kernel mode machine state of the given thread in the specified memory location for the given thread. The saved machine state comprises the state of the given thread immediately prior to the given thread entering the sleep state. In response to detecting a hang condition in the operation of the process, a debugger is attached to the process to access at least one of the saved user mode machine states. The method further includes analyzing information provided by the at least one accessed machine state to determine the cause of the hang condition, and restoring the original state upon detachment, so the debugger attachment is completely transparent to the target process. | 07-08-2010 |
| 20100251239 | Component Lock Tracing - Methods, systems, and products for lock tracing at a component level. The method includes associating one or more locks with a component of the operating system; initiating lock tracing for the component; and instrumenting the component-associated locks with lock tracing program instructions in response to initiating lock tracing. The locks are selected from a group of locks configured for use by an operating system and individually comprise locking code. The component lock tracing may be static or dynamic. | 09-30-2010 |
| 20100287279 | Ensuring Affinity at All Affinity Domains by Folding at Each Affinity Level Possible for a Partition Spanning Multiple Nodes - The different illustrative embodiments provide a method, apparatus, and computer program product for folding at each affinity level for a partition spanning multiple nodes. In one illustrative embodiment, a method is provided for identifying a number of domains in a number of affinity levels. A lightest loaded domain is identified in the number of domains identified. A number of nodes are identified in the lightest loaded domain identified. A lightest loaded node is identified in the number of nodes. A lightest loaded processing unit on the lightest loaded node is identified and the lightest loaded processing unit is folded. | 11-11-2010 |
| 20100333087 | Allocation and Regulation of CPU Entitlement for Virtual Processors in Logical Partitioned Platform - A system, method, and computer program product for managing processor entitlement of virtual processors in logical partitioned data processing system. One embodiment of the invention provides a method of managing processing resources in a data processing system. The method involves creating a resource set comprising a grouping of virtual processors, and allocating a processing resource entitlement the resource set. The method also includes assigning the resource set to a workload, receiving a request by the workload for utilization of processing resources, and in response to receiving the workload request dispatching the assigned resource set. The method further includes determining whether the dispatched virtual processors of the resource set have exceeded the assigned processing resource entitlement, and in response to determining that the processing resource entitlement has been exceeded, undispatching the resource set. | 12-30-2010 |
| 20110022803 | Two Partition Accelerator and Application of Tiered Flash to Cache Hierarchy in Partition Acceleration - An approach is provided to identify a disabled processing core and an active processing core from a set of processing cores included in a processing node. Each of the processing cores is assigned a cache memory. The approach extends a memory map of the cache memory assigned to the active processing core to include the cache memory assigned to the disabled processing core. A first amount of data that is used by a first process is stored by the active processing core to the cache memory assigned to the active processing core. A second amount of data is stored by the active processing core to the cache memory assigned to the inactive processing core using the extended memory map. | 01-27-2011 |
| 20110022895 | Software Component Self-Scrubbing - Software components “self-scrub” to improve software reliability, serviceability and availability (RAS). Each component designates a routine to perform a component level consistency check on major data structures and to verify the state of component. This is performed as an on-going task during the life of the component. The component registers an entry point with the system to receive notification of scrubbing parameter changes. The entry point is also called with the request to perform component-scrubbing operations. The entry point functions are responsible for executing within limitations on central processing unit (CPU) usage and memory footprint when performing scrubbing operations. | 01-27-2011 |
| 20110072418 | TRACING MEMORY UPDATE FOR DEBUGGING COMPUTER PROGRAM - A system, method, and computer program product for expediting the identification of computer program code that is the source of errors in the execution of a computer program. A debugger monitors a specified memory address, or group of addresses for updates, during execution of the computer program. In response to determining that a running computer program has updated the memory address, the processor executes a watchpoint handler to identify the source of errors in a computer program executing in a data processing system. The watchpoint handler gathers trace information associated with the faulty processing thread, and records the trace information to a memory location. The watchpoint handler may also apply filters to the trace information to identify the source of the error, saving valuable debugging time. | 03-24-2011 |
| 20110153949 | DELAYED REPLACEMENT OF CACHE ENTRIES - A cache entry replacement unit can delay replacement of more valuable entries by replacing less valuable entries. When a miss occurs, the cache entry replacement unit can determine a cache entry for replacement (“a replacement entry”) based on a generic replacement technique. If the replacement entry is an entry that should be protected from replacement (e.g., a large page entry), the cache entry replacement unit can determine a second replacement entry. The cache entry replacement unit can “skip” the first replacement entry by replacing the second replacement entry with a new entry, if the second replacement entry is an entry that should not be protected (e.g., a small page entry). The first replacement entry can be skipped a predefined number of times before the first replacement entry is replaced with a new entry. | 06-23-2011 |
