Modulo scheduling of multiple instruction chains

Details Modulo scheduling of multiple instruction chains Modulo scheduling of multiple instruction chains

G - Physics

06

F

G06F 9/30 (2006.01) G06F 9/45 (2006.01)

Patent

CA 2433379

Instructions of a loop are related in instruction chains represented by a data dependency graph with multiple first nodes for the instruction chains (either in a backward or forward direction). These instructions are modulo scheduled for execution by a processor. Execution parameters for each instruction denote execution relationships with previous instructions including latencies from execution of previous instructions and processor resources used by the instruction for execution. The instructions are ordered for scheduling according to a priority value for each instruction, which may be determined in a number of ways. Ordering starts with all instructions that have the highest priority value. Ordering continues with instructions related to instructions that have already been ordered; those instructions that are related and have a given priority value for the unordered instructions. After all instructions have been ordered they are modulo scheduled. Instructions are scheduled according to the previously determined order on the basis of latencies of previous related instructions, resources used by the instruction for execution and resources available in time cycles in the schedule.

Affiliated with

Also associated with

Rating

Modulo scheduling of multiple instruction chains does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Modulo scheduling of multiple instruction chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modulo scheduling of multiple instruction chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1555412