Computer Science – Data Structures and Algorithms
Scientific paper
2006-07-12
Computer Science
Data Structures and Algorithms
16 pages, 3 figures
Scientific paper
Behavior of the delta algorithm of autonomic switch between two component implementations is considered on several examples of a client-server systems involving, in particular, periodic change of intensities of requests for the component. It is shown that in the cases of some specific combinations of elementary requests costs, the number of clients in the system, the number of requests per unit of time, and the cost of switch between the implementations, the algorithm may reveal behavior that is rather far from the desired. A sufficient criterion of a success of the algorithm is proposed based on the analysis of the accumulated implementations costs difference as a function of time. Suggestions are pointed out of practical evaluation of the algorithm functioning regarding the observations made in this paper.
No associations
LandOfFree
On Some Peculiarities of Dynamic Switch between Component Implementations in an Autonomic Computing System 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 On Some Peculiarities of Dynamic Switch between Component Implementations in an Autonomic Computing System, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Some Peculiarities of Dynamic Switch between Component Implementations in an Autonomic Computing System will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-168076