Optimization method for computation partitioning oriented to a d

Details Optimization method for computation partitioning oriented to a d Optimization method for computation partitioning oriented to a d

1996-05-03

1998-07-14

Voeltz, Emanuel Todd

Boots, shoes, and leggings

395705, 395706, 3642804, 3642805, 364973, G06F 945

Patent

active

057817774

ABSTRACT:
When a loop contains a plurality of statements, a compiled program is generated without performing loop distribution, the resultant loop having no runtime resolution statement. A parallelizing compiler comprises a syntax analysis section, a data distribution analysis section, a computation partitioning section, a communication generating section, and a computation partitioning optimizing section composed of a non-intersecting interval sequence generating section for generating a non-intersecting interval sequence from a loop execution range, the sequence being a collection of intervals in each of which statements are either executed or not executed, a loop duplicating section for duplicating loops from an original loop, the non-intersecting interval sequence being used as a loop execution range, and a code transforming section for deleting the runtime resolution statement from the loop.

REFERENCES:
Saltz, et al. "Run-time Parallelization & Scheduling of Loops", IEEE Trans. on Computers, vol. 40, No. 5. pp. 603-612, May 1991.

Affiliated with

Also associated with

Rating

Optimization method for computation partitioning oriented to a d does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimization method for computation partitioning oriented to a d, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization method for computation partitioning oriented to a d will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1893019