Memoryless communications adapter including queueing and matchin

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395859, G06F 300

Patent

active

057457816

ABSTRACT:
A memoryless communications adapter for communicating between the nodes of a distributed parallel computer network, each node including a non-shared program memory coupled to the memoryless communications adapter which interfaces the network. An embodiment of the present invention advantageously provides an adapter that can manipulate queues and matching tables efficiently in hardware and provide a high-level object view of queues and matching in the context of communication between nodes. Preferably, the Queue manipulation logic, Match Table manipulation logic and the Sequence Table manipulation logic are implemented in the adapter hardware which does not keep any state or resources in it that depend on the size of the system or the number of queues/tables instantiated. The actual states of these objects may be kept in the program memory, so that the adapter hardware is memoryless.

REFERENCES:
patent: 5133053 (1992-07-01), Johnson
patent: 5386566 (1995-01-01), Hamanaka
patent: 5448702 (1995-09-01), Garcia
patent: 5611046 (1997-03-01), Russell
patent: 5623628 (1997-04-01), Brayton
patent: 5655146 (1997-08-01), Baum

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Memoryless communications adapter including queueing and matchin does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memoryless communications adapter including queueing and matchin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memoryless communications adapter including queueing and matchin will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1543182

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.