Patents by Inventor Hovey Raymond Strong
Hovey Raymond Strong 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: 6424971Abstract: A system, method, and computer program product for interactively classifying and analyzing data is particularly applicable to classification and analysis of textual data. It is particularly useful in identification of helpdesk inquiry and problem categories amenable to automated fulfillment or solution. A dictionary is generated based on a frequency of occurrence of words in a document set. A count of occurrences of each word in the dictionary within each document in the document set is generated. The set of documents is partitioned into a plurality of clusters. A name, a centroid, a cohesion score, and a distinctness score are generated for each cluster and displayed in a table. The documents contained in the clusters sorted based on their similarity to other documents in the cluster.Type: GrantFiled: October 29, 1999Date of Patent: July 23, 2002Assignee: International Business Machines CorporationInventors: Jeffrey Thomas Kreulen, Dharmendra Shantilal Modha, William Scott Spangler, Hovey Raymond Strong, Jr.
-
Patent number: 6401110Abstract: Multiple competing processors cooperatively manage access to a shared resource. Each processor separately stores a lock table, listing shared resource subparts, such as memory addresses of a data storage device, for example. The lock tables are stored in nonvolatile storage. In each lock table, each subpart is associated with a “state,” such as; LOCAL or REMOTE. In response to access requests from the hosts, the processors exchange various messages to cooperatively elect a single processor to have exclusive access to the subparts involved in the access requests. After one processor is elected, the lock-holding processor configures its lock table to show the identified subpart in the LOCAL state, and all non-lock-holding processors configure their lock tables to show the identified subpart in the REMOTE state. Thus, rather than replicating one lock table for all processors, the processors separately maintain lock tables that are coordinated with each other.Type: GrantFiled: November 30, 1998Date of Patent: June 4, 2002Assignee: International Business Machines CorporationInventors: Richard Francis Freitas, Divyesh Jadav, Deepak Kenchammana-Hosekote, Jaishankar Moothedath Menon, Hovey Raymond Strong, Jr.
-
Patent number: 6397215Abstract: A system and method for automatic generation of a comparison list given two different classifications, and automatic sorting of the list in order of similarity. A first dictionary is generated including a subset of words contained in a first document set, the first document set including at least one document and having an associated first classification including at least one class, each class having a class name. A second dictionary is generated including a subset of words contained in a second document set, the second document set including at least one document and having an associated second classification including at least one class, each class having a class name. A common dictionary including words that are common to both the first dictionary and the second dictionary is generated. A count of occurrences of each word in the common dictionary within each document in each document set is generated. A centroid of each class in the space of the common dictionary is generated.Type: GrantFiled: October 29, 1999Date of Patent: May 28, 2002Assignee: International Business Machines CorporationInventors: Jeffrey Thomas Kreulen, William Scott Spangler, Hovey Raymond Strong, Jr.
-
Publication number: 20020052959Abstract: Multiple competing processors cooperatively manage access to a shared resource. Each processor separately stores a lock table, listing shared resource subparts, such as memory addresses of a data storage device, for example. The lock tables are stored in nonvolatile storage. In each lock table, each subpart is associated with a “state,” such as LOCAL or REMOTE. In response to access requests from the hosts, the processors exchange various messages to cooperatively elect a single processor to have exclusive access to the subparts involved in the access requests. After one processor is elected, the lock-holding processor configures its lock table to show the identified subpart in the LOCAL state, and all non-lock-holding processors configure their lock tables to show the identified subpart in the REMOTE state. Thus, rather than replicating one lock table for all processors, the processors separately maintain lock tables that are coordinated with each other.Type: ApplicationFiled: November 30, 1998Publication date: May 2, 2002Inventors: RICHARD FRANCIS FREITAS, DIVYESH JADAV, DEEPAK KENCHAMMANA-HOSEKOTE, JAISHANKAR MOOTHEDATH MENON, HOVEY RAYMOND STRONG
-
Publication number: 20020016845Abstract: In a multiprocessing system, access to a shared resource is arbitrated among multiple computing nodes. The shared resources has a membership view resulting from a predetermined membership protocol performed by the shared resource and the computing nodes. Preferably, this membership protocol includes a termination condition guaranteeing asymmetric safety among all members of the multiprocessing system. The shared resource arbitrates access to itself by fencing computing nodes outside shared resource's membership view. In one embodiment, the shared resource may comprise a data storage facility, such as a disk drive. Illustratively, computation of the shared resource's membership view may employ a procedure where each computing node subscribes to the resource during prescribed membership intervals.Type: ApplicationFiled: November 17, 1997Publication date: February 7, 2002Inventors: JOHN DAVIS PALMER, HOVEY RAYMOND STRONG, ELIEZER UPFAL
-
Patent number: 6105099Abstract: To satisfy host requests, two competing processors self-manage access to a shared resource. Each processor maintains a lock table listing that processor's access state regarding the shared resource. Each processor repeatedly sends the other processor a state announcement message representing the processor's state. These include birth cry, heartbeat, or death knell messages. Whenever certain join-entry conditions apply to a processor, the processor performs a JOIN operation to evaluate and attempt to synchronize its lock table with the other processor's lock table. If data is needed from the other processor's lock table, the processor changes its state announcement message to birth cry. If the processor successfully synchronizes its lock table with the other processor, the JOIN operation dictates DUAL mode for that processor. If the synchronization attempt fails, SOLO results. When JOIN completes, the processor operates in its chosen mode.Type: GrantFiled: November 30, 1998Date of Patent: August 15, 2000Assignee: International Business Machines CorporationInventors: Richard Francis Freitas, Divyesh Jadav, Deepak Kenchammana-Hosekote, Jaishankar Moothedath Menon, Hovey Raymond Strong, Jr.
-
Patent number: 6092220Abstract: Ordered machine-readable messages are reliably delivered among processing members in a multiprocessing computer system. The system includes multiple processing nodes, each having a unique source-ID and a membership view including one or more of the processing nodes with which it can nominally exchange messages. When a stimulus message is received by a first processing node, the node increments a coordinated local counter (CC). The node also sends a multicast message to all processing nodes in the first node's membership group. The multicast message includes the received stimulus message, the incremented CC value, and the first node's source-ID. The node further sets a timer, exclusively associated with the incremented CC value. When a multicast message is received at a processing node, the node performs a multicast input processing routine. The node sets its CC equal to the greater of its current value or the received multicast message's CC value.Type: GrantFiled: November 17, 1997Date of Patent: July 18, 2000Assignee: International Business Machines CorporationInventors: John Davis Palmer, Hovey Raymond Strong, Jr., Eliezer Upfal
-
Patent number: 6038677Abstract: A method and apparatus that automatically generates and maintains resource groups for a clustered computer network configuration. Resource groups are said to be generated "automatically" because the system administrator preferably is not directly involved with defining what resources go within a particular group. Rather, the administrator merely identifies a set of resources that must be collocated with a given application in the event of a failure of a computer on which the application is then executing. One or more resource groups are then automatically generated using a set of collocation "constraints" or rules. A first collocation constraint preferably enforces any user-defined collocations for a given application, and a second constraint collocates disk partition resources residing on the same physical disk. A resource group generated is this manner ensures effective fault-tolerant operation.Type: GrantFiled: March 31, 1997Date of Patent: March 14, 2000Assignee: International Business Machines CorporationInventors: Francis D. Lawlor, James Wendell Arendt, Hovey Raymond Strong
-
Patent number: 6003075Abstract: Configuration changes are dynamically applied to a cluster multiprocessing system by enqueuing a configuration change event. When the configuration change event is processed, the prior configuration is backed up and each software component applies a relevant portion of a configuration change transaction in an ordered, synchronized manner. Each software component applies its portion of the transaction either by reinitialization or a logged transition operation. If the configuration change transaction fails, the software components roll back the portions, of the configuration change already applied in an ordered, synchronized manner to restore the prior configuration. Multiple events for different configuration changes may be enqueued.Type: GrantFiled: July 7, 1997Date of Patent: December 14, 1999Assignee: International Business Machines CorporationInventors: James W. Arendt, Ching-Yun Chao, Michael David Kistler, Frank Daniel Lawlor, Rodolfo Augusto Mancisidor, Jayashree Ramanathan, Hovey Raymond Strong
-
Patent number: 5960429Abstract: A method, apparatus, and article of manufacture for locating web pages from a network server. A count of retrievals of a web page is accumulated and the accumulated count and an address for the web page are stored in a record of a history log database at the network server. A multiple reference hotlist is formatted from the records in the history log database, wherein the multiple reference hotlist comprises a list of addresses for web pages retrieved from the records and the list is sorted by the accumulated counts retrieved from the records. The multiple reference hotlist is then displayed for a user.Type: GrantFiled: October 9, 1997Date of Patent: September 28, 1999Assignee: International Business Machines CorporationInventors: Michael P. Peercy, Benjamin Clay Reed, Edward Robinson, Hovey Raymond Strong, Jr.
-
Patent number: 5923831Abstract: A method is disclosed for coordinating membership subject to an asymmetric safety condition from multiple processes in a distributed system. Each is callable by a distributed application for system status or for executing tasks of the application. Initially, each process sends the other processes its view on their status, where the view includes the names of a group of the processes. It then waits for similar views from other processors except those regarded as failed in its own view, up to a predetermined timeout. Each process then generates a resulting view by intersecting its local view with the names of those processes from which it has received views. The local views are updated based on the resulting views and again exchanged until a termination condition occurs.Type: GrantFiled: September 5, 1997Date of Patent: July 13, 1999Assignee: International Business Machines CorporationInventors: John Davis Palmer, Hovey Raymond Strong, Jr., Eliezer Upfal
-
Patent number: 5784421Abstract: A computer program product, such as a floppy disk with pre-recorded software, is provided. The computer program product is for use with a computer or processing system which is to function as a node within a network. Synchronization of a local time maintained at the node with a reference time is facilitated through execution of the prerecorded software by the node. Bursts of synchronization messages containing reference time stamps are transmitted over the network, or over a communication link, according to a predetermined protocol. The node receives and time stamps the messages. Thus, times according to a first time scale and a second time scale are obtained. The protocol defines temporal relationships between certain ones of the times. In accordance with the protocol, the node determines a difference between a first time according to one of the time scales and a time related to second and third times according to the other time scale. The node then updates its local time based on the difference.Type: GrantFiled: January 24, 1996Date of Patent: July 21, 1998Assignee: International Business Machines CorporationInventors: Danny Dolev, Rudiger Karl Reischuk, Hovey Raymond Strong
-
Patent number: 5689688Abstract: A method is provided for synchronizing local times, maintained at nodes within a network architecture, with a reference time. A node according to the invention can synchronize its local time with the reference time source either actively or in a passive, or eavesdropping, manner. Which of the two manners is to be used preferably depends on whether the node's error exceeds a threshold, and whether the node receives an unsolicited burst of synchronization messages. The active manner is preferably a handshaking scheme, such as probabilistic clock synchronization, in which synchronization is initiated by a request from a node requiring synchronization, and a handshaking exchange of messages between the node and the reference time source establishes a temporal relationship, from which the node produces a synchronized time and a maximum error.Type: GrantFiled: November 16, 1993Date of Patent: November 18, 1997Assignee: International Business Machines CorporationInventors: Hovey Raymond Strong, Edward Leo Wimmers
-
Patent number: 5682470Abstract: A method and apparatus are disclosed for achieving collective consistency in the detection and reporting of failures in a distributed computing system having multiple processors. Each processor is capable of being called by a parallel application for system status. Initially, each processor sends the other processors its view on the status of the processors. It then waits for similar views from other processors except those regarded as failed in its own view. If the received views are identical to the view of the processor, the processor returns its view to the parallel application. In a preferred embodiment, if the views are not identical to its view, the processor sets its view to the union of the received views and its current view. The steps are then repeated. Alternately, the steps are repeated if the processor does not have information that each of the processors not regarded as failed in its view forms an identical union view.Type: GrantFiled: September 1, 1995Date of Patent: October 28, 1997Assignee: International Business Machines CorporationInventors: Cynthia Dwork, Ching-Tien Ho, Hovey Raymond Strong, Jr.