Abstract A method is disclosed for deriving code schedule sequences for a target code generator from an input ordering of nodes and prime factors of their respective ordered invocation rates from an SDF graph representative of a system. The method involves first creating a loop set for each prime factor wherein the elements of each loop set are the actors, the invocation frequency from which are factorable by that prime factor and are ordered. The redundant created loop sets are merged so as to eliminate those sets with identical nodes. The merged loop sets are then sorted in decreasing order by the total number of node elements in each set. A determination is then made as to whether each loop set is a proper subset of its sorted ordered predecessor loop set with which it intersects and, if not, then breaking the non-disjoint sets into sublists of sets which are proper subsets of their predecessor sets and then determining whether the parent sets of the broken sublists are then disjoint from one another. If they are not then repeating these two substeps. The next step of the present method then involves extracting a loop schedule for each sublist and combining the extracted loop schedules in accordance with the sorted precedence ordering of the nodes in each of said loop sets to produce the code schedule sequences. In such a manner, the code schedule sequences generated corresponds to every potential type of actor or block in the system and can then be used to minimize both program and data memory requirements of the scheduled systems.
A method for deriving code schedule sequences for a target code generator from an input ordering of nodes and prime factors of their respective ordered invocation rates from an SDF graph representative of a system, comprising the steps of: creating a loop set for each prime factor wherein the elements of each loop set are the actors, the invocation frequency from which are factorable by that prime factor and are ordered; merging redundant created loop sets so as to eliminate those sets with identical nodes; sorting the merged loop sets in decreasing order by the total number of node elements in each set; determining whether each loop set is a proper subset of its sorted ordered predecessor loop set with which it intersects and, if not, then performing the substeps of: (a) breaking the non-disjoint sets into sublists of sets which are proper subsets of their predecessor sets; and (b) determining whether the parent sets of the broken sublists are then disjoint from one another and, if not, repeating substeps (a) and (b); extracting a loop schedule for each sublist; and combining the extracted loop schedules in accordance with the sorted precedence ordering of the nodes in each of said loop sets to generate the code schedule sequences.
Claim 2
Independent Claim
208 words
A method for deriving code schedule sequences for a target code generator from an input ordering of nodes and prime factors of their respective ordered invocation rates from an SDF graph representative of a system, comprising the steps of: creating a loop set for each prime factor wherein the elements of each loop set are the actors, the invocation frequency from which are factorable by that prime factor and are ordered; merging redundant created loop sets so as to eliminate those sets with identical nodes; sorting the merged loop sets in decreasing order by the total number of node elements in each set; determining whether each loop set is a proper subset of its sorted ordered predecessor loop set with which it intersects and, if not, then performing the substeps of: (a) breaking the non-disjoint sets into sublists of sets which are proper subsets of their predecessor sets; and (b) determining whether the parent sets of the broken sublists are then disjoint from one another and, if not, repeating substeps (a) and (b); extracting a loop schedule for each sublist; and combining the extracted loop schedules in accordance with the sorted precedence ordering of the nodes in each of said loop sets to generate the code schedule sequences.
Claim 3
Dependent Claim
49 words
A method as defined in claim 1 wherein the step of creating a loop set for each prime factor further comprises the step of: splitting into separate subsets those created loop sets in which two or more members of that set are factorable by a power greater than one.
Claim 4
Dependent Claim
52 words
A method as defined in claim 1 wherein the step of creating a loop set for each prime factor further comprises the step of: splitting into separate subsets those created loop sets in which the sets of nodes are non-contiguous and thereby contain sets of nodes which are interrupted by a dash.
Claim 5
Dependent Claim
39 words
A method as defined in claim 1 wherein the step of extracting a loop schedule for each sublist further comprises the step of: indexing down each of said sublists and across each of said node elements in said sublists.
Claim 6
Dependent Claim
51 words
A method as defined in claim 1 wherein the step of combining the extracted loop schedules in accordance with the sorted precedence ordering of the nodes of each of said loop sets to generate the code schedule sequences produces a text string of characters representative of the generated code schedule sequence.