I What is the average time to do a pass when data is read after a period of time?

  • I
  • Thread starter Thread starter cpscdave
  • Start date Start date
  • Tags Tags
    Average Data Time
cpscdave
Messages
402
Reaction score
120
Hi there,
I'm trying to model how much faster we will be able to pull data from a set of controllers.
I know how long it takes to read a single data point from each controller.
Right now we are reading each and every data point.

The change I would like to model is some of the data isn't read each pass. But instead read after a period of time during that next pass.

So if we have 2 sets of data A and B
Right now each pass reads A and B and takes x seconds

The change will result in
Pass 1: A & B
Pass 2: A
Pass 3: A
... so many seconds elapse:
Pass N: A& B

How do I figure out the average time it takes to do a pass in the second case??

Thanks :)
 
Mathematics news on Phys.org
How does that look in time?

"We read A for two seconds, then B for two seconds, then A for two seconds, then A for two seconds,. ..."?
Then all you need is the average fraction B that gets read, multiply by the time it takes, add the time for A and you have your average time per pass.
 
Thats what I originally did.
The problem I ran into is when I follow that through:
A: Time to read the data each loop
B: Time to read the data on
C: the fraction of scans where B is read
Time = A + C*B

So now I need to figure out what C is which I figure is Time/M (M is how often to scan the data)
So solving that out I end up with Time = A*M/(M-B)
Which doesn't seem right.
 
Looks right to me.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top