Patents Represented by Attorney, Agent or Law Firm William A. Kinnaman, Jr., Esq.
-
Patent number: 6351843Abstract: A technique is presented for dynamically inserting a function into an existing application executable of an object-oriented system at runtime of the executable and without requiring recompiling of the code. This is accomplished by modifying configuration settings of the executable at runtime to add a setting to specify the function for at least one class of the executable. The modified configuration settings are then used when running the executable and when a class is encountered for which the function is active, a redirection stub is dynamically inserted to implement the function for the methods of that class. In one embodiment, the function is a trace function and the redirection stub implements an entry trace and an exit trace about each target method of a class for which the trace function is active. Various CORBA implementations of the technique are possible.Type: GrantFiled: August 31, 1998Date of Patent: February 26, 2002Assignee: International Business Machines CorporationInventors: Donald J. Berkley, Frank J. De Gilio, Mark I. Dinges, Kevin R. Evans, Theodore R. Maeurer
-
Patent number: 6345280Abstract: Managing a log stream of a computer system. An entry of a log stream, desired to be removed from the log stream, but not eligible for removal, is logically deleted. Logical deletion keeps the entry on the log stream and indicates that the entry can be removed from the log stream when it is eligible. When the entry is eligible, it is removed. If a desired entry remains at the tail of the log stream for a given period of time, thus not all owing the removal of one or more undesired entries, the desired entry is rewritten to the head of the log stream and deleted from the tail. Thereafter, other logically deleted entries eligible for deletion are removed from the log stream.Type: GrantFiled: April 23, 1999Date of Patent: February 5, 2002Assignee: International Business Machines CorporationInventors: Carl Edward Clark, Steven Jay Greenspan, Hiren Ramlal Shah
-
Patent number: 6345312Abstract: A technique for selectively dummying a data pipe transparent to a writer application is provided. A writer application writes data to a local data pipe or a cross-system data pipe and one or more reader applications read data from the data pipe. The technique involves determining when a last reader application of the at least one or more reader applications closes the data pipe before the writer application has completed writing data to the data pipe. Upon determining this condition, further writing of data to the data pipe by the writer application is transparently prevented. While transparently preventing writing to a dummied data pipe, writing of data to a fitting, e.g., for a permanent record, can proceed.Type: GrantFiled: August 28, 1997Date of Patent: February 5, 2002Assignee: International Business Machines CorporationInventors: Roman Anthony Bobak, Scott Brady Compton, Jon Kim Johnson, David Lee Meck, William Robert Richardson
-
Patent number: 6317744Abstract: Fully-associative non-linear collections of items are browsed. At least a portion of a fully-associative non-linear collection of items is segmented into a plurality of segments. This segmenting is transparent to any browsers of the fully-associative non-linear collection of items. The plurality of segments is then browsed by multiple browsers.Type: GrantFiled: August 23, 1999Date of Patent: November 13, 2001Assignee: International Business Machines CorporationInventors: David A. Elko, Jeffrey M. Nick, David H. Surman, Wendell W. Wilkinson
-
Patent number: 6289432Abstract: Segments of storage of a computer system are shared among any number of users at varying virtual addresses. The virtual addresses can be in the same address space or different address spaces. The sharing of a segment of storage is provided by storing the real address of a page table corresponding to the segment of storage to be shared at different virtual addresses. This allows users of the same or different address spaces to share the same segment of storage by referencing the same page table.Type: GrantFiled: March 25, 1998Date of Patent: September 11, 2001Assignee: International Business Machines CorporationInventors: Donald Fred Ault, Harris M. Morgenstern, Danny Ray Sutherland
-
Patent number: 6282560Abstract: Managing processor resources in a non-dedicated computer system. An amount of a processor resource is allocated to a real-time application of the computer system. The amount does not exceed a limit chosen for a group of real-time applications, wherein the group includes the real-time application being allocated the resource. A selected amount of the processor resource remains available to execute other types of applications and work on the system. During processing of the real-time application, use of the processor resource does not exceed a chosen maximum value, thereby ensuring the processor resource is not monopolized by the real-time application and allowing other types of work to be processed on the system.Type: GrantFiled: March 28, 1997Date of Patent: August 28, 2001Assignee: International Business Machines CorporationInventors: Catherine Krueger Eilert, Peter Bergersen Yocom
-
Patent number: 6233644Abstract: A lock structure, which includes many entries, is partitioned into segments. A number of the segments are cleaned up in parallel, such that cleanup processing of the entire lock structure is optimized. The lock structure is maintained within a coupling facility, which provides access to the lock structure by one or more processors coupled to the coupling facility. The cleaning up of the lock structure is performed by commands driven by the one or more processors and executed within the coupling facility.Type: GrantFiled: June 5, 1998Date of Patent: May 15, 2001Assignee: International Business Machines CorporationInventors: Dennis J. Dahlen, Jeffrey Mark Nick, David Harold Surman, Douglas W. Westcott
-
Patent number: 6230243Abstract: Changed data of castout classes of a coupling facility cache are managed in order to be able to efficiently determine the age of the oldest changed data in the cache. A directory entry representing a changed datum is placed in a data structure corresponding to the castout class of the changed datum. The data structure includes an order queue ordered by timestamps and a process queue, having an ordered portion and an unordered portion. When the directory entry is to be added to the data structure, an attempt is first made to place the entry on the order queue. If the entry is not placed on the order queue within a predefined amount of time, then the entry is placed on the process queue, the order of which is maintained by background tasks. In order to return the oldest entry of the data structure, the smallest entry of the process queue is determined and that entry is then compared to the smallest entry of the order queue. The smaller of those two entries corresponds to the oldest entry for the castout class.Type: GrantFiled: February 19, 1999Date of Patent: May 8, 2001Assignee: International Business Machines CorporationInventors: David Arlen Elko, Jeffrey W. Josten, Jeffrey M. Nick, David H. Surman, Wendell W. Wilkinson
-
Patent number: 6185562Abstract: A lock structure, which includes many entries, is partitioned into segments. A number of the segments are cleaned up in parallel, such that cleanup processing of the entire lock structure is optimized. The lock structure is maintained within a coupling facility, which provides access to the lock structure by one or more processors coupled to the coupling facility. The cleaning up of the lock structure is performed by commands driven by the one or more processors and executed within the coupling facility.Type: GrantFiled: June 5, 1998Date of Patent: February 6, 2001Assignee: International Business Machines CorporationInventors: Dennis J. Dahlen, Jeffrey Mark Nick, David Harold Surman, Douglas W. Westcott
-
Patent number: 6178421Abstract: A lock structure, which includes many entries, is partitioned into segments. A number of the segments are cleaned up in parallel, such that cleanup processing of the entire lock structure is optimized. The lock structure is maintained within a coupling facility, which provides access to the lock structure by one or more processors coupled to the coupling facility. The cleaning up of the lock structure is performed by commands driven by the one or more processors and executed within the coupling facility.Type: GrantFiled: June 5, 1998Date of Patent: January 23, 2001Assignee: International Business Machines CorporationInventors: Dennis J. Dahlen, Jeffrey Mark Nick, David Harold Surman, Douglas W. Westcott
-
Patent number: 6170045Abstract: Data is written to and read from a shared pipe by applications of multiple systems. At least one shared pipe is located within an external shared memory coupled to one or more central processing complexes. Each of the central processing complexes has one or more operating system images, which controls execution of one or more piping applications. At least one piping application corresponding to at least one operating system image writes data to a shared pipe located in the external shared memory and at least one other application corresponding to one or more other operating system images reads data from the same shared pipe, thereby providing cross-system data piping.Type: GrantFiled: April 30, 1997Date of Patent: January 2, 2001Assignee: International Business Machines CorporationInventors: Roman A. Bobak, Scott Brady Compton, Jon K. Johnson, Alan F. Martens, Max M. Maurer, David Lee Meck, William R. Richardson, Michael Allen Wright