Math Problem

I need a math expert that can come up with a forumla but discuss it in mathmatical detail. I want it to be very high-level and very good.


In a computer system there are Jobs (Processes) that re-arrive periodically.

For example, if there are two Jobs: J1 and J1.

J2's service time (Completion time) is R2, it comes every T2 = 2 seconds.

J1's service time (Completion time) is R1, it comes every T1 =1 seconds

I want to determine the NUMBER of times J1 re-arrives during J2's time.

If J1 re-arrives periodically then n1 = R2/T1. That means J1 re-arrives n1 times. This is upper bound.

If R1>T1, then If J1 re-arrives periodically then n2 = R2/R1. That means J1 re-arrives n2 times during J2's time. This is the lower bound.

I want a very good math formula , that can help show the "Most Likely value" (a number between n1 and n2).

Budget $30.

thank you


Lihat lagi: very good computer, n math, N2, math n 1, math n, 1. problem, 1 problem, it computer jobs, computer it jobs, want to help of a computer expert, r2, problem, math, j1, help problem, need help math, level number, level math, computer jobs, level system processes, t1, number detail, math jobs, jobs expert, bound

Tentang Majikan:
( 1 ulasan ) Pluto, United States

ID Projek: #279685