Partitioning case statements for optimal execution performance

Details Partitioning case statements for optimal execution performance Partitioning case statements for optimal execution performance

1991-02-01

1994-08-16

Kulik, Paul V.

Boots, shoes, and leggings

364DIG1, 364280, 3642804, 3642805, G06F 945

Patent

active

053394208

ABSTRACT:
This invention permits an optimizing compiler to select optimal instruction sequences for handling the source level multi-way branch, commonly known as the case or switch statement. A costing heuristic is established, based on machine specific information, which weights the relative performance of instruction sequences used to perform statement selection from several available selection methods. The constants, which form the basis of the selection criteria, are then clustered into sets. This clustering is controlled by the costing heuristic. The resulting sets represent clusters of values for which a particular selection method is most appropriate. The invention is preferably implemented at the intermediate code level, and with appropriate preselection of parameters by the compiler builder, allows the invention to be used on any type of target machine. The use of the invention results in faster compilation and execution.

REFERENCES:
patent: 5093916 (1992-03-01), Karp et al.

Affiliated with

Also associated with

Rating

Partitioning case statements for optimal execution performance does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Partitioning case statements for optimal execution performance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning case statements for optimal execution performance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-960009