Optimal time and efficient space free scheduling for nested loops

被引：0
|
作者：
Natl Technical Univ of Athens, Athens, Greece [1 ]
机构：
来源：
Comput J | / 5卷 / 439-448期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Optimal time and efficient space free scheduling for nested loops
    Koziris, N
    Papakonstantinou, G
    Tsanakas, P
    COMPUTER JOURNAL, 1996, 39 (05): : 439 - 448
  • [2] Space-Efficient Scheduling of Nested Parallelism
    Carnegie Mellon University, Computer Science Department, 5000 Forbes Avenue, Pittsburgh, PA 15213
    ACM Trans Program Lang Syst, 1 (138-173):
  • [3] Space-efficient scheduling of nested parallelism
    Narlikar, GJ
    Blelloch, GE
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1999, 21 (01): : 138 - 173
  • [4] Free scheduling for statement instances of parameterized arbitrarily nested affine loops
    Bielecki, Wlodzimierz
    Palkowski, Marek
    Klimek, Tomasz
    PARALLEL COMPUTING, 2012, 38 (09) : 518 - 532
  • [5] Feedback guided scheduling of nested loops
    Freeman, TL
    Hancock, DJ
    Bull, JM
    Ford, RW
    APPLIED PARALLEL COMPUTING, PROCEEDINGS: NEW PARADIGMS FOR HPC IN INDUSTRY AND ACADEMIA, 2001, 1947 : 149 - 159
  • [6] Space and time efficient lottery scheduling
    Pittman, D
    Edwards, D
    CDES '05: Proceedings of the 2005 International Conference on Computer Design, 2005, : 185 - 190
  • [7] A BSP approach to the scheduling of tightly-nested loops
    Calinescu, R
    11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 549 - 553
  • [8] An investigation of feedback guided dynamic scheduling of nested loops
    Hancock, DJ
    Bull, JM
    Ford, RW
    Freeman, TL
    2000 INTERNATIONAL WORKSHOPS ON PARALLEL PROCESSING, PROCEEDINGS, 2000, : 315 - 321
  • [9] Generation of efficient nested loops from polyhedra
    Quilleré, F
    Rajopadhye, S
    Wilde, D
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2000, 28 (05) : 469 - 498
  • [10] Generation of Efficient Nested Loops from Polyhedra
    Fabien Quilleré
    Sanjay Rajopadhye
    Doran Wilde
    International Journal of Parallel Programming, 2000, 28 : 469 - 498
12345