메뉴 건너뛰기




Volumn , Issue , 2003, Pages

One-step algorithm for mixed data and task parallel scheduling without data replication

Author keywords

Mixed parallelism; Ressource allocation; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED PARAMETER NETWORKS; SCHEDULING;

EID: 84947212025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213127     Document Type: Conference Paper
Times cited : (20)

References (14)
  • 2
    • 0032121299 scopus 로고    scopus 로고
    • Approaches for integrating task and data parallelism
    • H. Bal and M. Haines. Approaches for Integrating Task and Data Parallelism. IEEE Concurrency, 6(3):74-84, 1998.
    • (1998) IEEE Concurrency , vol.6 , Issue.3 , pp. 74-84
    • Bal, H.1    Haines, M.2
  • 4
    • 0029701029 scopus 로고    scopus 로고
    • Integrating task and data parallelism using shared objects
    • ACM Press
    • S. Ben Hassen and H. Bal. Integrating Task and Data Parallelism Using Shared Objects. In Proc. of the 10th Conf. on Supercomputing, pages 317-324. ACM Press, 1996.
    • (1996) Proc. of the 10th Conf. on Supercomputing , pp. 317-324
    • Ben Hassen, S.1    Bal, H.2
  • 12
    • 0032662049 scopus 로고    scopus 로고
    • Compiler support for task scheduling in hierarchical execution models
    • T. Rauber and G. Rünger. Compiler Support for Task Scheduling in Hierarchical Execution Models. Journal of Systems Architecture, 45:483-503, 1998.
    • (1998) Journal of Systems Architecture , vol.45 , pp. 483-503
    • Rauber, T.1    Rünger, G.2


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