Patents Represented by Attorney Gerard M. Wissing
  • Patent number: 5940620
    Abstract: A compiler which facilitates wide compilation functions using an intermediate compile mechanism that performs wide compilation functions without changing existing program makefiles. The intermediate compile mechanism supports cross-module inline substitutions and passing of arguments in registers, to improve execution times of executable programs.
    Type: Grant
    Filed: March 7, 1997
    Date of Patent: August 17, 1999
    Assignee: NCR Corporation
    Inventor: Marvin L. Graham
  • Patent number: 5937191
    Abstract: A program analysis method that profiles blocks of a program when the program is running with representative data and provides reports on the activity of data structures of the program without significantly affect the execution time of the profiled program. Programmers can then use these reports to tune the performance of the program by, for example, reorganizing the program data structures to reduce its data cache usage during execution.
    Type: Grant
    Filed: June 3, 1997
    Date of Patent: August 10, 1999
    Assignee: NCR Corporation
    Inventor: Marvin L. Graham
  • Patent number: 5918249
    Abstract: A non-uniform memory accessing (NUMA) based multiprocessor system that promotes local memory accessing and data migration to local processor nodes. The system includes mechanisms to re-map virtual and physical addresses to promote local memory accessing and implements a least recently used memory allocation mechanism to age non-local memory accesses out of memory to be re-read into local memory, which promotes data migration to local memory on processor nodes.
    Type: Grant
    Filed: December 19, 1996
    Date of Patent: June 29, 1999
    Assignee: NCR Corporation
    Inventors: John S. Cox, John H. Waters
  • Patent number: 5710885
    Abstract: A method and system for monitoring nodes in a network having at least one network management station and a plurality of nodes is provided. Initially, polling messages are sent from the network management station to the plurality of nodes. Preferably, the polling messages are sent in a sequence whose emission is regulated at a predetermined rate. As the polling messages are sent, an unacknowledged poll table is updated with the appropriate information indicating that a set of nodes have been sent a polling message. The unacknowledged poll table is preferably indexed by an IP address of each node and is indexed by the time of the next scheduled timeout associated with each node. This method allows an arbitrary number of unacknowledged polls to be outstanding at any instant. Once the polling messages are sent and the queue is updated, the network management station then determines if a node has failed.
    Type: Grant
    Filed: November 28, 1995
    Date of Patent: January 20, 1998
    Assignee: NCR Corporation
    Inventor: Andre B. Bondi