Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Instruction Selection and Scheduling for DSP Kernels

Författare

  • Mehmet Ali Arslan
  • Krzysztof Kuchcinski

Summary, in English

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 modelling, while state-of-the-art constraint solvers enable optimal solutions for large problems, hinting a new method for code generation.

Publiceringsår

2014

Språk

Engelska

Sidor

803-813

Publikation/Tidskrift/Serie

Microprocessors and Microsystems

Volym

38

Issue

8

Dokumenttyp

Artikel i tidskrift

Förlag

Elsevier

Ämne

  • Computer Science

Nyckelord

  • Instruction selection
  • Scheduling
  • Custom architecture
  • VLIW
  • Constraint programming

Status

Published

Projekt

  • High Performance Embedded Computing

Forskningsgrupp

  • ESDLAB

ISBN/ISSN/Övrigt

  • ISSN: 0141-9331