Mapping streaming applications on multiprocessors with time-division-multiplexed network-on-chip

Summary, in English

Abstract As custom multicore architectures become more and more common for DSP applications, instruction selection and scheduling for such applications and architectures become important topics. In this paper, we explore the effects of defining the problem of finding an optimal instruction selection and scheduling as a constraint satisfaction problem (CSP). We incorporate methods based on sub-graph isomorphism and global constraints designed for scheduling. We experiment using several media applications on a custom architecture, a generic VLIW architecture and a RISC architecture, all three with several cores. Our results show that defining the problem with constraints gives flexibility in modeling, while state-of-the-art constraint solvers enable optimal solutions for large problems, hinting a new method for code generation.

• Författare: Usman Mazhar Mirza; Flavius Gruian; Krzysztof Kuchcinski
• Avdelning/ar: Institutionen för datavetenskap; ELLIIT: the Linköping-Lund initiative on IT and mobile communication; Parallella System
• Publiceringsår: 2014
• Språk: Engelska
• Sidor: 276-291
• Publikation/Tidskrift/Serie: Computers & Electrical Engineering
• Volym: 40
• Issue: 8
• Länkar: http://dx.doi.org/10.1016/j.compeleceng.2014.08.015
• Dokumenttyp: Artikel i tidskrift
• Förlag: Elsevier
• Ämne: Computer Science
• Status: Published
• Projekt: High Performance Embedded Computing
• Forskningsgrupp: ESDLAB
• ISBN/ISSN/Övrigt: ISSN: 1879-0755