메뉴 건너뛰기




Volumn 1, Issue 3, 1990, Pages 257-270

Predicting Performance of Parallel Computations

Author keywords

Concurrent systems; parallel processing; performance modeling; performance prediction; queueing networks; task systems

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTERS, DIGITAL--PERFORMANCE;

EID: 0025463265     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.80155     Document Type: Article
Times cited : (74)

References (20)
  • 1
    • 0020205464 scopus 로고
    • Queueing network models for parallel processing with asynchronous tasks
    • Nov.
    • P. Heidelberger and K. S. Trivedi, “Queueing network models for parallel processing with asynchronous tasks,” IEEE Trans. Comput., vol. C-31, pp. 1099-1109, Nov. 1982.
    • (1982) IEEE Trans. Comput. , vol.C-31 , pp. 1099-1109
    • Heidelberger, P.1    Trivedi, K.S.2
  • 2
    • 0020543228 scopus 로고
    • Analytic queueing models for programs with internal concurrency
    • Jan.
    • P. Heidelberger and K. S. Trivedi, “Analytic queueing models for programs with internal concurrency,” IEEE Trans. Comput., vol. C-32, pp. 73-82, Jan. 1983.
    • (1983) IEEE Trans. Comput. , vol.C-32 , pp. 73-82
    • Heidelberger, P.1    Trivedi, K.S.2
  • 3
    • 0020498429 scopus 로고
    • Queueing network models for parallel processing of task systems
    • H. Siegel and L. Siegel, Eds., IEEE
    • A. Thomasian and P. Bay, “Queueing network models for parallel processing of task systems,” in Proc. 1983 Int. Conf. Parallel Processing, H. Siegel and L. Siegel, Eds., IEEE, 1983, pp. 421-428.
    • (1983) Proc. 1983 Int. Conf. Parallel Processing , pp. 421-428
    • Thomasian, A.1    Bay, P.2
  • 4
    • 0022895657 scopus 로고
    • Analytic queueing network models for parallel processing of task systems
    • Dec.
    • A. Thomasian and P. Bay, “Analytic queueing network models for parallel processing of task systems,” IEEE Trans. Comput., vol. C-35, pp. 1045-1054, Dec. 1986.
    • (1986) IEEE Trans. Comput. , vol.C-35 , pp. 1045-1054
    • Thomasian, A.1    Bay, P.2
  • 6
    • 0003750424 scopus 로고
    • Performance of parallel programs: Model and analyses
    • Ph.D. dissertation, Carnegie-Melon Univ., July
    • J. Mohan, “Performance of parallel programs: Model and analyses,” Ph.D. dissertation, Carnegie-Melon Univ., July 1984.
    • (1984)
    • Mohan, J.1
  • 7
    • 0014928697 scopus 로고    scopus 로고
    • The PMS and ISP descriptive systems for computer structures
    • C. G. Bell and A. Newell, “The PMS and ISP descriptive systems for computer structures,” in AFIPS Conf. Proc. SJCC, 1970, pp. 351-374.
    • AFIPS Conf. Proc. SJCC , vol.1970 , pp. 351-374
    • Bell, C.G.1    Newell, A.2
  • 8
    • 0015401565 scopus 로고
    • Some computer organizations and their effectiveness
    • Sept.
    • M. J. Flynn, “Some computer organizations and their effectiveness,” IEEE Trans. Comput., vol. C-21, pp. 948-960, Sept. 1972.
    • (1972) IEEE Trans. Comput. , vol.C-21 , pp. 948-960
    • Flynn, M.J.1
  • 9
    • 0018005391 scopus 로고
    • Communicating sequential processes
    • Aug.
    • C. A. R. Hoare, “Communicating sequential processes,” Commun. ACM, vol. 21, pp. 666-677, Aug. 1978.
    • (1978) Commun. ACM , vol.21 , pp. 666-677
    • Hoare, C.A.R.1
  • 10
    • 84970096793 scopus 로고
    • A survey of some theoretical aspects of multiprocessing
    • Mar.
    • J. L. Baer, “A survey of some theoretical aspects of multiprocessing,” ACM Comput. Surveys, vol. 5, pp. 31-80, Mar. 1983.
    • (1983) ACM Comput. Surveys , vol.5 , pp. 31-80
    • Baer, J.L.1
  • 11
    • 33749974205 scopus 로고
    • Performance prediction of concurrent systems
    • Comput. Syst. Lab., Stanford Univ., Dec.
    • V. W. Mak, “Performance prediction of concurrent systems,” Tech. Rep. CSL-TR-87-344, Comput. Syst. Lab., Stanford Univ., Dec. 1987.
    • (1987) Tech. Rep. CSL-TR-87-344
    • Mak, V.W.1
  • 12
    • 0019709055 scopus 로고
    • Approximating response time distributions in closed queueing network models of computer performance
    • F. J. Kylstra, Ed. Amsterdam
    • S. Salza and S. S. Lavenberg, “Approximating response time distributions in closed queueing network models of computer performance,” in Performance ‘81, F. J. Kylstra, Ed. Amsterdam, 1981, pp. 133-145.
    • (1981) Performance ‘81 , pp. 133-145
    • Salza, S.1    Lavenberg, S.S.2
  • 14
    • 0018999918 scopus 로고
    • Mean value analysis of closed multichain queueing networks
    • Apr.
    • M. Reiser and S. Lavenberg, “Mean value analysis of closed multichain queueing networks,” J. ACM, vol. 27, pp. 313-322, Apr. 1980.
    • (1980) J. ACM , vol.27 , pp. 313-322
    • Reiser, M.1    Lavenberg, S.2
  • 15
    • 0019552964 scopus 로고
    • The distribution of queueing network states at input and output instants
    • Apr.
    • K. C. Sevcik and I. Mitrani, “The distribution of queueing network states at input and output instants,” J. ACM, vol. 28, pp. 358-371, Apr. 1981.
    • (1981) J. ACM , vol.28 , pp. 358-371
    • Sevcik, K.C.1    Mitrani, I.2
  • 16
    • 0000924697 scopus 로고
    • Stationary state probabilities of arrival instants for closed queueing networks with multiple types of customers
    • Dec.
    • S. S. Lavenberg and M. Reiser, “Stationary state probabilities of arrival instants for closed queueing networks with multiple types of customers,” J. Appl. Probability, vol. 17, pp. 1048-1061, Dec. 1980.
    • (1980) J. Appl. Probability , vol.17 , pp. 1048-1061
    • Lavenberg, S.S.1    Reiser, M.2
  • 17
    • 0004357655 scopus 로고
    • The approximate solution of large queueing network models
    • Ph.D. dissertation, Dep. Comput. Sci., Univ. of Toronto, Toronto, Canada, Aug.
    • J. Zahorjan, “The approximate solution of large queueing network models,” Ph.D. dissertation, Dep. Comput. Sci., Univ. of Toronto, Toronto, Canada, Aug. 1980.
    • (1980)
    • Zahorjan, J.1
  • 18
    • 0000861722 scopus 로고
    • A proof of the queueing formula L = δW
    • J. Little, “A proof of the queueing formula L = δW,” Oper. Res., vol. 9, pp. 383-387, 1961.
    • (1961) Oper. Res. , vol.9 , pp. 383-387
    • Little, J.1
  • 19
    • 0022893379 scopus 로고
    • CSIM: A C-based, process-oriented simulation language
    • Washington, DC, Dec.
    • H. Schwetman, “CSIM: A C-based, process-oriented simulation language,” in Proc. Winter Simulation Conf. ‘86, Washington, DC, Dec. 1986.
    • (1986) Proc. Winter Simulation Conf. ‘86
    • Schwetman, H.1
  • 20
    • 0018012356 scopus 로고
    • The operational analysis of queueing network models
    • Sept.
    • P. J. Denning and J. P. Buzen, “The operational analysis of queueing network models,” Comput. Surveys, vol. 10, pp. 225-261, Sept. 1978.
    • (1978) Comput. Surveys , vol.10 , pp. 225-261
    • Denning, P.J.1    Buzen, J.P.2


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