메뉴 건너뛰기




Volumn 12, Issue 5, 2001, Pages 645-669

On dynamic task scheduling for fpga-based systems

Author keywords

dynamic allocation; dynamic reconfiguration; FPGA; partitionable array; scheduling complexity; scheduling heuristic; task rearrangement; task scheduling

Indexed keywords


EID: 12444256382     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054101000709     Document Type: Article
Times cited : (10)

References (11)
  • 3
    • 0002528075 scopus 로고
    • Approximation algorithms for bin-packing - An updated survey
    • eds. G. Ausiello, M. Lucertini, and P. Serafmi (Springer, Vienna
    • E. G. Coffman Jr., M. R. Garey, and D. S. Johnson, "Approximation algorithms for bin-packing - an updated survey," in Algorithm Design for Computer System Design, eds. G. Ausiello, M. Lucertini, and P. Serafmi (Springer, Vienna, 1984) pp. 49 - 106.
    • (1984) Algorithm Design for Computer System Design , pp. 49-106
    • Coffman Jr., E.G.1    Garey, M.R.2    Johnson, D.S.3
  • 6
    • 0021644214 scopus 로고
    • The quadtree and related hierarchical data structures
    • H. Samet, "The quadtree and related hierarchical data structures," ACM Comput. Surv. 16 (1984) 187 - 260.
    • (1984) ACM Comput. Surv. , vol.16 , pp. 187-260
    • Samet, H.1
  • 7
    • 0018985279 scopus 로고
    • A 2.5 times optimal algorithm for packing in two dimensions
    • D. D. K. D. B. Sleator, "A 2.5 times optimal algorithm for packing in two dimensions," Inf. Process. Lett. 10 (1980) 37 - 40.
    • (1980) Inf. Process. Lett. , vol.10 , pp. 37-40
    • Sleator, D.D.K.D.B.1
  • 8
    • 0026904371 scopus 로고
    • A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
    • A. P. Sprague. "A parallel algorithm to construct a dominance graph on nonoverlapping rectangles," Int. J. Parallel Program. 21 (1992) 303 - 312.
    • (1992) Int. J. Parallel Program. , vol.21 , pp. 303-312
    • Sprague, A.P.1
  • 10
    • 38249008248 scopus 로고
    • Efficient processor allocation strategies for mesh-connected parallel computers
    • Y. Zhu, "Efficient processor allocation strategies for mesh-connected parallel computers," J. Parallel Distrib. Comput. 16 (1992) 328 - 337.
    • (1992) J. Parallel Distrib. Comput. , vol.16 , pp. 328-337
    • Zhu, Y.1
  • 11
    • 0030104973 scopus 로고    scopus 로고
    • Fast processor allocation and dynamic scheduling for mesh multiprocessors
    • Y. Zhu, "Fast processor allocation and dynamic scheduling for mesh multiprocessors," Comput. Syst. Sci. Eng. 11 (1996) 99 - 107.
    • (1996) Comput. Syst. Sci. Eng. , vol.11 , pp. 99-107
    • Zhu, Y.1


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