Patents by Inventor John T. Robinson

John T. Robinson 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).

  • Publication number: 20190228632
    Abstract: A patient fall detection system includes a computer and multiple transceivers mounted at fixed locations in a healthcare facility. The transceivers are electronically coupled to the computer. A patient identification tag is worn by a patient and includes a tag transceiver. The high-accuracy locating system monitors a location of the patient ID tag via signals from the tag transceiver to determine whether a patient has entered a bathroom. The computer monitors at least one of an elevation of the patient ID tag in the bathroom, an elevation drop of the patient ID tag in the bathroom, or a time that the patient ID tag has been in the bathroom to determine whether the patient has fallen.
    Type: Application
    Filed: December 27, 2018
    Publication date: July 25, 2019
    Inventors: Laura A. Hassey, Steven D. Baker, Bradley T. Smith, Eric D. Agdeppa, Pamela Wells, Thomas A. Myers, Andrew S. Robinson, Kiana M. Dezelon, John S. Schroder
  • Publication number: 20190151996
    Abstract: A method of slitting a film material of a biosensor test strip is disclosed. The film material includes a working surface and an opposed bottom surface. The film material is moved relative to a bottom laser beam directed against the bottom surface of the film material, and relative to a working surface laser beam directed against the working surface of the film material. The bottom laser cuts partially into the bottom surface of the film material to a first depth. The working surface laser cuts into the working surface of the film material to a second depth. The bottom and working surface laser cuts are aligned and cooperate to define first and second portions of the film material on opposite sides of cuts. The bottom and working surface laser cuts either intersect and thereby separate the first and second portions, or are closely adjacent, leaving a connecting bridge which is subsequently severed into two portions.
    Type: Application
    Filed: November 22, 2017
    Publication date: May 23, 2019
    Applicant: Roche Diabetes Care, Inc.
    Inventors: Brett David Robinson, John T. Austera
  • Patent number: 9436708
    Abstract: A method and a computer system for providing a federated wide area motion imagery (WAMI) collection service are provided. The method includes issuing a request to retrieve WAMI collection metadata from a first WAMI collection service in one or more collection services, the one or more WAMI collection services providing WAMI collection metadata; receiving the WAMI collection metadata from the first WAMI collection service; and storing the WAMI collection metadata from the first WAMI collection service in a local cache of the computer system.
    Type: Grant
    Filed: March 8, 2013
    Date of Patent: September 6, 2016
    Assignee: PIXIA CORP.
    Inventors: Rahul C. Thakkar, Michael L. Maraist, John T. Robinson
  • Publication number: 20140164426
    Abstract: A method and a computer system for providing a federated wide area motion imagery (WAMI) collection service are provided. The method includes issuing a request to retrieve WAMI collection metadata from a first WAMI collection service in one or more collection services, the one or more WAMI collection services providing WAMI collection metadata; receiving the WAMI collection metadata from the first WAMI collection service; and storing the WAMI collection metadata from the first WAMI collection service in a local cache of the computer system.
    Type: Application
    Filed: March 8, 2013
    Publication date: June 12, 2014
    Applicant: PIXIA CORP.
    Inventors: Rahul C. THAKKAR, Michael L. Maraist, John T. Robinson
  • Patent number: 8189046
    Abstract: A communication system for multiple users whereby an automatic indication of away status is prompted immediately upon a user's departure from the vicinity of a computer or other medium. In a preferred embodiment, this is accomplished, in an instant messaging environment, via a video camera arrangement whereby, upon there being a detection of a user's absence from the immediate vicinity, an automatic prompt is made to indicate away status for the user.
    Type: Grant
    Filed: July 22, 2008
    Date of Patent: May 29, 2012
    Assignee: International Business Machines Corporation
    Inventors: John T. Robinson, Michael E. Wazlowski
  • Publication number: 20090083492
    Abstract: A hardware based method for determining when to migrate cache lines to the cache bank closest to the requesting processor to avoid remote access penalty for future requests. In a preferred embodiment, decay counters are enhanced and used in determining the cost of retaining a line as opposed to replacing it while not losing the data. In one embodiment, a minimization of off-chip communication is sought; this may be particularly useful in a CMP environment.
    Type: Application
    Filed: November 17, 2008
    Publication date: March 26, 2009
    Applicant: International Business Machines Corporation
    Inventors: Alper Buyuktosunoglu, Zhigang Hu, Jude A. Rivers, John T. Robinson, Xiaowei Shen, Vijayalakshmi Srinivasan
  • Publication number: 20080310683
    Abstract: A communication system for multiple users whereby an automatic indication of away status is prompted immediately upon a user's departure from the vicinity of a computer or other medium. In a preferred embodiment, this is accomplished, in an instant messaging environment, via a video camera arrangement whereby, upon there being a detection of a user's absence from the immediate vicinity, an automatic prompt is made to indicate away status for the user.
    Type: Application
    Filed: July 22, 2008
    Publication date: December 18, 2008
    Applicant: International Business Machines Corporation
    Inventors: John T. Robinson, Michael E. Wazlowski
  • Patent number: 7454573
    Abstract: A hardware based method for determining when to migrate cache lines to the cache bank closest to the requesting processor to avoid remote access penalty for future requests. In a preferred embodiment, decay counters are enhanced and used in determining the cost of retaining a line as opposed to replacing it while not losing the data. In one embodiment, a minimization of off-chip communication is sought; this may be particularly useful in a CMP environment.
    Type: Grant
    Filed: January 13, 2005
    Date of Patent: November 18, 2008
    Assignee: International Business Machines Corporation
    Inventors: Alper Buyuktosunoglu, Zhigang Hu, Jude A. Rivers, John T. Robinson, Xiaowei Shen, Vijayalakshmi Srinivasan
  • Patent number: 7395373
    Abstract: Embodiments of a method for reducing conflict misses in a set-associative cache by mapping each memory address to a primary set and at least one overflow set are described. If a conflict miss occurs within the primary set, a cache line from the primary set is selected for replacement. However, rather than removing the selected cache line from the cache completely, the selected cache line may instead be relocated to the overflow set. The selected cache line replaces a cache line in the overflow set, if it is determined that the selected cache line from the primary set has an estimated age that is more recent than an estimated age for any cache line in the overflow set. Embodiments of the method incorporate various techniques for estimating the age of cache lines, and, particularly, for estimating the relative time since any given cache line was last accessed.
    Type: Grant
    Filed: September 20, 2005
    Date of Patent: July 1, 2008
    Assignee: International Business Machines Corporation
    Inventor: John T. Robinson
  • Patent number: 7254578
    Abstract: A method, apparatus and computer product wherein means and mechanisms are provided whereby, in a distributed or clustered shared file system, (1) concurrency classes may be defined specifying granularity of locking, whether locks are cached, and whether modified data is written-through at the completion of updates, (2) certain files, file types, or files and/or file types as used by given applications or classes of applications, may be associated with concurrency classes, and (3) for each usage of a file by an application, the associated concurrency class determines a policy for choosing specific concurrency and coherency control mechanisms to be used for accessing the given file.
    Type: Grant
    Filed: December 10, 2002
    Date of Patent: August 7, 2007
    Assignee: International Business Machines Corporation
    Inventors: Murthy V. Devarakonda, John T. Robinson
  • Patent number: 7228388
    Abstract: Arrangements and method for enabling and disabling cache bypass in a computer system with a cache hierarchy. Cache bypass status is identified with respect to at least one cache line. A cache line identified as cache bypass enabled is transferred to one or more higher level caches of the cache hierarchy, whereby a next higher level cache in the cache hierarchy is bypassed, while a cache line identified as cache bypass disabled is transferred to one or more higher level caches of the cache hierarchy, whereby a next higher level cache in the cache hierarchy is not bypassed. Included is an arrangement for selectively enabling or disabling cache bypass with respect to at least one cache line based on historical cache access information.
    Type: Grant
    Filed: November 19, 2004
    Date of Patent: June 5, 2007
    Assignee: International Business Machines Corporation
    Inventors: Zhigang Hu, John T. Robinson, Xiaowei Shen, Balaram Sinharoy
  • Patent number: 7103722
    Abstract: A method and structure is disclosed for constraining cache line replacement that processes a cache miss in a computer system. The invention contains a K-way set associative cache that selects lines in the cache for replacement. The invention constrains the selecting process so that only a predetermined subset of each set of cache lines is selected for replacement. The subset has at least a single cache line and the set size is at least two cache lines. The invention may further select between at least two cache lines based upon which of the cache lines was accessed least recently. A selective enablement of the constraining process is based on a free space memory condition of a memory associated with the cache memory. The invention may further constrain cache line replacement based upon whether the cache miss is from a non-local node in a nonuniform-memory-access system. The invention may also process cache writes so that a predetermined subset of each set is known to be in an unmodified state.
    Type: Grant
    Filed: July 22, 2002
    Date of Patent: September 5, 2006
    Assignee: International Business Machines Corporation
    Inventors: Caroline Benveniste, Peter Franaszek, John T. Robinson, Charles Schulz
  • Patent number: 6961821
    Abstract: A method and structure for replacing cache lines in a computer system having a set associative cache memory is disclosed. The method establishes ranking guidelines utilizing a writable cache replacement control array, wherein the guidelines can be dynamically changed by writing data to the cache replacement control array. The invention ranks states of different cache lines according to the ranking guidelines and replaces, upon a cache miss, a cache line having a highest rank of the rankings.
    Type: Grant
    Filed: October 16, 2002
    Date of Patent: November 1, 2005
    Assignee: International Business Machines Corporation
    Inventor: John T. Robinson
  • Patent number: 6901483
    Abstract: A method for selecting a line to replace in an inclusive set-associative cache memory system which is based on a least recently used replacement policy but is enhanced to detect and give special treatment to the reloading of a line that has been recently cast out. A line which has been reloaded after having been recently cast out is assigned a special encoding which temporarily gives priority to the line in the cache so that it will not be selected for replacement in the usual least recently used replacement process. This method of line selection for replacement improves system performance by providing better hit rates in the cache hierarchy levels above, by ensuring that heavily used lines in the levels above are not aged out of the levels below due to lack of use.
    Type: Grant
    Filed: October 24, 2002
    Date of Patent: May 31, 2005
    Assignee: International Business Machines Corporation
    Inventors: John T. Robinson, Robert B. Tremaine, Michael E. Wazlowski
  • Patent number: 6779088
    Abstract: A compressed memory system includes a cache, and compressed memory including fixed size storage blocks for storing both compressed data segments and fixed size storage blocks defining a virtual uncompressed cache (VUC) for storing uncompressed data segments to enable reduced data access latency. The compressed memory system implements a system and method for controlling the size of the VUC so as to optimize system performance in a manner which permits the avoidance of operating system intervention which is required in certain circumstances for correct system operation. The system solves-these problems by implementing one or more thresholds, which may be set by the operating system, but which, after being sets control the size of the VUC independently of the operating system or other system software.
    Type: Grant
    Filed: October 24, 2000
    Date of Patent: August 17, 2004
    Assignee: International Business Machines Corporation
    Inventors: Caroline D. Benveniste, Peter A. Franaszek, John T. Robinson
  • Publication number: 20040111422
    Abstract: A method, apparatus and computer product wherein means and mechanisms are provided whereby, in a distributed or clustered shared file system, (1) concurrency classes may be defined specifying granularity of locking, whether locks are cached, and whether modified data is written-through at the completion of updates, (2) certain files, file types, or files and/or file types as used by given applications or classes of applications, may be associated with concurrency classes, and (3) for each usage of a file by an application, the associated concurrency class determines a policy for choosing specific concurrency and coherency control mechanisms to be used for accessing the given file.
    Type: Application
    Filed: December 10, 2002
    Publication date: June 10, 2004
    Inventors: Murthy V. Devarakonda, John T. Robinson
  • Publication number: 20040083341
    Abstract: A method for selecting a line to replace in an inclusive set-associative cache memory system which is based on a least recently used replacement policy but is enhanced to detect and give special treatment to the reloading of a line that has been recently cast out. A line which has been reloaded after having been recently cast out is assigned a special encoding which temporarily gives priority to the line in the cache so that it will not be selected for replacement in the usual least recently used replacement process. This method of line selection for replacement improves system performance by providing better hit rates in the cache hierarchy levels above, by ensuring that heavily used lines in the levels above are not aged out of the levels below due to lack of use.
    Type: Application
    Filed: October 24, 2002
    Publication date: April 29, 2004
    Inventors: John T. Robinson, Robert B. Tremaine, Michael E. Wazlowski
  • Publication number: 20040078524
    Abstract: A method and structure for replacing cache lines in a computer system having a set associative cache memory is disclosed. The method establishes ranking guidelines utilizing a writable cache replacement control array, wherein the guidelines can be dynamically changed by writing data to the cache replacement control array. The invention ranks states of different cache lines according to the ranking guidelines and replaces, upon a cache miss, a cache line having a highest rank of the rankings.
    Type: Application
    Filed: October 16, 2002
    Publication date: April 22, 2004
    Inventor: John T. Robinson
  • Publication number: 20040015660
    Abstract: A method and structure is disclosed for constraining cache line replacement that processes a cache miss in a computer system. The invention contains a K-way set associative cache that selects lines in the cache for replacement. The invention constrains the selecting process so that only a predetermined subset of each set of cache lines is selected for replacement. The subset has at least a single cache line and the set size is at least two cache lines. The invention may further select between at least two cache lines based upon which of the cache lines was accessed least recently. A selective enablement of the constraining process is based on a free space memory condition of a memory associated with the cache memory. The invention may further constrain cache line replacement based upon whether the cache miss is from a non-local node in a nonuniform-memory-access system. The invention may also process cache writes so that a predetermined subset of each set is known to be in an unmodified state.
    Type: Application
    Filed: July 22, 2002
    Publication date: January 22, 2004
    Inventors: Caroline Benveniste, Peter Franaszek, John T. Robinson, Charles Schulz
  • Patent number: 6587923
    Abstract: In a computer system having a processor, a memory system including multiple levels of caches L1, L2, . . . , Ln−1 and including main memory Ln, and in which the cache Li−1 includes lines of size s and the cache Li includes lines of size t with t>s, a dual line size cache directory mechanism, in which the contents of a cache Li−1 may be accessed at line size granularity s (in which case it is determined whether a line corresponding to a given memory address is stored in Li−1, and if so its location and status), and in which the contents of Li−1 may also be accessed at line size granularity t (in which case it is determined whether any of the t/s lines of size s residing in the larger line of size t corresponding to a given memory address are stored in Li−1, and if so their locations and status) without multiple sequential accesses to a cache Li−1 directory structure.
    Type: Grant
    Filed: May 22, 2000
    Date of Patent: July 1, 2003
    Assignee: International Business Machines Corporation
    Inventors: Caroline D. Benveniste, Peter A. Franaszek, John T. Robinson