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.
Conference paper
PERFORMANCE ANALYSIS OF TASK SYSTEMS USING A QUEUEING NETWORK MODEL.
Abstract
Queuing network (QN) solvers, and especially packages developed for the performance analysis of multiprogrammed computer systems, can only handle independent jobs (in possibly different categories). These packages are not applicable to the analysis of workloads that have precedence relationships among the set of jobs to be processed. Such workloads can be represented by (acyclic) task systems, where each task is specified by its service demands on the target computing system. The authors propose a solution method based on hierarchical decomposition to efficiently compute the performance measures of interest in task systems, such as its mean completion time. An example of the application of the solution method to a load balancing problem is presented.
Related
Conference paper
Distributed concurrency control with limited wait-depth
Conference paper
ON COUPLING PARTITIONED DATABASE SYSTEMS.
Conference paper