Abstract
This paper presents a survey of the existing work in the area of interval-based performance analysis of computing systems. Intervals in performance analysis is required when uncertainties or variabilities exist in the workload parameters for the performance model of the system. Intervals are also useful for computing upper and lower bounds on system performance. Most conventional analytic models accept a set of single valued parameters and produce a single valued model output. Adaptation of these existing models to handle interval parameters require new techniques that use interval arithmetic. Experiences with relational interval arithmetic provided by a constraint logic programming language in solving a number of performance analysis problems in conventional multiprogrammed computers as well as distributed processing systems are described.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bell-Northern Research Ltd. (1993). BNR Prolog Version 4.2.3 User Guide, Ottawa, Canada.
W. Cheney & D. Kincaid. (1985). Numerical Mathematics and Computing, Brooks/Cole Publishing Company, Pacific Grove, CA.
E.D. Lazowska, J. Zahorjan, G.S. Graham, & K.C. Sevcik. (1984). Quantitative System Performance. Prentice-Hall, Englewood Cliffs, NJ.
J. Luethi & G. Haring. (1995). Mean Value Analysis for Queuing Network Models with Intervals as Input Parameters. Technical Report TR-950101, Institut fur Angewandte Informatik und Informationssysteme der Universitat Wien. Lenagausse 2/8, A-1080 Wien, Austria.
J. Luethi, S. Majumdar & G. Haring. (1996a). Mean Value Analysis for Computer Systems with Variabilities in Workload. Proceedings of the Performance and Dependability Symposium(pp. 32-41). Chicago, IL.
J. Luethi, G. Kotsis, S. Majumdar & G. Haring. (1996b). Performance Analysis with Queueing Network Models with Variabilities and Uncertainties in Workload. Technical Report TR-96102, Institut fur Angewandte Informatikund Informationssysteme der Universitat Wien. Lenagausse 2/8, A-1080 Wien, Austria.
S. Majumdar, C.M. Woodside, J.E. Neilson & D.C. Petriu. (1991). Performance Bounds for Concurrent Software with Rendezvous. Performance Evaluation, 13: 207-236.
S. Majumdar. (1991). Interval Arithmetic for Performance Analysis of Distributed Computing Systems. Proceed-ings of the Canadian Conference on Electrical and Computer Engineering(pp. 32.3.1-32.3.4). Quebec City,Canada.
S. Majumdar, C.M. Woodside, J.E. Neilson & D.C. Petriu. (1992). Robust Box Bounds: Network Performance Guarantees for Closed Multiclass Queueing Networks with Minimal Stochastic Assumptions. Proceedings of the Infocom' 92 Conference(pp. 2006–2016). Florence, Italy.
S. Majumdar & R. Ramadoss. (1994). Interval-Based Performance Analysis of Computing Systems, Technical Report SCE-94-22, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada.
S. Majumdar & R. Ramadoss. (1995a). Interval-Based Performance Analysis of Computing Systems. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunica-tion Systems (MASCOTS' 95) (pp. 345-351). Durham (NC).
S. Majumdar, J. Luethi, & G. Haring. (1995b). Histogram-Based Performance Analysis of Computer Systems with Variabilities or Uncertainties in Workload. Technical Report SCE-95-22, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada.
S. Majumdar & C.M. Woodside. (1997). Robust Bounds and Throughput Guarantees for Closed Multiclass Queueing Networks. Performance Evaluation (accepted for publication).
R.E. Moore. (1996) Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ.
W. Older, A. Vellino & V. Farrahi. (1988). Application of Relational Arithmetic to X-Ray Diffraction Crystal-lography. Bell-Northern Research. Ottawa, Canada.
H. Ratschek & J. Rokne. New Computer Methods for Global Optimization. Ellis Horwood, Chichester, West Sussex.
R. Ramadoss. (1994). Interval-based Performance Analysis of Computing Systems, M.Eng. Thesis, Dept. of Systems and Computer Engineering, Carleton University. Ottawa, Canada.
M. Reiser & S.S. Lavenberg. (1980). Mean-Value Analysis of Closed Multiclass Queueing Networks. Journal of the Association for Computing Machinery, 27: 313-322.
S. Skelobe. (1974). Computation of Rational Interval Functions. BIt, 14: 87-94.
R. Suri. (1984). A Concept of Monotonicity and Its Characterization for Closed Queueing Networks. Operations Research,33, pp. 606-624.
C.M. Woodside, S. Majumdar & J.E. Neilson. (1991). Interval Arithmetic for Computing Performance Guarantees in Client-Server Systems. Lecture Notes in Computer Science: Advances in Computing and Information –Proceedings of the ICCI'91 Conference(eds. F. Dehne, F. Fiala, W.W. Koczkodaz)(pp. 535-546). Ottawa, Canada: Springer-Verlag.
C.M. Woodside, J.E. Neilson, D.C. Petriu & S. Majumdar. (1995). The Stochastic Rendezvous Network Model for Performance of Synchronous Client-Server-Like Distributed Software. IEEE Transaction on Computers, 44: 20-34.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Majumdar, S. Application of Relational Interval Arithmetic to Computer Performance Analysis: a Survey. Constraints 2, 215–235 (1997). https://doi.org/10.1023/A:1009709810642
Issue Date:
DOI: https://doi.org/10.1023/A:1009709810642