Message passing with parallel queue traversal
Patent
·
OSTI ID:1044059
- Albuquerque, NM
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.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- Assignee:
- Sandia Corporation (Albuquerque, NM)
- Patent Number(s):
- 8,170,041
- Application Number:
- 11/226,092
- OSTI ID:
- 1044059
- Country of Publication:
- United States
- Language:
- English
A Hardware-Based Longest Prefix Matching Scheme for TCAMs
|
conference | January 2005 |
Similar Records
The SprayList: a scalable relaxed priority queue
The Zipcode message-passing system
Logic, parallelism, and semantic networks: The Binary Predicate Execution Model
Journal Article
·
Sat Jan 24 00:00:00 EST 2015
· SIGPLAN
·
OSTI ID:1044059
+1 more
The Zipcode message-passing system
Conference
·
Thu Nov 12 00:00:00 EST 1992
·
OSTI ID:1044059
+2 more
Logic, parallelism, and semantic networks: The Binary Predicate Execution Model
Thesis/Dissertation
·
Fri Jan 01 00:00:00 EST 1988
·
OSTI ID:1044059