A cyclic scheduling problem with an undetermined number of parallel identical processors
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00157624" target="_blank" >RIV/68407700:21230/11:00157624 - isvavai.cz</a>
Alternative codes found
RIV/26074699:_____/11:#0000011
Result on the web
<a href="http://www.springerlink.com/content/g3011566831157l8/" target="_blank" >http://www.springerlink.com/content/g3011566831157l8/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10589-009-9239-4" target="_blank" >10.1007/s10589-009-9239-4</a>
Alternative languages
Result language
angličtina
Original language name
A cyclic scheduling problem with an undetermined number of parallel identical processors
Original language description
This paper presents two integer linear programming (ILP) models for cyclic scheduling of tasks with unit/general processing time. Our work is motivated by digital signal processing (DSP) applications on FPGAs (Field-Programmable Gate Arrays)-hardware architectures hosting several sets of identical arithmetic units. These hardware units can be formalized as dedicated sets of parallel identical processors. We propose a method to find an optimal periodic schedule of DSP algorithms on such architectures where the number of available arithmetic units must be determined during scheduling with respect to the capacity of the FPGA circuit. The emphasis is put on the efficiency of the ILP models. We show the advantages of our models in comparison with common ILPmodels on benchmarks and randomly generated instances.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/2C06017" target="_blank" >2C06017: An Internet Platform and Algorithms for Timetabling and Optimization</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Computational Optimization and Applications
ISSN
0926-6003
e-ISSN
—
Volume of the periodical
48
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
20
Pages from-to
71-90
UT code for WoS article
000286717700005
EID of the result in the Scopus database
—