About: Deadline Constrained Cyclic Scheduling on Pipelined Dedicated Processors Considering Multiprocessor Tasks and Changeover Times     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Tento článek se zabývá rozvrhováním výpočetních smyček prováděných na HW architekturách obsahující pipelinované dedikované jednotky (např. FPGA). Problém je řešen pomocí celočíselného lineárního programování a výsledky jsou ukázány jak na standardních testovacích instancích, tak i vybrané aplikaci. (cs)
  • This paper presents a scheduling technique used to optimize computation speed of loops running on architectures that may include pipelined dedicated processors. The problem under consideration is to find an optimal periodic schedule satisfying the timing constraints. Motivated by FPGA (Field-Programmable Gate Array) architecture we formulate a problem of cyclic scheduling on one dedicated processor where tasks are constrained by the precedence delays. Further we generalize this result to the set of dedicated processors. We also show how the set of constraints in both problems can be extended by start time related deadlines, multiprocessor tasks, changeover times and minimization of data transfers. We prove that this problem is NP-hard by reduction from Bratley's scheduling problem 1|rj,~dj|Cmax and we suggest a solution based on ILP (Integer Linear Programming) that allows one to minimize the completion time.
  • This paper presents a scheduling technique used to optimize computation speed of loops running on architectures that may include pipelined dedicated processors. The problem under consideration is to find an optimal periodic schedule satisfying the timing constraints. Motivated by FPGA (Field-Programmable Gate Array) architecture we formulate a problem of cyclic scheduling on one dedicated processor where tasks are constrained by the precedence delays. Further we generalize this result to the set of dedicated processors. We also show how the set of constraints in both problems can be extended by start time related deadlines, multiprocessor tasks, changeover times and minimization of data transfers. We prove that this problem is NP-hard by reduction from Bratley's scheduling problem 1|rj,~dj|Cmax and we suggest a solution based on ILP (Integer Linear Programming) that allows one to minimize the completion time. (en)
Title
  • Deadline Constrained Cyclic Scheduling on Pipelined Dedicated Processors Considering Multiprocessor Tasks and Changeover Times
  • Deadline Constrained Cyclic Scheduling on Pipelined Dedicated Processors Considering Multiprocessor Tasks and Changeover Times (en)
  • Cyklické rozvrhování na dedikovaných procesorech uvažující multiprocesorové úlohy a časy na změnu nastavení procesoru (cs)
skos:prefLabel
  • Deadline Constrained Cyclic Scheduling on Pipelined Dedicated Processors Considering Multiprocessor Tasks and Changeover Times
  • Deadline Constrained Cyclic Scheduling on Pipelined Dedicated Processors Considering Multiprocessor Tasks and Changeover Times (en)
  • Cyklické rozvrhování na dedikovaných procesorech uvažující multiprocesorové úlohy a časy na změnu nastavení procesoru (cs)
skos:notation
  • RIV/68407700:21230/08:03142089!RIV09-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6840770038)
http://linked.open...iv/cisloPeriodika
  • 9-10
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 362240
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/08:03142089
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Changeover times; FPGA; High-level synthesis; Integer linear programming (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [A45E41EB2376]
http://linked.open...i/riv/nazevZdroje
  • Mathematical and Computer Modelling
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 47
http://linked.open...iv/tvurceVysledku
  • Hanzálek, Zdeněk
  • Šůcha, Přemysl
http://linked.open...ain/vavai/riv/wos
  • 000255511900011
http://linked.open...n/vavai/riv/zamer
issn
  • 0895-7177
number of pages
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software