The universal scalability law (USL) of computational capacity is a rational function Cp = P (p)/Q(p) with P (p) a linear polynomial and Q(p) a second-degree polynomial in the number of physical processors p, that has been long used for statistical modeling and prediction of computer system performance. We prove that Cp is equivalent to the synchronous throughput bound for a machine-repairman wi...

We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited ability to foresee future requests, what is the improvement that can be achieved in terms of the competitive ratio? We consider several online server routing problems in this setting, such as the online traveling salesman ...

In this paper, we develop a stochastic reliability model of one-unit main system with two associate units. Each unit also has one sub-unit. Sub-units depend upon Associate units and the unit. The will be operable when at least sub-unit are in operation. As soon as job arrives, all work load. It is assumed that only taken for processing time. There single repairman who repairs failed on first-co...

Given an undirected graph G= (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starting at s and together covering all the vertices (customers) such that the sum of the latencies experienced by the customers is minimum. Latency of a customer p is defined to be the distance traveled (time elapsed) before v...

The universal scalability law (USL) is an analytic model used to quantify application scaling. It is universal because it subsumes Amdahl’s law and Gustafson linearized scaling as special cases. Using simulation, we show: (i) that the USL is equivalent to synchronous queueing in a load-dependent machine repairman model and (ii) how USL, Amdahl’s law and Gustafson scaling can be regarded as boun...