Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

The paper analyses computational model based on dynamic programming for platforms with multicore processors and heterogeneous architectures with FPGA. The models are applied for solving a canonical problem of dispatching where the computation time significantly depends on the problem scale factor. T...

Celý popis

Podrobná bibliografia

Vydané v:	2017 Internet Technologies and Applications (ITA) s. 181 - 184
Hlavní autori:	Fedosenko, Yuriy S., Reznikov, Mikhail B., Plekhov, Aleksandr S., Chakirov, Roustiam, Houlden, Nigel
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.2017
Predmet:	calculations modeling Computational modeling discrete optimisation Dispatching dispatching problem Dynamic programming Field programmable gate arrays Graphics processing units massively parallel calculations Random access memory
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!