β Scribed by S. Dharmaraja
No coin nor oath required. For personal study only.
two-processor system heterogeneous with Poisson arrival of jobs having exponentially distributed execution times is considered. Here, the service rates of these processors are not identical. Each job requires exactly one processor for its execution and the scheduling policy is FCFS. When both the processors are idle, the faster processor is scheduled for service before the slower one. For this system, exact time-dependent system size probabilities are obtained using a suitable probability generating function. Finally, some important performance measures are also obtained.
π SIMILAR VOLUMES
We present a deterministic parallel algorithm that solves a n-dimensional system Ax s b of linear equations over an ordered field or over a subfield of the complex Ε½ 2 . Ε½ Γ Ε½ . 2 numbers. This algorithm uses O log n parallel time and O max M n , n Ε½ . 4 . Ε½ . log log n rlog n arithmetic processors