Abstract: A method for processing information from a variety of submitters, e.g., forensic sources. The method includes receiving information about one or more nodes from a submitter from a plurality of submitters numbered from 1 through N. In a specific embodiment, the one or more nodes are associated respectively with one or more IP addresses on a world-wide network of computers. The method includes identifying a submitter reputation of the submitter from a knowledge base and associating a node reputation of the node based upon at least the reputation of the submitter and submitted information from the submitter. The method also transfers the node reputation.

Abstract: A method for querying a knowledge base of malicious hosts numbered from 1 through N. The method includes providing a network of computers, which has a plurality of unknown malicious host machines. In a specific embodiment, the malicious host machines are disposed throughout the network of computers, which includes a worldwide network of computers. The method includes querying a knowledge base including a plurality of known malicious hosts, which are numbered from 1 through N, where N is an integer greater than 1. In a preferred embodiment, the knowledge base is coupled to the network of computers. The method includes receiving first information associated with an unknown host from the network; identifying an unknown host and querying the knowledge base to determine if the unknown host is one of the known malicious hosts in the knowledge base, and outputting second information associated with the unknown host based upon the querying process.

Abstract: A computer implemented method, apparatus, and computer program product for managing garbage collection. Monitoring is performed for a garbage collection state in a virtual machine. Responsive to detecting the garbage collection state, a priority for a set of garbage collection threads is increased.

Abstract: A computer implemented method, apparatus, and computer usable program code for sampling call stack information. Monitoring for an event is performed during an execution of a plurality of threads by a set of processors. A portion of the plurality of threads is identified based on a policy to form a set of identified threads in response to an occurrence of the event. Call stack information is collected for the set of identified threads using an under utilized processor in a set of processors in response to identifying the portion of the plurality of threads, wherein the call stack information is used to profile a processor in the set of processors.

Abstract: A computer implemented method, apparatus, and computer program product for processing events. Events occurring during execution of an application are monitored to form monitored events. A plurality of sequences of method types and transition types from the monitored events are identified to form an identified plurality of sequences of method types and transitions types. Overhead compensation values are identified for the identified plurality of sequences of method types and transitions types to form identified overhead compensation values. Observed metrics for the monitored events are adjusted using the identified overhead compensation values.

Abstract: A computer implemented method for sampling call stack information. Responsive to identifying a set of interrupts, a determination is made as to whether all processors in a plurality of processors have generated the set of interrupts. A number of addresses are identified for a set of interrupted threads identified by the set of interrupts response to a determination that all of the processors have generated the set of interrupts. A determination is made as to whether the identified address falls within a set of address ranges. Responsive to a determination that the identified address falls within the set of address ranges, a sampler thread is notified to obtain call stack information.

Abstract: A computer implemented method, apparatus, and computer usable program code for sampling call stack information. An accumulated latency time is monitored for a set of threads executing in a data processing system. The call stack information is obtained for the thread in response to a thread in the set of threads having an associated accumulated latency exceeding a threshold.

Abstract: A computer implemented method, apparatus, and computer program code for profiling an application. Execution of an application is monitored. A set of metrics relating to execution of the application occurring during monitoring execution of the application are collected to form a set of observed metrics. An execution environment overhead occurring with respect to the set of observed events is identified to form an identified execution environment overhead. The set of observed metrics is adjusted using the identified execution environment overhead to form a set of calibrated metrics.

Abstract: Methods, systems, and products are provided that display memory statistics for a keydrive that do not require the keydrive to be plugged into another device. Displaying memory statistics according to embodiments of the present invention include receiving a command resulting in a change to the memory usage of the keydrive, calculating memory statistics describing the current state of memory usage of the keydrive, storing the memory statistics in memory on the keydrive, and displaying the memory statistics on a display on the keydrive. Calculating memory statistics describing the current state of memory usage of the keydrive may be carried out by calculating a total memory usage of the keydrive. Calculating memory statistics describing the current state of memory usage of the keydrive may also be carried out by calculating a percent of total memory used.

Abstract: A text modification mechanism is provided for formatting data such that the information can be reasonably deciphered by a human, but cannot be easily recognized by computer recognition techniques. The text modification mechanism alters printed text so that computer recognition of characters becomes difficult. Modification of the text may be accomplished with manipulation of the fonts or the background. The mechanism may also modify the text based on user preferences.

Abstract: Methods, systems, and products are provided that display memory statistics for a keydrive that do not require the keydrive to be plugged into another device. Displaying memory statistics according to embodiments of the present invention include receiving a command resulting in a change to the memory usage of the keydrive, calculating memory statistics describing the current state of memory usage of the keydrive, storing the memory statistics in memory on the keydrive, and displaying the memory statistics on a display on the keydrive. Calculating memory statistics describing the current state of memory usage of the keydrive may be carried out by calculating a total memory usage of the keydrive. Calculating memory statistics describing the current state of memory usage of the keydrive may also be carried out by calculating a percent of total memory used.

Abstract: The present invention provides a method and apparatus in a data processing system for printing characters. Data received includes glyphs for output on an output device, wherein the glyphs are to be output using a selected device font. Monitoring for unsupported glyphs in the selected device font is performed. In response to detecting a glyph unsupported by the selected device font, a back up system font is used to output the glyph to the output device.

Abstract: The present invention provides a method and apparatus in a data processing system for printing characters. Data received includes glyphs for output on an output device, wherein the glyphs are to be output using a selected device font. Monitoring for unsupported glyphs in the selected device font is performed. In response to detecting a glyph unsupported by the selected device font, a back up system font is used to output the glyph to the output device.

Abstract: This invention describes how to avoid data loss due to limited buffer size during continuous tracing of high frequency events such as branches. Buffer data loss is adaptively avoided by either temporarily patching an instruction with a jump to itself or by using delay loops with an adaptive number of iterations during exception handling in which the trace event is written to the buffer.

Abstract: A system and method for collecting a plurality of metrics during a single run of a computer program. The mechanism of the present invention initializes a plurality of counters to count events associated with metrics of interest. The mechanism of the present invention then counts the occurrence of events associated with metrics of interest during a single execution of a computer program. When a branch has been taken, a trace record is generated for the branch taken, wherein the generated trace record contains a count of events associated with the metrics of interest for the branch taken.

Abstract: A computer implemented method for sampling call stack information. Responsive to identifying a set of interrupts, a determination is made as to whether all processors in a plurality of processors have generated the set of interrupts. A number of addresses are identified for a set of interrupted threads identified by the set of interrupts response to a determination that all of the processors have generated the set of interrupts. A determination is made as to whether the identified address falls within a set of address ranges. Responsive to a determination that the identified address falls within the set of address ranges, a sampler thread is notified to obtain call stack information.

Abstract: A computer implemented method, apparatus, and computer program product for managing garbage collection. Monitoring is performed for a garbage collection state in a virtual machine. Responsive to detecting the garbage collection state, a priority for a set of garbage collection threads is increased.

Abstract: A system and method for collecting a plurality of metrics during a single run of a computer program. The mechanism of the present invention initializes a plurality of counters to count events associated with metrics of interest. The mechanism of the present invention then counts the occurrence of events associated with metrics of interest during a single execution of a computer program. Responsive to a determination that a counter in a plurality of counters has generated an interrupt, the interrupt is rerouted to an interrupt handler, wherein the interrupt handler generates trace records comprising trace information corresponding to the interrupt. The mechanism of the present invention then generates profiles for the trace records, wherein the profiles differentiate the trace records based on the metric type associated with each trace record.

Abstract: A technique for storing or backing up data to a removable media such as a CD or DVD with an enhanced probability that such data can be successfully read or recovered from such media subsequent to the writing/storing/backing-up of the data. This enhanced probability is achieved by storing the data to be copied to the media in multiple different physical locations of the media, such that a plurality of duplicate copies of the data exists on the media. Because there are multiple copies of the data stored on the media, the probability of being able to successfully read at least one good copy of the data is enhanced. For example, if one of the copies cannot be successfully read due to an unrecoverable error, another of the copies can be used to satisfy the read or restore operation. It is also possible to read all copies of the data in response to a read/restore operation, and any differences in the read data will indicate an error with at least one of the copies.

Abstract: A computer implemented method, apparatus, and computer usable program code for sampling call stack information. An accumulated latency time is monitored for a set of threads executing in a data processing system. The call stack information is obtained for the thread in response to a thread in the set of threads having an associated accumulated latency exceeding a threshold.