# Determine Timing of Dynamic Refreshes?

GROUPS:
 W. Craig Carter 1 Vote How would one determine the efficiency of a code for which drawing a graphic is the most expensive step?I am investigating various methods to change a graphics object in a Dynamic[Graphics[...]]For example, positions = RandomReal[{-1, 1}, {200, 2}]; colors = RandomColor[Length[positions]]; radii = RandomReal[{0, .1}, Length[positions]]; Dynamic[Graphics[MapThread[{#3,Disk[#1,#2]}&,{positions, radii, colors}]] I am curious how much time each Dynamic refresh takes. I tried using EvaluationData, but couldn't make it work. I wonder if there is a way to create a "DynamicEvaluationMonitor"?
 I think it has just lower bound on time but not the upper bound, because you cannot force computer to perform some operations faster than it physically can. On the other hand if the computer is fats enough, it will not shorten time below designated, like here and go steady at that rate: Dynamic[Refresh[DateString[], UpdateInterval -> 1]] But I am just guessing.