메뉴 건너뛰기




Volumn , Issue , 2014, Pages 615-622

Many-core scheduling of data parallel applications using SMT solvers

Author keywords

DMA; Multiprocessor; Scheduling; Task graph

Indexed keywords

BENCHMARKING; COMPUTER ARCHITECTURE; SCHEDULING; SYSTEM-ON-CHIP;

EID: 84928777285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSD.2014.10     Document Type: Conference Paper
Times cited : (16)

References (14)
  • 2
    • 84928780070 scopus 로고    scopus 로고
    • Symmetry breaking for multicriteria mapping and scheduling on multicores
    • P. Tendulkar, P. Poplavko, and O. Maler, "Symmetry breaking for multicriteria mapping and scheduling on multicores," in FORMATS, 2013.
    • (2013) FORMATS
    • Tendulkar, P.1    Poplavko, P.2    Maler, O.3
  • 3
    • 80051988065 scopus 로고    scopus 로고
    • Multi-criteria optimization for mapping programs to multi-processors
    • S. Cotton et al., "Multi-criteria optimization for mapping programs to multi-processors," in SIES, 2011.
    • (2011) SIES
    • Cotton, S.1
  • 5
    • 84893504564 scopus 로고    scopus 로고
    • A clustered manycore processor architecture for embedded and accelerated applications
    • B. de Dinechin et al., "A clustered manycore processor architecture for embedded and accelerated applications," in HPEC, 2013.
    • (2013) HPEC
    • De Dinechin, B.1
  • 6
    • 84863545535 scopus 로고    scopus 로고
    • Platform 2012, a many-core computing accelerator for embedded SoCs: Performance evaluation of visual analytics applications
    • D. Melpignano et al., "Platform 2012, a many-core computing accelerator for embedded SoCs: Performance evaluation of visual analytics applications," in DAC, 2012.
    • (2012) DAC
    • Melpignano, D.1
  • 7
    • 77952123736 scopus 로고    scopus 로고
    • A 48-core ia-32 message-passing processor with dvfs in 45nm cmos
    • J. Howard et al., "A 48-core ia-32 message-passing processor with dvfs in 45nm cmos," in ISSCC, 2010.
    • (2010) ISSCC
    • Howard, J.1
  • 8
    • 84928791127 scopus 로고    scopus 로고
    • Optimizing explicit data transfers for data parallel applications on the cell architecture
    • S. Saidi et al., "Optimizing explicit data transfers for data parallel applications on the cell architecture," ACM TACO, 2012.
    • (2012) ACM TACO
    • Saidi, S.1
  • 10
    • 47249164288 scopus 로고    scopus 로고
    • Z3: An efficient SMT solver
    • L. Moura and N. Bjorner, "Z3: An efficient SMT solver," in TACAS, 2008.
    • (2008) TACAS
    • Moura, L.1    Bjorner, N.2
  • 11
    • 18844419984 scopus 로고    scopus 로고
    • Task-level timing models for guaranteed performance in multiprocessor networks-on-chip
    • P. Poplavko et al., "Task-level timing models for guaranteed performance in multiprocessor networks-on-chip," in CASES, 2003.
    • (2003) CASES
    • Poplavko, P.1
  • 12
    • 84885222079 scopus 로고    scopus 로고
    • A dynamic scratchpad memory unit for predictable real-time embedded systems
    • S. Wasly and R. Pellizzoni, "A dynamic scratchpad memory unit for predictable real-time embedded systems," in ECRTS, 2013.
    • (2013) ECRTS
    • Wasly, S.1    Pellizzoni, R.2
  • 13
    • 79959726381 scopus 로고    scopus 로고
    • Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems
    • W. Liu et al., "Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems," IEEE Transactions on Parallel and Distributed Systems, 2011.
    • (2011) IEEE Transactions on Parallel and Distributed Systems
    • Liu, W.1
  • 14
    • 77951211801 scopus 로고    scopus 로고
    • Constrained global scheduling of streaming applications on mpsocs
    • J. Zhu, I. Sander, and A. Jantsch, "Constrained global scheduling of streaming applications on mpsocs," in ASPDAC, 2010.
    • (2010) ASPDAC
    • Zhu, J.1    Sander, I.2    Jantsch, A.3


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