Patents by Inventor Dale E. Parson

Dale E. Parson 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: 20100299319
    Abstract: A method for interaction between a subscriber and an entity includes determining a current locus and acquiring change in status information for a subscriber. Preference information, for one or more searchable parameters selected by the subscriber, and association information, for one ore more contacts made by the subscriber, are acquired. First and second strength information is then acquired. First strength information pertains to the subscriber's affinity for the preference information and second strength information encompasses the subscriber's affinity for the association information. Responsive to the change in status information, a group of first entities is selected. First entity information about the group of first entities is then generated. The current locus information, the preference information, the association information, the first strength information, and the second strength information are correlated with the first entity information to produce correlation information.
    Type: Application
    Filed: February 13, 2008
    Publication date: November 25, 2010
    Applicant: SANDBRIDGE TECHNOLOGIES, INC.
    Inventors: Dale E. Parson, C. John Glossner, Sanjay Jinturkar
  • Patent number: 6950963
    Abstract: An integrated circuit or other type of digital system including multiple processors is tested using a control mechanism which dynamically defines a group of processors subject to common control. The control mechanism receives one or more commands for each of the processors in the group, and delays issuance of one or more of the commands for the group until a designated group scan command is received for each of the processors in the group. The control mechanism may be in the form of a software-implemented chain manager which provides the above-noted group definition, command receipt and issuance delay operations, and subsequently delivers one or more of the test commands as a single serial bit stream to an IEEE 1149.1 hardware scan chain associated with the processors. The control mechanism can provide synchronous control for a group of homogeneous processors of the digital system, or pseudo-synchronous control for a group of heterogeneous processors of the digital system.
    Type: Grant
    Filed: May 30, 2000
    Date of Patent: September 27, 2005
    Assignee: Agere Systems Inc.
    Inventors: Dale E. Parson, Bryan Schlieder, James C. Vollmer, Jay Patrick Wilshire
  • Patent number: 6915296
    Abstract: Incremental reorganization of hash tables includes a copy phase and a clean phase. In the copy phase, used entries from an alternate hash table (AHT) are copied to a current hash table (CHT). During copying, hash table operations are allowed to access both tables. In the clean phase, entries in the AHT are marked as empty, and hash table operations are allowed to access only the CHT. Once all used entries have been copied from the AHT to the CHT, the clean phase begins. Once all entries in the AHT have been marked as empty during the clean phase, the two tables are switched and the copy phase begins. The copying or cleaning occurs with every hash table operation, a number of hash table operations, or a number based on analysis of recent hash table operations. Copying also occurs by avoiding copying of deleted or expired entries in the AHT. The present invention is suited to use in multithreaded real-time systems.
    Type: Grant
    Filed: October 29, 2002
    Date of Patent: July 5, 2005
    Assignee: Agere Systems Inc.
    Inventor: Dale E. Parson
  • Publication number: 20040083347
    Abstract: Incremental reorganization of hash tables includes a copy phase and a clean phase. In the copy phase, used entries from an alternate hash table (AHT) are copied to a current hash table (CHT). During copying, hash table operations are allowed to access both tables. In the clean phase, entries in the AHT are marked as empty, and hash table operations are allowed to access only the CHT. Once all used entries have been copied from the AHT to the CHT, the clean phase begins. Once all entries in the AHT have been marked as empty during the clean phase, the two tables are switched and the copy phase begins. The copying or cleaning occurs with every hash table operation, a number of hash table operations, or a number based on analysis of recent hash table operations. Copying also occurs by avoiding copying of deleted or expired entries in the AHT. The present invention is suited to use in multithreaded real-time systems.
    Type: Application
    Filed: October 29, 2002
    Publication date: April 29, 2004
    Inventor: Dale E. Parson
  • Patent number: 6053947
    Abstract: A method, apparatus and system for simulating the operation of a circuit using a computer-based simulator comprising: (a) distributing at least one signal upon to one or more simulation model subcircuit functions, which use the signal, upon a change in the signal; (b) scheduling one or more subcircuit functions that use the signal for execution according to a priority assigned to each subcircuit function; and (c) providing an output value to the simulator when no subcircuit functions are scheduled, otherwise, executing one or more subcircuit functions with the highest priority and returning to step (a) to repeat the process.
    Type: Grant
    Filed: May 31, 1997
    Date of Patent: April 25, 2000
    Assignee: Lucent Technologies, Inc.
    Inventor: Dale E. Parson