DOE Patents title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Message passing with parallel queue traversal

Abstract

In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.

Inventors:
 [1];  [1];  [1]
  1. Albuquerque, NM
Issue Date:
Research Org.:
Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1044059
Patent Number(s):
8170041
Application Number:
11/226,092
Assignee:
Sandia Corporation (Albuquerque, NM)
Patent Classifications (CPCs):
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
DOE Contract Number:  
AC04-94AL85000
Resource Type:
Patent
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Underwood, Keith D, Brightwell, Ronald B, and Hemmert, K Scott. Message passing with parallel queue traversal. United States: N. p., 2012. Web.
Underwood, Keith D, Brightwell, Ronald B, & Hemmert, K Scott. Message passing with parallel queue traversal. United States.
Underwood, Keith D, Brightwell, Ronald B, and Hemmert, K Scott. Tue . "Message passing with parallel queue traversal". United States. https://www.osti.gov/servlets/purl/1044059.
@article{osti_1044059,
title = {Message passing with parallel queue traversal},
author = {Underwood, Keith D and Brightwell, Ronald B and Hemmert, K Scott},
abstractNote = {In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2012},
month = {5}
}

Works referenced in this record:

A Hardware-Based Longest Prefix Matching Scheme for TCAMs
conference, January 2005