Patents by Inventor Tobin Jon Lehman
Tobin Jon Lehman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8606844Abstract: The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).Type: GrantFiled: August 14, 2008Date of Patent: December 10, 2013Assignee: International Business Machines CorporationInventors: James H. Kaufman, Tobin Jon Lehman
-
Patent number: 8498961Abstract: The system and method of the present invention provide for automatic on-demand replication in a replication cluster of content management servers. A replication manager of a content management server receives newly created, modified, and deleted application item types along with their associated physical tables and automatically forwards the received application item types on-demand to the replication managers of other content management servers of the replication cluster.Type: GrantFiled: July 13, 2006Date of Patent: July 30, 2013Assignee: International Business Machines CorporationInventors: Stefan Bengt Edlund, Tobin Jon Lehman, Joann Ruvolo
-
Patent number: 8057307Abstract: The disclosed massive multi-player on-line gaming environment and method eliminate the coordination and synchronization problems between servers by assigning each game user to a specific client proxy server for game duration and utilizing a space information distribution center to indicate client specific changes in game space. Such configuration eliminates the need to use “grey” areas around partitioning boundaries and servers having to “own” client objects thereby improving massive multi-player on-line gaming scalability.Type: GrantFiled: March 24, 2005Date of Patent: November 15, 2011Assignee: International Business Machines CorporationInventors: Viktors Berstis, John Daniel Sieron Bethencourt, Kevin Blake Damm, Robert Glenn Deen, Matthew Arthur Hammer, James H. Kaufman, Tobin Jon Lehman
-
Patent number: 7957363Abstract: A message pathway selection system dynamically selects an optimum message pathway for transmitting messages. The system dynamically optimizes a message pathway according to various criteria such as, for example, efficiency, economy, data requirements, auditing requirements, security, data size, etc. The system can direct a message to bypass an infrastructure messaging server, using a direct message pathway. The system can also switch from an infrastructure messaging server to a direct method. The system can also utilize an infrastructure messaging pathway either as an alternative or in parallel with the direct message pathway. The system allows an application to use a single communication system for both a direct mode and an infrastructure mode of data transfer. The present system can bypass the infrastructure message pathway, thus reducing message latency, number of messages sent, and improving overall bandwidth.Type: GrantFiled: May 26, 2005Date of Patent: June 7, 2011Assignee: International Business Machines CorporationInventors: Robert Glenn Deen, James Harvey Kaufman, Tobin Jon Lehman
-
Publication number: 20110087616Abstract: A method for displaying portfolio risk is described. The method includes receiving a time series corresponding to a weight and a desirability of each of an asset in a portfolio. The method further includes maintaining the time series corresponding to the weight and the desirability of each of the assets in the portfolio. The method also includes maintaining a standard time series for comparison with the time series corresponding to the weight and the desirability of each of the assets in the portfolio. The method further includes displaying, for each asset in the portfolio, a quantity based on desirability versus a quantity based on the correlation between desirability and the standard time series over two specified windows of time. The method also includes displaying trend information based on moving two specified windows of time from the past to the point where at least one window is the most current window.Type: ApplicationFiled: October 9, 2009Publication date: April 14, 2011Applicant: International Business Machines CorporationInventors: Hovey Raymond Strong, JR., Sekou Remy, Tobin Jon Lehman
-
Patent number: 7590984Abstract: A distributed parallel computing system actively takes advantage of problem partitioning to balance the computing load among computing resources continually during processing. Variable problem partitions (VPPs) are initially defined as groups of original problem cells (OPCs). VPPs may be redefined and redistributed during execution, if necessary, to optimize performance based on the actual computing agent parameters and costs observed or reported through self-tests. For example, a good rule for efficient execution of a computing problem may be that the time required to perform a computation sequence (iteration) of all OPCs in a VPP should be comparable to the time required to share results via edge OPCs at the VPP collection perimeters. The rules that yield cost-efficient execution may be saved and re-used to generate initial partitionings for subsequent computing problem execution runs.Type: GrantFiled: May 29, 2003Date of Patent: September 15, 2009Assignee: International Business Machines CorporationInventors: James H. Kaufman, Tobin Jon Lehman
-
Patent number: 7467180Abstract: A method is described for automatically segmenting and populating a distributed problem, including determining a bounding space that is at least equal in size to a problem space volume, partitioning the bounding space into a plurality of sub-spaces capable of holding collections of original problem cells, mapping the distributed problem into the partitioned bounding space to populate the sub-spaces with data from the problem, and determining boundaries between the sub-spaces.Type: GrantFiled: May 29, 2003Date of Patent: December 16, 2008Assignee: International Business Machines CorporationInventors: James H. Kaufman, Tobin Jon Lehman
-
Publication number: 20080301405Abstract: The initial partitioning of a distributed computing problem can be critical, and is often a source of tedium for the user. A method is provided that automatically segments the problem into fixed sized collections of original program cells (OPCs) based on the complexity of the problem specified, and the combination of computing agents of various caliber available for the overall job. The OPCs that are on the edge of a collection can communicate with OPCs on the edges of neighboring collections, and are indexed separately from OPCs that are within the ‘core’ or inner non-edge portion of a collection. Consequently, core OPCs can iterate independently of whether any communication occurs between collections and groups of collections (VPPs). All OPCs on an edge have common dependencies on remote information (i.e., their neighbors are all on the same edge of a neighboring collection).Type: ApplicationFiled: August 14, 2008Publication date: December 4, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: James H. Kaufman, Tobin Jon Lehman
-
Publication number: 20080016129Abstract: The system and method of the present invention provide for automatic on-demand replication in a replication cluster of content management servers. A replication manager of a content management server receives newly created, modified, and deleted application item types along with their associated physical tables and automatically forwards the received application item types on-demand to the replication managers of other content management servers of the replication cluster.Type: ApplicationFiled: July 13, 2006Publication date: January 17, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: STEFAN BENGT EDLUND, TOBIN JON LEHMAN, JOANN RUVOLO
-
Publication number: 20040244006Abstract: A distributed parallel computing system actively takes advantage of problem partitioning to balance the computing load among computing resources continually during processing. Variable problem partitions (VPPs) are initially defined as groups of original problem cells (OPCs). VPPs may be redefined and redistributed during execution, if necessary, to optimize performance based on the actual computing agent parameters and costs observed or reported through self-tests. For example, a good rule for efficient execution of a computing problem may be that the time required to perform a computation sequence (iteration) of all OPCs in a VPP should be comparable to the time required to share results via edge OPCs at the VPP collection perimeters. The rules that yield cost-efficient execution may be saved and re-used to generate initial partitionings for subsequent computing problem execution runs.Type: ApplicationFiled: May 29, 2003Publication date: December 2, 2004Applicant: International Business Machines CorporationInventors: James H. Kaufman, Tobin Jon Lehman
-
Patent number: 6480830Abstract: An “active” calendar automatically analyzes a user's calendar entries and sends machine-readable messages to destinations appropriate to content of the calendar entry. A group of event categories is established, each category specifying one class of anticipated calendar entry. An action rule database pre-associates each event category with one or more message formats each having a content and a destination. The action rule database also contains data identifying sources containing the content and destination for each message format. These sources include records of the action rule database itself, subparts of calendar entries of the pre-associated event category, one or more other databases, or a combination of the foregoing. After the calendar receives a user-submitted computer calendar entry describing a planned event, it identifies one of the event categories of the established group that classifies the planned event.Type: GrantFiled: March 27, 1998Date of Patent: November 12, 2002Assignee: International Business Machines CorporationInventors: Daniel Alexander Ford, Tobin Jon Lehman, Qi Lu, Udi Manber, Ron Yair Pinter
-
Patent number: 6182085Abstract: A distributed collection of web-crawlers to gather information over a large portion of the cyberspace. These crawlers share the overall crawling through a cyberspace partition scheme. They also collaborate with each other through load balancing to maximally utilize the computing resources of each of the crawlers. The invention takes advantage of the hierarchical nature of the cyberspace namespace and uses the syntactic components of the URL structure as the main vehicle for dividing and assigning crawling workload to individual crawler. The partition scheme is completely distributed in which each crawler makes the partitioning decision based on its own crawling status and a globally replicated partition tree data structure.Type: GrantFiled: May 28, 1998Date of Patent: January 30, 2001Assignee: International Business Machines CorporationInventors: Matthias Eichstaedt, Daniel Alexander Ford, Tobin Jon Lehman, Qi Lu, Shang-Hua Teng
-
Patent number: 6032160Abstract: A relational data base management system that stores and retrieves large data objects (LOBs) from data base storage includes a data manager that maintains LOB data space allocation according to the buddy system with two types of allocation pages, called regular buddy space (RBS) pages and super buddy space (SBS) pages. The RBS pages control buddy spaces comprising equal-size areas of the LOB data space in which LOB buddy segments are stored. The SBS pages control the RBS pages. The RBS pages include a pointer array that contains the forward-most location of where searching for a free storage space should begin and a counter array that indicates the number of free buddy segments in a buddy space for a particular buddy segment size. The SBS pages include analogous pointer and counter arrays that refer to the RBS pages and indicate the location and extent of free storage space, and also include a divided-space array and an SBS page directory.Type: GrantFiled: June 5, 1997Date of Patent: February 29, 2000Assignee: International Business Machines CorporationInventor: Tobin Jon Lehman
-
Patent number: 5974420Abstract: A method, apparatus, and article of manufacture for exchanging information in a computer-implemented database system. The present invention implements this exchange using a new operator known as a Rhonda operator. A Rhonda operator includes a tuple and template as arguments and, when performed, atomically swaps its tuple with a tuple from another Rhonda operator when both their templates match. More specifically, if two processes perform Rhonda operations, and each process' template argument matches the other process' tuple argument, then each process receives the other process' tuple as a result. This atomic synchronization can be performed for two or more Rhonda operators at a time.Type: GrantFiled: January 27, 1998Date of Patent: October 26, 1999Assignee: International Business Machines CorporationInventors: Tobin Jon Lehman, Stephen McLaughry
-
Patent number: 5963947Abstract: A method, apparatus, and article of manufacture for dynamically adding functionality to a server. A first operator is received at the server from an attached client, wherein the first operator indicates that new functionality is to be added to the server. A first handler is located for the first operator. The first handler is executed in the server, wherein the first handler registers a second operator associated with the new functionality and installs a second handler for the second operator to perform the new functionality.Type: GrantFiled: January 27, 1998Date of Patent: October 5, 1999Assignee: International Business Machines CorporationInventors: Daniel Alexander Ford, Tobin Jon Lehman
-
Patent number: 5732402Abstract: A relational data base management system that stores and retrieves large data objects (LOBs) from data base storage includes a data manager that maintains LOB data space allocation according to the buddy system with two types of allocation pages, called regular buddy space (RBS) pages and super buddy space (SBS) pages. The RBS pages control buddy spaces comprising equal-size areas of the LOB data space in which LOB buddy segments are stored. The SBS pages control the RBS pages. The RBS pages include a pointer array that contains the forward-most location of where searching for a free storage space should begin and a counter array that indicates the number of free buddy segments in a buddy space for a particular buddy segment size. The SBS pages include analogous pointer and counter arrays that refer to the RBS pages and indicate the location and extent of free storage space, and also include a divided-space array and an SBS page directory.Type: GrantFiled: February 10, 1995Date of Patent: March 24, 1998Assignee: International Business Machines CorporationInventor: Tobin Jon Lehman