메뉴 건너뛰기




Volumn 29, Issue 4, 1993, Pages 1216-1221

Processor Equivalence for Daisy Chain Load Sharing Processors

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; IMAGE PROCESSING; KALMAN FILTERING; SIGNAL PROCESSING;

EID: 0027677172     PISSN: 00189251     EISSN: None     Source Type: Journal    
DOI: 10.1109/7.259524     Document Type: Article
Times cited : (63)

References (24)
  • 5
    • 0024646082 scopus 로고
    • Minimizing schedule length subject to minimum flow time
    • (Apr. 1989)
    • Leung, J. Y.-T., and Young, G. H. (1989) Minimizing schedule length subject to minimum flow time. SLAM Journal on Computing, 18 (Apr. 1989), 314–326.
    • (1989) SLAM Journal on Computing , vol.18 , pp. 314-326
    • Leung, J.Y.-T.1    Young, G.H.2
  • 6
    • 0001923235 scopus 로고
    • An application of bin packing to multiprocessor scheduling
    • (Feb. 1978)
    • Coffman, Jr., E. G., Gavey, M. R., and Johnson, D. S. (1978) An application of bin packing to multiprocessor scheduling. SIAM Journal on Computing, 7 (Feb. 1978).
    • (1978) SIAM Journal on Computing , vol.7
    • Coffman, E.G.1    Gavey, M.R.2    Johnson, D.S.3
  • 7
    • 0016873384 scopus 로고
    • Algorithms minimizing mean flow time: Schedule length properties
    • 1976
    • Coffman, Jr., E. G., and Sethi, R. (1976) Algorithms minimizing mean flow time: Schedule length properties. Acta Informatica, 6 (1976), 1–14.
    • (1976) Acta Informatica , vol.6 , pp. 1-14
    • Coffman, E.G.1    Sethi, R.2
  • 14
    • 0024714108 scopus 로고
    • GAMMON: A load balancing strategy for local computer systems with multiaccess networks
    • (Aug. 1989)
    • Baumgartner, K. M., and Wah, B. W. (1989) GAMMON: A load balancing strategy for local computer systems with multiaccess networks. IEEE Transactions on Computers, C-38 (Aug. 1989), 1098–1109.
    • (1989) IEEE Transactions on Computers , vol.C-38 , pp. 1098-1109
    • Baumgartner, K.M.1    Wah, B.W.2
  • 16
    • 0024106885 scopus 로고
    • Heuristic algorithms for task assignment in distributed systems
    • (Nov. 1988)
    • Lo, V. M. (1988) Heuristic algorithms for task assignment in distributed systems. IEEE Transactions on Computers, C-37 (Nov. 1988), 1384–1397.
    • (1988) IEEE Transactions on Computers , vol.C-37 , pp. 1384-1397
    • Lo, V.M.1
  • 17
    • 0024716426 scopus 로고
    • Distributed scheduling of tasks with deadlines and resource requirements
    • (Aug. 1989)
    • Ramamritham, K., Stankovic, J. A., and Zhao, W. (1989) Distributed scheduling of tasks with deadlines and resource requirements. IEEE Transactions on Computers, C-38 (Aug. 1989), 1110–1122.
    • (1989) IEEE Transactions on Computers , vol.C-38 , pp. 1110-1122
    • Ramamritham, K.1    Stankovic, J.A.2    Zhao, W.3
  • 18
    • 0024716085 scopus 로고
    • Load sharing in distributed real-time systems with state change broadcasts
    • (Aug. 1989)
    • Shin, K. G., and Chang, Y.-C. (1989) Load sharing in distributed real-time systems with state change broadcasts. IEEE Transactions on Computers, C-38 (Aug. 1989), 1124–1142.
    • (1989) IEEE Transactions on Computers , vol.C-38 , pp. 1124-1142
    • Shin, K.G.1    Chang, Y.-C.2
  • 19
    • 0017417984 scopus 로고
    • Multiprocessor scheduling with the aid of network flow algorithms
    • (Jan. 1977)
    • Stone, H. S. (1977) Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering, SE-3 (Jan. 1977), 85–93.
    • (1977) IEEE Transactions on Software Engineering , vol.SE-3 , pp. 85-93
    • Stone, H.S.1
  • 21
    • 0022054806 scopus 로고
    • Optimal load balancing in a multiple processor system with many job classes
    • (May 1985)
    • Ni, L. M, and Hwang, K. (1985) Optimal load balancing in a multiple processor system with many job classes. IEEE Transactions on Software Engineering, SE-11 (May 1985), 491–496.
    • (1985) IEEE Transactions on Software Engineering , vol.SE-11 , pp. 491-496
    • Ni, L.M.1    Hwang, K.2
  • 22
    • 0001021215 scopus 로고
    • Complexity of scheduling parallel task systems
    • (Nov. 1989)
    • Du, J., and Leung, J. Y.-T. (1989) Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics, 2 (Nov. 1989), 473–487.
    • (1989) SIAM Journal on Discrete Mathematics , vol.2 , pp. 473-487
    • Du, J.1    Leung, J.Y.-T.2
  • 23
    • 0022717856 scopus 로고
    • Scheduling multiprocessor tasks to minimize schedule length
    • (May 1986)
    • Blazewicz, J., Drabowski, M., and Weglarz, J. (1986) Scheduling multiprocessor tasks to minimize schedule length. IEEE Transactions on Computers, C-35 (May 1986), 389-393.
    • (1986) IEEE Transactions on Computers , vol.C-35 , pp. 389-393
    • Blazewicz, J.1    Drabowski, M.2    Weglarz, J.3
  • 24
    • 0023401687 scopus 로고
    • Preemptive scheduling under time and resource constraints
    • (Aug. 1987)
    • Zhao, W., Ramamritham, K., and Stankovic, J. A. (1987) Preemptive scheduling under time and resource constraints. IEEE Transactwns on Computers, C-36 (Aug. 1987), 949-960.
    • (1987) IEEE Transactwns on Computers , vol.C-36 , pp. 949-960
    • Zhao, W.1    Ramamritham, K.2    Stankovic, J.A.3


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