메뉴 건너뛰기




Volumn 34, Issue 5, 2000, Pages 234-244

Symbiotic jobscheduling for a simultaneous multithreading processor

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0039927463     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384264.379244     Document Type: Article
Times cited : (40)

References (35)
  • 1
    • 0040956571 scopus 로고    scopus 로고
    • http://science.nas.nasa.gov/software/npb.
  • 4
    • 12444286186 scopus 로고    scopus 로고
    • Scheduling with implicit information in distributed systems
    • A. Arpaci-Dusseau, D. Culler, and A. Mainwaring. Scheduling with implicit information in distributed systems. In Sigmetrics, 1998.
    • (1998) Sigmetrics
    • Arpaci-Dusseau, A.1    Culler, D.2    Mainwaring, A.3
  • 7
    • 0005336312 scopus 로고    scopus 로고
    • Distributed and multiprocessor scheduling
    • Mar.
    • S. Chapin. Distributed and multiprocessor scheduling. ACM Computing surveys, Mar. 1996.
    • (1996) ACM Computing Surveys
    • Chapin, S.1
  • 8
    • 0005375655 scopus 로고    scopus 로고
    • Turnaround vs. throughput: Optimal utilization of a multiprocessor system
    • May
    • H. Cofer, N. Camp, and R. Gomperts. Turnaround vs. throughput: Optimal utilization of a multiprocessor system. In SGI Technical Reports, May 1999.
    • (1999) SGI Technical Reports
    • Cofer, H.1    Camp, N.2    Gomperts, R.3
  • 10
    • 0002529086 scopus 로고    scopus 로고
    • Compaq chooses smt for alpha
    • Dec.
    • K. Diefendorff. Compaq chooses smt for alpha. Microprocessor Report, 13(16), Dec. 1999.
    • (1999) Microprocessor Report , vol.13 , Issue.16
    • Diefendorff, K.1
  • 12
    • 0040956568 scopus 로고    scopus 로고
    • The impact of operating scheduling policies and synchronization methods on the performance of parallel applications
    • June
    • A. Gupta, A. Ticker, and S. Urushibara. The impact of operating scheduling policies and synchronization methods on the performance of parallel applications. In Signetrics, pages 392-403, June 1999.
    • (1999) Signetrics , pp. 392-403
    • Gupta, A.1    Ticker, A.2    Urushibara, S.3
  • 14
    • 0026869325 scopus 로고
    • An elementary processor architecture with simultaneous instruction issuing from multiple threads
    • May
    • H. Hirata, K. Kimura, S. Nagamine, Y. Mochizuki, A. Nishimura, Y. Nakase, and T. Nishizawa. An elementary processor architecture with simultaneous instruction issuing from multiple threads. In isca92, pages 136-145, May 1992.
    • (1992) Isca92 , pp. 136-145
    • Hirata, H.1    Kimura, K.2    Nagamine, S.3    Mochizuki, Y.4    Nishimura, A.5    Nakase, Y.6    Nishizawa, T.7
  • 17
    • 0000861722 scopus 로고
    • A simple proof of the queuing formula L = λ W
    • J. Little. A simple proof of the queuing formula L = λ W. Operations Research, 9:383-387, 1961.
    • (1961) Operations Research , vol.9 , pp. 383-387
    • Little, J.1
  • 22
    • 0005259480 scopus 로고    scopus 로고
    • Coscheduling mpi jobs using the spin daemon
    • Nov.
    • S. Sistare, N. Nevin, T. Kimball, and E. Loh. Coscheduling mpi jobs using the spin daemon. In SC 99, Nov. 1999.
    • (1999) SC 99
    • Sistare, S.1    Nevin, N.2    Kimball, T.3    Loh, E.4
  • 26
    • 0001935080 scopus 로고
    • Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors
    • Apr.
    • P. G. Sobalvarro and W. E. Weihl. Demand-based Coscheduling of parallel jobs on multiprogrammed multiprocessors. In IPPS95, pages 63-75, Apr. 1995.
    • (1995) IPPS95 , pp. 63-75
    • Sobalvarro, P.G.1    Weihl, W.E.2
  • 29
    • 0039770228 scopus 로고
    • Benefits of cache-affinity scheduling issues for multiprogrammed shared memory multi-processors
    • May
    • J. Torrelas, A. Tucker, and A. Gupta. Benefits of cache-affinity scheduling issues for multiprogrammed shared memory multi-processors. In 1993 ACM Sigmetrics, May 1993.
    • (1993) 1993 ACM Sigmetrics
    • Torrelas, J.1    Tucker, A.2    Gupta, A.3
  • 30
    • 0024873960 scopus 로고
    • Process control and scheduling issues for multiprogrammed shared memory multiprocessors
    • Dec.
    • A. Tucker and A. Gupta. Process control and scheduling issues for multiprogrammed shared memory multiprocessors. In Symposium on Operating Systems Principals, Dec. 1989.
    • (1989) Symposium on Operating Systems Principals
    • Tucker, A.1    Gupta, A.2
  • 31
    • 0029666641 scopus 로고    scopus 로고
    • Exploiting choice: Instruction fetch and issue on an implementable simultaneous multithreading processor
    • May
    • D. Tullsen, S. Eggers, J. Emer, H. Levy, J. Lo, and R. Stamm. Exploiting choice: Instruction fetch and issue on an implementable simultaneous multithreading processor. In ISCA96, pages 191-202, May 1996.
    • (1996) ISCA96 , pp. 191-202
    • Tullsen, D.1    Eggers, S.2    Emer, J.3    Levy, H.4    Lo, J.5    Stamm, R.6
  • 32
    • 0029183524 scopus 로고
    • Simultaneous multithreading: Maximizing on-chip parallelism
    • June
    • D. Tullsen, S. Eggers, and H. Levy. Simultaneous multithreading: Maximizing on-chip parallelism. In ISCA95, pages 392-403, June 1995.
    • (1995) ISCA95 , pp. 392-403
    • Tullsen, D.1    Eggers, S.2    Levy, H.3
  • 34
    • 84883292871 scopus 로고
    • The implications of cache-affinity on processor scheduling for multiprogrammed, shared memory multiprocessors
    • Oct.
    • R. Vaswani and J. Zahorjan. The implications of cache-affinity on processor scheduling for multiprogrammed, shared memory multiprocessors. In Symposium on Operating Systems Principals, Oct. 1991.
    • (1991) Symposium on Operating Systems Principals
    • Vaswani, R.1    Zahorjan, J.2


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