Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
A Clustering Approximation Technique for Queueing Network Models with a Large Number of Chains
IEEE Transactions on Computers
Performance and Reliability Analysis Using Directed Acyclic Graphs
IEEE Transactions on Software Engineering
Numerical analysis: 4th ed
A modeling methodology for the analysis of concurrent systems and computations
Journal of Parallel and Distributed Computing
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
The use of GMB in the design of robust software for distributed systems
Software Engineering Journal
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
A Reduction Technique for Evaluating Queueing Networks with Serialization Delays
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Performance of multi-level client-server systems with parallel service operations
Proceedings of the 1st international workshop on Software and performance
Performance Estimation for Real-Time Distributed Embedded Systems
IEEE Transactions on Parallel and Distributed Systems
Performance analysis for parallel solutions to generic search problems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Performance estimation for real-time distributed embedded systems
Readings in hardware/software co-design
Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment
Annals of Mathematics and Artificial Intelligence
A Three-View Model for Performance Engineering of Concurrent Software
IEEE Transactions on Software Engineering
Software Performance Evaluation by Models
Performance Evaluation: Origins and Directions
Performance modeling and analysis of correlated parallel computations
Parallel Computing
| Hi-index | 0.01 |
An analytic model is proposed for estimating task response times in distributed systems with resource contentions. The model consists of two submodels. The first submodel is an extended queuing network model used for approximating module response times. This submodel is solved by a decomposition technique which reduces the computational complexity by two to three orders of magnitude when compared with a direct approach. The second submodel is a weighted control-flow graph model from which task response time can be obtained by aggregating module response time in accordance with the precedence relationships. Task response times estimated by the analytic model compare closely with simulation results. It is shown that resource contention delays depend on the availability of resources as well as on the invocation rates and response times of the modules that use the resources. The model can be used to study the tradeoffs among module assignments, scheduling policies, interprocessor communications, and resource contentions in distributed processing systems.