Patents by Inventor Gordon A. Taylor
Gordon A. Taylor 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: 7330958Abstract: A page table mechanism translates virtual addresses to real addresses. In a first aspect, page table entries are contained in equal-sized blocks, the entries within each block corresponding to contiguous pages of virtual address space. Preferably, the common high-order portion of the virtual address is contained in segments distributed among multiple page table entries of the block. In a second aspect, the virtual address indexes a binary tree definitional structure. Decode logic traverses a binary tree defined by the definitional structure by testing selective bits of the virtual address to reach a leaf of the binary tree, which defines the location of data defining the real address.Type: GrantFiled: September 22, 2005Date of Patent: February 12, 2008Assignee: International Business Machines CorporationInventor: Gordon Taylor Davis
-
Patent number: 7325122Abstract: A method, computer program product and system for facilitating inter-digital signal processing (DSP) data communications. A direct memory access (DMA) controller may be configured to facilitate transfers of data between a first and a second DSP processor core coupled to the DMA controller. The DMA controller may read a data structure, referred to as a “buffer descriptor block,” to perform the data transfer. The buffer descriptor block may store both a source address and a destination address indicating where the data is to be retrieved and stored. The buffer descriptor block may further store a value, e.g., number of bytes, indicating a size of the data to be transferred. The DMA controller may then transfer the data located at the source address in the first DSP processor core, with a size, e.g., number of bytes, indicated from the buffer descriptor block, to the destination address in the second DSP processor core.Type: GrantFiled: February 20, 2004Date of Patent: January 29, 2008Assignee: International Business Machines CorporationInventors: Youseff Abdelilah, Bartholomew Blaner, Gordon Taylor Davis, Jeffrey Haskell Derby, Joseph Franklin Garvey, Malcolm Scott Ware, Hua Ye
-
Patent number: 7283526Abstract: A method and system for identifying sessions in a computer network is disclosed. The session is between a first computer system and a second computer system. The session consists of an exchange of a plurality of packets between the computer systems. Each of the packets includes source information and destination information relating to the first computer system and the second computer system. The method and system include providing a symmetric key and identifying the session using the symmetric key. The symmetric key is provided utilizing a manipulation of the source information and the destination information. The symmetric key is associated with the plurality of packets traveling between the first computer system and the second computer system.Type: GrantFiled: July 19, 2001Date of Patent: October 16, 2007Assignee: International Business Machines CorporationInventor: Gordon Taylor Davis
-
Publication number: 20070236478Abstract: Touch panel systems and methods are disclosed that can distinguish temporally overlapping touch inputs from single touch inputs so that valid touch position coordinates can be determined. Touch panel systems and methods of the present invention can distinguish overlapping touches by comparing signal magnitudes to specified thresholds, by comparing the rates of change of signal magnitudes or measured positions to determined parameters, by locating the proximity a calculated location to icons or other such active areas, and the like. Because touch panel systems and methods of the present invention can discriminate single touches from double touches, they can be used in multiple user applications such as multiplayer games as well as in applications that may be subject to rapidly successive or overlapping touch inputs.Type: ApplicationFiled: June 19, 2007Publication date: October 11, 2007Inventors: Bernard GEAGHAN, Robert Moshrefzadeh, Craig Cordeiro, Edward Hagermoser, James Hart, Paul Hatin, Karl Hauck, Richard Peterson, Stephen Schulz, Gordon Taylor
-
Patent number: 7281118Abstract: A method and system for messaging between processors and co-processors connected through a bus. The method permits a multi-thread system processor to request the services of a processor or co-processor located on the bus. Message control blocks are stored in a memory which identify the physical address of the target processor, as well as a memory location in the memory dedicated to the thread requesting the service. When the system processor requests service of a processor or co-processor, a DCR command is created pointing to the message control block. A message is built from information contained in the message control block or transferred to the processor or co-processor. The return address for the processor or co-processor message is concatenated with the thread number, so that the processor or co-processor can create a return message specifically identifying memory space dedicated to the requesting thread for storage of the response message.Type: GrantFiled: August 5, 2005Date of Patent: October 9, 2007Assignee: International Business Machines CorporationInventors: Jeffrey Todd Bridges, Gordon Taylor Davis, Thomas Andrew Sartorius, Michael Steven Siegel
-
Publication number: 20070215143Abstract: According to embodiments of the present invention, a pellet stove includes a firepot assembly with a bottom plate slideable along rails to move between a closed position during combustion in the firepot and an open position during ash removal. According to other embodiments, a firebox or combustion enclosure includes a plurality of airfoils formed on the inner and outer surfaces of the enclosure to facilitate heat exchange between exhaust gases flowing across the inner surface of the enclosure and air blown across the outer surface of the enclosure. According to some embodiments, the airfoils and enclosure are of integral unibody construction. According to yet other embodiments, a user sets parameters via a wall control unit, and a stove control unit receives the parameters and automatically controls fuel feed rate, ignition, convection blower, combustion blower, and/or firepot cleaning based on the one or more parameters.Type: ApplicationFiled: March 8, 2007Publication date: September 20, 2007Applicant: HNI TECHNOLOGIES INC.Inventors: Colin McCormick, Daniel Henry, Matthew Wicks, Gordon Taylor
-
Patent number: 7272663Abstract: A method and system for compressing and transmitting data using asynchronous transfer mode (ATM) is disclosed. The data include a plurality of segments. Each of the plurality of segments has a first end and a second end. In one aspect, the method and system include representing the first end of a segment with a partition compression code word and compressing a remaining portion of the segment. The method and system could also combine the marking of the boundary and subsequent data into a compound compression code word. In another aspect, the method and system include representing the first end of a segment with a transparent mode command, transmitting the transparent mode command, and transmitting a remaining portion of the segment.Type: GrantFiled: August 28, 2001Date of Patent: September 18, 2007Assignee: International Business Machines CorporationInventors: Gordon Taylor Davis, Jeffrey Haskell Derby, Malcolm Scott Ware
-
Publication number: 20070133351Abstract: The invention is a system for acquiring and mapping the location of a human target within a targeted zone defined by boundaries. The system includes a remote sound detection component, which may be a laser vibrometer, capable of placement at a remote safe distance without physical attachment at the targeted zone which detects sound from within the targeted zone, thereby generating a sound signal accurately representing characteristics of the detected sound. Further, a sound processing computer receives and analyzes the sound signal to determine the location of the sound relative to the targeted zone and generates a location signal representing the location of the sound. A target display is provided for receiving the location signal and outputting an accurate visual representation at the location of the target relative to the boundaries of the targeted zone.Type: ApplicationFiled: December 12, 2005Publication date: June 14, 2007Inventor: Gordon Taylor
-
Publication number: 20070034423Abstract: Systems and methods are disclosed for reducing susceptibility of touch screens to RF interference, thereby reducing susceptibility to touch position errors due to RF interference. In touch screen systems having touch sensors that lack a rear shield, the rear shield drive of the controller electronics can be capacitively connected individually to the touch signal drives, thereby placing a capacitive load on the touch signal drives that simulates the capacitive load that would otherwise be provided by a rear shield. This capacitive load compensates for the RF interference, which would otherwise tend to erroneously offset touch position determinations toward the center of the touch screen.Type: ApplicationFiled: August 12, 2005Publication date: February 15, 2007Inventors: Thomas Rebeschi, Bruce Lessard, Richard Peterson, Gordon Taylor
-
Patent number: 7167471Abstract: A method and system for identifying a data structure associated with a packet of data. A processor internal to a packet processor may extract one or more fields in a packet header field of a received packet of data to generate a search key. The internal processor may then be configured to select which table, e.g., routing table, quality of service table, filter table, needs to be accessed using the search key in order to process the received packet of data. A determination may then be made by the internal processor as to whether a CAM or a hash table and a Patricia Tree are used to identify the data structure associated with the received packet of data. Based on table definitions in a register, the internal processor may make such a determination.Type: GrantFiled: August 28, 2001Date of Patent: January 23, 2007Assignee: International Business Machines CorporationInventors: Jean Louis Calvignac, Gordon Taylor Davis, Marco Heddes, Michael Steven Siegel
-
Publication number: 20060267953Abstract: The present invention provides systems and methods for detecting stray capacitance in capacitive touch sensors. The existence of stray capacitance can lead to errors in touch detection and touch position determination. Such errors can be avoided or corrected when the stray capacitance is detected. Detecting stray capacitance includes analyzing signals for features characteristic of stray capacitance noise events. Such features can include spatial features such as the location of a test touch position determined from signals caused by stray capacitance, as well as temporal features such as the rate of change of the detected signals.Type: ApplicationFiled: May 31, 2005Publication date: November 30, 2006Inventors: Richard Peterson, Bulent Bulat, Bruce Lessard, Gordon Taylor
-
Patent number: 7136385Abstract: A method and system for performing network address translations for a session in a network is disclosed. The network includes at least one local network domain, and the at least one local network domain includes at least one computer system. Each computer system has a local address and is associated with a global address. The session exchanges packets that travel between the computer system within the local network domain and another computer system which may be outside of the local network domain. Each packet includes source and destination information. The method and system include determining a direction of travel for each packet, inbound or outbound, by searching a global address table for a match of a key for each packet. The key is provided using a portion of the destination information. The global address table includes at least one entry. Each entry corresponds to the global address for a first corresponding computer system.Type: GrantFiled: December 7, 2001Date of Patent: November 14, 2006Assignee: International Business Machines CorporationInventors: Philippe Damon, Gordon Taylor Davis
-
Patent number: 7116664Abstract: A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collisions of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.Type: GrantFiled: May 13, 2002Date of Patent: October 3, 2006Assignee: International Business Machines CorporationInventors: Gordon Taylor Davis, Andreas Guenther Herkersdorf, Clark Debs Jeffries, Mark Anthony Rinaldi
-
Patent number: 7107344Abstract: A method and apparatus useful in network management which makes intelligent, high speed, connection allocation decisions, overcoming difficulties encountered heretofore and providing enhanced network services. During episodes of network congestion, some connection requests for a class of service of low value and with currently a high number of existing connections may be purposefully ignored (not acknowledged with an Acknowledge (ACK) packet) so that the processing capability of a device will not become overwhelmed, causing the dropping of new connection is to note the numbers of connections of different classes relative to their service-level contracts, to ignore abundant, low-value connection requests in accordance with value policies when and only when necessary, and to insure that valuable new connection requests that conform to their contract connection rates can be intelligently accommodated.Type: GrantFiled: August 16, 2001Date of Patent: September 12, 2006Assignee: International Business Machines CorporationInventors: Gordon Taylor Davis, Clark Debs Jeffries, Mark Anthony Rinaldi
-
Patent number: 7093109Abstract: A control mechanism is established between a network processor and a tree search coprocessor to deal with latencies in accessing the data such as information formatted in a tree structure. A plurality of independent instruction execution threads are queued to enable them to have rapid access to the shared memory. If execution of a thread becomes stalled due to a latency event, full control is granted to the next thread in the queue. The grant of control is temporary when a short latency event occurs or full when a long latency event occurs. Control is returned to the original thread when a short latency event is completed. Each execution thread utilizes an instruction prefetch buffer that collects instructions for idle execution threads when the instruction bandwidth is not fully utilized by an active execution thread. The thread execution control is governed by the collective functioning of a FIFO, an arbiter and a thread control state machine.Type: GrantFiled: April 4, 2000Date of Patent: August 15, 2006Assignee: International Business Machines CorporationInventors: Gordon Taylor Davis, Marco C. Heddes, Ross Boyd Leavens, Fabrice Jean Verplanken
-
Patent number: 7089555Abstract: An ordered semaphore management subsystem and method for use in an application system which includes a plurality of processors competing for shared resources each of which is controlled by a unique semaphore. The subsystem generates an ordered semaphore field (OSF) corresponding to each processor in a linked list of processors and assigns one of four statuses to the OSF depending on the position the processor occupies in the linked list of processors competing for the shared resources. The four states are (1) semaphore head (SH); (2) behind semaphore head (BSH); (3) semaphore head behind (SHB); and (4) skip (Skip). Only the SH processor is allocated the semaphore when requested. A processor not in the SH state will be denied the semaphore even if is available to assure sequential access.Type: GrantFiled: June 25, 2002Date of Patent: August 8, 2006Assignee: International Business Machines CorporationInventors: Jean Louis Calvignac, Gordon Taylor Davis, Marco Heddes, Steven Kenneth Jenkins, Ross Boyd Leavens, Robert Brian Likovich, Jr.
-
Patent number: 7072344Abstract: A packet network redistributes excess bandwidth for voice and data sessions applying a Quality of Service (QoS) algorithm. The network includes interacting client stations using H.323 protocol managing bit rate according to an algorithm as voice and data sessions are added or removed from the network. The client stations include codecs coupled to the network. The codecs provide voice sessions at a minimum bandwidth using a voice codec bit rate and preferred bandwidth using another voice codec bit rate. A first algorithm applies the QoS algorithm allocating bandwidth between interacting client stations after the addition of a new voice or data session when there is insufficient bandwidth for the new session to receive preferred bandwidth. A second algorithm is applied when a voice or data session is removed from the interacting client stations. If any session is allocated minimum bandwidth the QoS increases a voice session at minimum bandwidth to preferred bandwidth if excess bandwidth is available.Type: GrantFiled: July 16, 2001Date of Patent: July 4, 2006Assignee: International Business Machines CorporationInventors: Youssef Abdelilah, Gordon Taylor Davis, Jeffrey Haskell Derby, Dongming Hwang, Clark Debs Jeffries, Malcolm Scott Ware, Hua Ye
-
Patent number: 7068601Abstract: A codec detects congestion in a packet network and responds via a session control protocol to re-negotiate codec-type and/or parameters with the receiving codec to reduce bit rate for supporting a session. Once the connection and session are established, encoded packets start flowing between the two codecs. A control entity sends and receives network congestion control packets periodically in the session. The congestion control packets provide a “heartbeat” signal to the receiving codec. When the network is not congested, all “heartbeat” packets will be passed through the network As network congestion increases, routers within the network discard excess packets to prevent network failure. The codecs respond to the missing packets by slowing down the bit rate or proceeding to renegotiate a lower bit rate via the session control protocol. If there are no missing packets, the codecs detect if the session is operating at the highest bit rate, and if not, re-negotiate a higher bit rate.Type: GrantFiled: July 16, 2001Date of Patent: June 27, 2006Assignee: International Business Machines CorporationInventors: Youssef Abdelilah, Gordon Taylor Davis, Jeffrey Haskell Derby, Dongming Hwang, Clark Debs Jeffries, Malcolm Scott Ware, Hua Ye
-
Patent number: 7065086Abstract: According to the present invention there is provided to a method and system for efficiently routing IP fragments (i.e., datagrams) at layer 3 through layer 7 of the OSI model without reassembling the fragments. Time-consuming reassembly of fragments of a datagram at higher layers that would be required via conventional methods is avoided, thereby improving processing speed of fragments and utilizing fewer resources for processing fragments of a datagram than would be required during reassembly of the fragments via conventional methods.Type: GrantFiled: August 16, 2001Date of Patent: June 20, 2006Assignee: International Business Machines CorporationInventors: Claude Basso, Jean Louis Calvignac, Philippe Damon, Gordon Taylor Davis
-
Patent number: 7054855Abstract: A method and system for performing a pattern match search for a data string having a plurality of characters separated by delimiters. In accordance with the method of the present invention a search key is constructed by generating a full match search increment comprising the binary representation of a data string element, wherein the data string element comprises all characters between a pair of delimiters. The search key is completed by concatenating a pattern search prefix to the full match search increment, wherein the pattern search prefix is a cumulative pattern search result of each previous full match search increment. A full match search is then performed within a lookup table utilizing the search key. In response to finding a matching pattern within the lookup table, the process returns to constructing a next search key. In response to not finding a matching pattern, the previous full match search result is utilized to process the data string.Type: GrantFiled: July 3, 2001Date of Patent: May 30, 2006Assignee: International Business Machines CorporationInventors: Claude Basso, Jean Louis Calvignac, Philippe Damon, Gordon Taylor Davis, Marco C. Heddes, Clark Debs Jeffries