Optimal Synthesis of Multiple Algorithms

Details Optimal Synthesis of Multiple Algorithms Optimal Synthesis of Multiple Algorithms

2007-04-05

arxiv.org/abs/0704.0788v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper we give a definition of "algorithm," "finite algorithm," "equivalent algorithms," and what it means for a single algorithm to dominate a set of algorithms. We define a derived algorithm which may have a smaller mean execution time than any of its component algorithms. We give an explicit expression for the mean execution time (when it exists) of the derived algorithm. We give several illustrative examples of derived algorithms with two component algorithms. We include mean execution time solutions for two-algorithm processors whose joint density of execution times are of several general forms. For the case in which the joint density for a two-algorithm processor is a step function, we give a maximum-likelihood estimation scheme with which to analyze empirical processing time data.

Affiliated with

Also associated with

No associations

Rating

Optimal Synthesis of Multiple Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Synthesis of Multiple Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Synthesis of Multiple Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-294426