메뉴 건너뛰기




Volumn , Issue , 2005, Pages 540-545

A low complex scheduling algorithm for multi-processor system-on-chip

Author keywords

Distributed architectures; Hardware implementation; Multiprocessing; Scheduling; Task allocation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; SCHEDULING;

EID: 27944496025     PISSN: 10272666     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (22)
  • 1
    • 84970096793 scopus 로고
    • A survey of some theoretical aspects of multiprocessing
    • Mar.
    • J. L. Baer. A Survey of Some Theoretical Aspects of Multiprocessing. ACM Computing Surveys, 5(1):31-80, Mar. 1973.
    • (1973) ACM Computing Surveys , vol.5 , Issue.1 , pp. 31-80
    • Baer, J.L.1
  • 2
    • 0000977860 scopus 로고
    • A 5/4 algorithm for two-dimensional packing
    • June
    • B. S. Baker, D. J. Brown, and H. P. Katseff. A 5/4 Algorithm for Two-Dimensional Packing. Journal of Algorithms, 2(4):348-368, June 1981.
    • (1981) Journal of Algorithms , vol.2 , Issue.4 , pp. 348-368
    • Baker, B.S.1    Brown, D.J.2    Katseff, H.P.3
  • 4
    • 0022717856 scopus 로고
    • Scheduling multiprocessor tasks to minimize schedule length
    • May
    • J. Blazewicz, M. Drabowski, and Weglarz. Scheduling Multiprocessor Tasks to Minimize Schedule Length. IEEE Transactions on Computers, 35(5):389-393, May 1986.
    • (1986) IEEE Transactions on Computers , vol.35 , Issue.5 , pp. 389-393
    • Blazewicz, J.1    Drabowski, M.2    Weglarz3
  • 5
    • 0000586245 scopus 로고
    • Performance bounds for level-oriented two-dimensional packing algorithms
    • Nov.
    • E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Computing, 9(4):808-826, Nov. 1980.
    • (1980) SIAM J. Computing , vol.9 , Issue.4 , pp. 808-826
    • Coffman, E.G.1    Garey, M.R.2    Johnson, D.S.3    Tarjan, R.E.4
  • 9
    • 0032650091 scopus 로고    scopus 로고
    • Improved approximation schemes for scheduling unrelated parallel machines
    • Atlanta, USA, May
    • K. Jansen and L. Porkolab. Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. In Annual ACM Symposium on Theory of Computing (STOC), Atlanta, USA, May 1999.
    • (1999) Annual ACM Symposium on Theory of Computing (STOC)
    • Jansen, K.1    Porkolab, L.2
  • 10
    • 0012533991 scopus 로고    scopus 로고
    • Linear-time approximation schemes for scheduling malleable parallel tasks
    • K. Jansen and L. Porkolab. Linear-time Approximation Schemes for Scheduling Malleable Parallel Tasks. Algorithmica, 32(3):507-520, 2002.
    • (2002) Algorithmica , vol.32 , Issue.3 , pp. 507-520
    • Jansen, K.1    Porkolab, L.2
  • 11
    • 0002050141 scopus 로고    scopus 로고
    • Static scheduling algorithms for allocating directed task graphs to multiprocessors
    • Dec.
    • Y.-K. Kwok and I. Ahmad. Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, 31(4):406-471, Dec. 1999.
    • (1999) ACM Computing Surveys , vol.31 , Issue.4 , pp. 406-471
    • Kwok, Y.-K.1    Ahmad, I.2
  • 13
    • 0034291644 scopus 로고    scopus 로고
    • Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
    • Oct.
    • K. Li and Y. Pan. Probabilistic Analysis of Scheduling Precedence Constrained Parallel Tasks on Multicomputers with Contiguous Processor Allocation. IEEE Transactions on Computer, 49(10):1021-1030, Oct. 2000.
    • (2000) IEEE Transactions on Computer , vol.49 , Issue.10 , pp. 1021-1030
    • Li, K.1    Pan, Y.2
  • 14
    • 0030645587 scopus 로고    scopus 로고
    • A comparison of general approaches to multiprocessor scheduling
    • Geneva, Switzerland, Apr.
    • J. Liou and M. A. Palis. A Comparison of General Approaches to Multiprocessor Scheduling. In International Parallel Processing Symposium (IPPS), Geneva, Switzerland, Apr. 1997.
    • (1997) International Parallel Processing Symposium (IPPS)
    • Liou, J.1    Palis, M.A.2
  • 15
    • 84949502106 scopus 로고    scopus 로고
    • A scalable task duplication based scheduling algorithm for heterogeneous systems
    • Toronto, Canada, Aug.
    • S. Ranaweera and D. Agrawal. A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems. In International Conference on Parallel Processing, pages 383-390, Toronto, Canada, Aug. 2000.
    • (2000) International Conference on Parallel Processing , pp. 383-390
    • Ranaweera, S.1    Agrawal, D.2
  • 16
    • 0018985279 scopus 로고
    • A 2.5 times optimal algorithm for packing in two dimensions
    • Feb.
    • D. Sleator. A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. Information Processing Letters, 10(1):37-40, Feb. 1980.
    • (1980) Information Processing Letters , vol.10 , Issue.1 , pp. 37-40
    • Sleator, D.1
  • 17
    • 0032591263 scopus 로고    scopus 로고
    • A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems
    • San Juan, Puerto Rico, Apr.
    • T.D. Braun et al. A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems. In Heterogeneous Computing Workshop, San Juan, Puerto Rico, Apr. 1999.
    • (1999) Heterogeneous Computing Workshop
    • Braun, T.D.1
  • 18
    • 0036504666 scopus 로고    scopus 로고
    • Performance-effective and low-complexity task scheduling for heterogeneous computing
    • Mar.
    • H. Topcuoglu, S. Hariri, and M.-Y. Wu. Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, Mar. 2002.
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.3 , pp. 260-274
    • Topcuoglu, H.1    Hariri, S.2    Wu, M.-Y.3
  • 21
    • 0003163669 scopus 로고    scopus 로고
    • Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach
    • Nov.
    • L. Wang, H. Siegel, V. Roychowdhury, and A. Maciejewski. Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. Journal of Parallel and Distributed Computing, 47(1):1-15, Nov. 1997.
    • (1997) Journal of Parallel and Distributed Computing , vol.47 , Issue.1 , pp. 1-15
    • Wang, L.1    Siegel, H.2    Roychowdhury, V.3    Maciejewski, A.4


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