메뉴 건너뛰기




Volumn 57, Issue 6, 2008, Pages 780-794

Geometric bounds: A noniterative analysis technique for closed queueing networks

Author keywords

Computer systems organization; Modeling techniques; Operating systems; Performance; Performance of systems; Queuing theory; Software software engineering

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER OPERATING SYSTEMS; OPTIMIZATION; QUEUEING THEORY; SOFTWARE ENGINEERING;

EID: 44049090624     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2008.37     Document Type: Article
Times cited : (18)

References (41)
  • 2
    • 0037234868 scopus 로고    scopus 로고
    • A System Model for Dynamically Reconfigurable Software
    • K. Whisnant, Z. Kalbarczyk, and R.K. Iyer, "A System Model for Dynamically Reconfigurable Software," IBM Systems J., vol. 42, no. 1, pp. 45-59, 2003.
    • (2003) IBM Systems J , vol.42 , Issue.1 , pp. 45-59
    • Whisnant, K.1    Kalbarczyk, Z.2    Iyer, R.K.3
  • 5
    • 0016495143 scopus 로고
    • Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
    • F. Baskett, K.M. Chandy, R.R. Muntz, and F.G. Palacios, "Open, Closed, and Mixed Networks of Queues with Different Classes of Customers," J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
    • (1975) J. ACM , vol.22 , Issue.2 , pp. 248-260
    • Baskett, F.1    Chandy, K.M.2    Muntz, R.R.3    Palacios, F.G.4
  • 6
    • 0020091404 scopus 로고
    • Linearizer: A Heuristic Algorithm for Queueing Network Models of Computing Systems
    • K.M. Chandy and D. Neuse, "Linearizer: A Heuristic Algorithm for Queueing Network Models of Computing Systems," Comm. ACM, vol. 25, no. 2, pp. 126-134, 1982.
    • (1982) Comm. ACM , vol.25 , Issue.2 , pp. 126-134
    • Chandy, K.M.1    Neuse, D.2
  • 7
    • 0030197367 scopus 로고    scopus 로고
    • Bounding Errors Introduced by Clustering of Customers in Closed Product-Form Queueing Networks
    • W.C. Cheng and R.R. Muntz, "Bounding Errors Introduced by Clustering of Customers in Closed Product-Form Queueing Networks," J. ACM, vol. 43, no. 4, pp. 641-669, 1996.
    • (1996) J. ACM , vol.43 , Issue.4 , pp. 641-669
    • Cheng, W.C.1    Muntz, R.R.2
  • 8
    • 0018012356 scopus 로고
    • The Operational Analysis of Queueing Network Models
    • P.J. Denning and J.P. Buzen, "The Operational Analysis of Queueing Network Models," ACM Computing Surveys, vol. 10, no. 3, pp. 225-261, 1978.
    • (1978) ACM Computing Surveys , vol.10 , Issue.3 , pp. 225-261
    • Denning, P.J.1    Buzen, J.P.2
  • 9
    • 0023293496 scopus 로고
    • Two Classes of Performance Bounds for Closed Queueing Networks
    • C.H. Hsieh and S. Lam, "Two Classes of Performance Bounds for Closed Queueing Networks," Performance Evaluation, vol. 7, no. 1, pp. 3-30, 1987.
    • (1987) Performance Evaluation , vol.7 , Issue.1 , pp. 3-30
    • Hsieh, C.H.1    Lam, S.2
  • 10
    • 0021372966 scopus 로고
    • Throughput Bounds for Closed Queueing Networks
    • J. Kriz, "Throughput Bounds for Closed Queueing Networks," Performance Evaluation, vol. 4, no. 1, pp. 1-10, 1984.
    • (1984) Performance Evaluation , vol.4 , Issue.1 , pp. 1-10
    • Kriz, J.1
  • 12
    • 0020088896 scopus 로고
    • Balanced Job Bound Analysis of Queueing Networks
    • J. Zahorjan, K.C. Sevcik, D.L. Eager, and B. Galler, "Balanced Job Bound Analysis of Queueing Networks," Comm. ACM, vol. 25, no. 2, pp. 134-141, 1982.
    • (1982) Comm. ACM , vol.25 , Issue.2 , pp. 134-141
    • Zahorjan, J.1    Sevcik, K.C.2    Eager, D.L.3    Galler, B.4
  • 13
    • 0030144931 scopus 로고    scopus 로고
    • Analysis of Fork-Join Queueing Networks
    • 96, pp
    • E. Varki and L.W. Dowdy, "Analysis of Fork-Join Queueing Networks," Proc. ACM SIGMETRICS '96, pp. 232-241, 1996.
    • (1996) Proc. ACM SIGMETRICS , pp. 232-241
    • Varki, E.1    Dowdy, L.W.2
  • 15
    • 3042624666 scopus 로고    scopus 로고
    • Issues and Challenges in the Performance Analysis of Real Disk Arrays
    • June
    • E. Varki, A. Merchant, J. Xu, and X. Qiu, "Issues and Challenges in the Performance Analysis of Real Disk Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 6, pp. 559-574, June 2004.
    • (2004) IEEE Trans. Parallel and Distributed Systems , vol.15 , Issue.6 , pp. 559-574
    • Varki, E.1    Merchant, A.2    Xu, J.3    Qiu, X.4
  • 16
  • 17
    • 0032022053 scopus 로고    scopus 로고
    • Computing Performance Bounds of Fork-Join Parallel Programs under a Multiprocessing Environment
    • Mar
    • J.C.S. Lui, R.R. Muntz, and D. Towsley, "Computing Performance Bounds of Fork-Join Parallel Programs under a Multiprocessing Environment," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 295-311, Mar. 1998.
    • (1998) IEEE Trans. Parallel and Distributed Systems , vol.9 , Issue.3 , pp. 295-311
    • Lui, J.C.S.1    Muntz, R.R.2    Towsley, D.3
  • 19
    • 0032631320 scopus 로고    scopus 로고
    • Mean Value Technique for Closed Fork-Join Networks
    • 99, pp
    • E. Varki, "Mean Value Technique for Closed Fork-Join Networks," Proc. ACM SIGMETRICS '99, pp. 103-112, 1999.
    • (1999) Proc. ACM SIGMETRICS , pp. 103-112
    • Varki, E.1
  • 21
    • 0018999918 scopus 로고
    • Mean-Value Analysis of Closed Multichain Queueing Networks
    • M. Reiser and S.S. Lavenberg, "Mean-Value Analysis of Closed Multichain Queueing Networks," J. ACM, vol. 27, no. 2, pp. 312-322, 1980.
    • (1980) J. ACM , vol.27 , Issue.2 , pp. 312-322
    • Reiser, M.1    Lavenberg, S.S.2
  • 23
    • 0022488104 scopus 로고
    • Bound Hierarchies for Multiple-Class Queueing Networks
    • D.L. Eager and K.C. Sevcik, "Bound Hierarchies for Multiple-Class Queueing Networks," J. ACM, vol. 33, no. 1, pp. 179-206, 1986.
    • (1986) J. ACM , vol.33 , Issue.1 , pp. 179-206
    • Eager, D.L.1    Sevcik, K.C.2
  • 24
    • 44049106250 scopus 로고
    • Successively Improving Bounds on Performance Measures for Single Class Product Form Queueing Networks
    • Sept
    • M.M. Srinivasan, "Successively Improving Bounds on Performance Measures for Single Class Product Form Queueing Networks," IEEE Trans. Computers, vol. 36, no. 9, pp. 1107-1112, Sept. 1987.
    • (1987) IEEE Trans. Computers , vol.36 , Issue.9 , pp. 1107-1112
    • Srinivasan, M.M.1
  • 25
    • 0000861722 scopus 로고
    • A Proof of the Queueing Formula L = λW
    • J.D.C. Little, "A Proof of the Queueing Formula L = λW," Operations Research, vol. 9, pp. 383-387, 1961.
    • (1961) Operations Research , vol.9 , pp. 383-387
    • Little, J.D.C.1
  • 27
    • 0030196882 scopus 로고    scopus 로고
    • Asymptotic Analysis of Multiclass Closed Queueing Networks: Common Bottlenecks
    • G. Balbo and G. Serazzi, "Asymptotic Analysis of Multiclass Closed Queueing Networks: Common Bottlenecks," Performance Evaluation, vol. 26, no. 1, pp. 51-72, 1996.
    • (1996) Performance Evaluation , vol.26 , Issue.1 , pp. 51-72
    • Balbo, G.1    Serazzi, G.2
  • 28
    • 0033242756 scopus 로고    scopus 로고
    • Simple Bounds for Closed Queueing Networks
    • A. Harel, S. Namn, and J. Sturm, "Simple Bounds for Closed Queueing Networks," Queueing Systems, vol. 47, no. 1, pp. 125-135, 1999.
    • (1999) Queueing Systems , vol.47 , Issue.1 , pp. 125-135
    • Harel, A.1    Namn, S.2    Sturm, J.3
  • 29
    • 0020192155 scopus 로고
    • On the Asymptotic Behavior of Time-Sharing Systems
    • L. Lipsky, C.H. Lieu, A. Tehranipour, and A. van de Liefvoort, "On the Asymptotic Behavior of Time-Sharing Systems," Comm. ACM, vol. 25, no. 10, pp. 707-714, 1982.
    • (1982) Comm. ACM , vol.25 , Issue.10 , pp. 707-714
    • Lipsky, L.1    Lieu, C.H.2    Tehranipour, A.3    van de Liefvoort, A.4
  • 30
    • 84976719692 scopus 로고
    • Performance Bound Hierarchies for Queueing Networks
    • D.L. Eager and K.C. Sevcik, "Performance Bound Hierarchies for Queueing Networks," ACM Trans. Computer Systems, vol. 1, no. 2, pp. 99-115, 1983.
    • (1983) ACM Trans. Computer Systems , vol.1 , Issue.2 , pp. 99-115
    • Eager, D.L.1    Sevcik, K.C.2
  • 31
    • 0035510536 scopus 로고    scopus 로고
    • Response Time Analysis of Parallel Computer and Storage Systems
    • Nov
    • E. Varki, "Response Time Analysis of Parallel Computer and Storage Systems," IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 11, pp. 1146-1161, Nov. 2001.
    • (2001) IEEE Trans. Parallel and Distributed Systems , vol.12 , Issue.11 , pp. 1146-1161
    • Varki, E.1
  • 35
    • 27144464109 scopus 로고    scopus 로고
    • Parameter Inference of Queueing Models for IT Systems Using End-to-End Measurements
    • Z. Liu, L. Wynter, C.H. Xia, and F. Zhang, "Parameter Inference of Queueing Models for IT Systems Using End-to-End Measurements," Performance Evaluation, vol. 63, no. 1, pp. 36-60, 2006.
    • (2006) Performance Evaluation , vol.63 , Issue.1 , pp. 36-60
    • Liu, Z.1    Wynter, L.2    Xia, C.H.3    Zhang, F.4
  • 36
    • 33750710227 scopus 로고    scopus 로고
    • An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs,
    • RC23771 W0511-023, 2005
    • P. Bonami et al., "An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs," IBM Research Report RC23771 (W0511-023), 2005.
    • IBM Research Report
    • Bonami, P.1
  • 41
    • 41149143274 scopus 로고    scopus 로고
    • Java Modelling Tools: An Open Source Suite for Queueing Network Modelling and Workload Analysis
    • M. Bertoli, G. Casale, and G. Serazzi, "Java Modelling Tools: An Open Source Suite for Queueing Network Modelling and Workload Analysis," Proc. Third Int'l Conf. Quantitative Evaluation of Systems, pp. 119-120, http://jmt.sourceforge.net, 2006.
    • (2006) Proc. Third Int'l Conf. Quantitative Evaluation of Systems , pp. 119-120
    • Bertoli, M.1    Casale, G.2    Serazzi, G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.