How do you calculate how many cycles it takes to clear an initial queue?

Question

I have checked the Synchro software and can't find the answer.

Answer 1

this depends on your queue type and what you mean by cycles
if a cycle is a processor cycle
LIFO (last in first out) stack:
the number of cycles it take to pop a variable of the stack * number of variables in the stack
FIFO stack:
# of cycles to pop or mov * # of variables

and for a rotary cycle, this depends on how many variables you move out on each rotation... logically it would be 1, but you could move out as many variables as you want.

if this doesn't answer your question, please edit to be more specific

Answer 2

It depends on how the queue is stored. If it's in a hardware stack, it might take as long as one cycle per available entry. If it's in memory and implimented as a simple circular buffer, it could be as fast as setting the 'head' and 'tail' pointers to the same address.

HTH

Doug