메뉴 건너뛰기




Volumn 22, Issue 8, 2011, Pages 1382-1389

Satisfiability modulo graph theory for task mapping and scheduling on multiprocessor systems

Author keywords

design space exploration; Multiprocessor; satisfiability; scheduling

Indexed keywords

BRANCH AND BOUNDS; CYCLE ACCURATE; DESIGN SPACE EXPLORATION; DESIGN SPACES; MULTI PROCESSOR SYSTEMS; MULTIPROCESSOR; MULTIPROCESSOR SCHEDULING PROBLEMS; NETWORK ON CHIP; NP-HARD; OPTIMAL SOLUTIONS; OPTIMIZATION FRAMEWORK; PERFORMANCE EVALUATION; PERFORMANCE IMPROVEMENTS; SAT SOLVERS; SATISFIABILITY; SCHEDULING ANALYSIS; SOLUTION SPACE; SYSTEMC; TASK GRAPH SCHEDULING; TASK MAPPING;

EID: 79959726381     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2010.204     Document Type: Article
Times cited : (38)

References (18)
  • 1
    • 84881072062 scopus 로고
    • A computing procedure for quantification theory
    • M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory," J. ACM, vol. 7, no. 3, pp. 201-215, 1960.
    • (1960) J. ACM , vol.7 , Issue.3 , pp. 201-215
    • Davis, M.1    Putnam, H.2
  • 2
    • 84919401135 scopus 로고
    • A machine program for theorem-proving
    • M. Davis, G. Logemann, and D. Loveland, "A Machine Program for Theorem-Proving," J. Comm. ACM, vol. 5, no. 7, pp. 394-397, 1962.
    • (1962) J. Comm. ACM , vol.5 , Issue.7 , pp. 394-397
    • Davis, M.1    Logemann, G.2    Loveland, D.3
  • 3
    • 34548312073 scopus 로고    scopus 로고
    • A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors
    • DOI 10.1109/DATE.2007.364567, 4211772, Proceedings - 2007 Design, Automation and Test in Europe Conference and Exhibition, DATE 2007
    • N. Satish, K. Ravindran, and K. Keutzer, "A Decomposition-Based Constraint Optimization Approach for Statically Scheduling Task Graphs with Communication Delays to Multiprocessors," Proc. Conf. Design, Automation and Test in Europe (DATE '07), pp. 57-62, 2007. (Pubitemid 47333930)
    • (2007) Proceedings -Design, Automation and Test in Europe, DATE , pp. 57-62
    • Satish, N.1    Ravindran, K.2    Keutzer, K.3
  • 4
    • 0031700698 scopus 로고    scopus 로고
    • Benchmarking the task graph scheduling algorithms
    • Y. Kwok and I. Ahmad, "Benchmarking the Task Graph Scheduling Algorithms," Proc. Int'l Parallel Processing Symp., pp. 0531-0537, 1998.
    • (1998) Proc. Int'l Parallel Processing Symp. , pp. 0531-0537
    • Kwok, Y.1    Ahmad, I.2
  • 5
    • 0002050141 scopus 로고    scopus 로고
    • Static scheduling algorithms for allocating directed task graphs to multiprocessors
    • Y.-K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computer Survey, vol. 31, no. 4, pp. 406-471, 1999.
    • (1999) ACM Computer Survey , vol.31 , Issue.4 , pp. 406-471
    • Kwok, Y.-K.1    Ahmad, I.2
  • 8
    • 0027542932 scopus 로고
    • A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
    • Feb.
    • G.C. Sih and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures," IEEE Trans. Parallel Distributed Systems, vol. 4, no. 2, pp. 175-187, Feb. 1993.
    • (1993) IEEE Trans. Parallel Distributed Systems , vol.4 , Issue.2 , pp. 175-187
    • Sih, G.C.1    Lee, E.A.2
  • 9
    • 29144509760 scopus 로고    scopus 로고
    • Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
    • DOI 10.1016/j.cor.2005.01.005, PII S0305054805000055
    • T. Davidović and T.G. Crainic, "Benchmark-Problem Instances for Static Scheduling of Task Graphs with Communication Delays on Homogeneous Multiprocessor Systems," Computers Operations Research, vol. 33, no. 8, pp. 2155-2177, 2006. (Pubitemid 41802283)
    • (2006) Computers and Operations Research , vol.33 , Issue.8 , pp. 2155-2177
    • Davidovic, T.1    Crainic, T.G.2
  • 10
    • 38949184546 scopus 로고    scopus 로고
    • Rtsat-An optimal and efficient approach to the task allocation problem in distributed architectures
    • A. Metzner and C. Herde, "Rtsat-An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures," Proc. 27th IEEE Int'l Real-Time Systems Symp. (RTSS '06), pp. 147-158, 2006.
    • (2006) Proc. 27th IEEE Int'l Real-Time Systems Symp. (RTSS '06) , pp. 147-158
    • Metzner, A.1    Herde, C.2
  • 11
    • 67249149001 scopus 로고    scopus 로고
    • Efficient sat-based mapping and scheduling of homogeneous synchronous dataflow graphs for throughput optimization
    • W. Liu, M. Yuan, X. He, Z. Gu, and X. Liu, "Efficient Sat-Based Mapping and Scheduling of Homogeneous Synchronous Dataflow Graphs for Throughput Optimization," Proc. Real-Time Systems Symp. (RTSS '08), pp. 492-504, 2008.
    • (2008) Proc. Real-Time Systems Symp. (RTSS '08) , pp. 492-504
    • Liu, W.1    Yuan, M.2    He, X.3    Gu, Z.4    Liu, X.5
  • 13
    • 21444441175 scopus 로고    scopus 로고
    • An extensible sat-soler
    • E. Giunchiglia and A. Tacchella, eds., Springer
    • N. Eén and N. Sörensson, "An Extensible Sat-Solver," SAT, E. Giunchiglia and A. Tacchella, eds., pp. 502-518, Springer, 2003.
    • (2003) SAT , pp. 502-518
    • Eén, N.1    Sorensson, N.2
  • 15
    • 0036149420 scopus 로고    scopus 로고
    • Networks on chips: A new SoC paradigm
    • DOI 10.1109/2.976921
    • L. Benini and G. De Micheli, "Networks on Chips: A New Soc Paradigm," Computer, vol. 35, no. 1, pp. 70-78, Jan. 2002. (Pubitemid 34069383)
    • (2002) Computer , vol.35 , Issue.1 , pp. 70-78
    • Benini, L.1    De Micheli, G.2
  • 17
    • 67650485898 scopus 로고    scopus 로고
    • Double-data-rate, wave-pipelined interconnect for asynchronous nocs
    • May/June
    • J. Xu, W. Wolf, and W. Zhang, "Double-Data-Rate, Wave- Pipelined Interconnect for Asynchronous Nocs," IEEE Micro, vol. 29, no. 3, pp. 20-30, May/June 2009.
    • (2009) IEEE Micro , vol.29 , Issue.3 , pp. 20-30
    • Xu, J.1    Wolf, W.2    Zhang, W.3


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