About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
FTDCS 1990
Conference paper
Comparison of task response times in parallel systems
Abstract
Generic queuing models of parallel systems with K ≥ 2 exponential servers, where jobs may be split into K independent tasks, are considered. The queuing of jobs is distributed if each server has its own queue and centralized if there is a common queue. The scheduling of jobs is no splitting if all tasks of a job must run on one processor and splitting if they can run concurrently on different processors. Exact and approximate expressions for the mean response time, Tr:K, of the rth, r = 1, 2, ..., K, departing task in a job are obtained and compared for four models: distributed/spitting, distributed/no splitting, centralized/splitting, and centralized/no splitting. The queuing models are described. Exact and approximate analyses of the various models are presented where expressions are obtained for the mean task response time. The various models are compared and applications in the areas of distributed query processing and parallel systems are included.