Determining a communication schedule between processors

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395709, G06F 945

Patent

active

061263311

ABSTRACT:
To generate an optimum communication schedule when data is transmitted or received between processors which constitute a parallel computer or a distributed multiprocessor system.
Processors which each perform inter-processor communication are sorted into a plurality of groups. A communication graph is generated whose nodes correspond to the groups and edges correspond to the communications. Communication graphs are generated for distances between nodes from one through N-1. Each communication graph corresponds to a communication step of the inter-processor communication. Communication is grasped as a whole by the communication graph and the edge of the communication graph means the inter-processor communication which is performed in a certain communication step. In this way, the communication can be optimized.

REFERENCES:
patent: 4387427 (1983-06-01), Cox et al.
patent: 4972314 (1990-11-01), Getzinger et al.
patent: 5247694 (1993-09-01), Dahl
patent: 5737623 (1998-04-01), Liebrock
patent: 5742821 (1998-04-01), Prasanna
Al-Mouhamed, Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs, IEEE Transactions on Software Engineering, vol. 16, No. 12, Dec. 1990.
Games-Kanevsky-Krupp-Monk, Real-Time Communications Scheduling for Massively Parallel Processors, IEEE, Dec. 1995.

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

Determining a communication schedule between processors does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Determining a communication schedule between processors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Determining a communication schedule between processors will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-188663

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