Incidence graph based communications and operations method and a

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3958002, 39580028, G06F15/00

Patent

active

059037709

ABSTRACT:
A method and apparatus for performing operations at nodes in a distributed network of interconnected nodes wherein a two dimensional array is arranged with each of the nodes represented by a single row heading and a single column heading. The intersections of row and column headings at which operations are to be performed may be provided with a token indicative of this condition. The token may further be associated with operation parameters defining the performance of the operations at the two nodes represented by the intersecting row and column headings.

REFERENCES:
patent: 5485626 (1996-01-01), Lawlor et al.
patent: 5561805 (1996-10-01), Bruck et al.
patent: 5594918 (1997-01-01), Knowles et al.
patent: 5630162 (1997-05-01), Wilkinson et al.
patent: 5669008 (1997-09-01), Galles et al.
patent: 5701416 (1997-12-01), Thorson et al.
patent: 5737628 (1998-04-01), Birrittella et al.
"Scheduling of Unstructured Communication on the Intel iPSC/860*", by J. Wang et al., School of Computer and Information Science, Syracuse University, 1994 IEEE, 1063-9535/94, pp. 360-369.

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

Incidence graph based communications and operations method and a does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Incidence graph based communications and operations method and a, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incidence graph based communications and operations method and a will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-254475

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