Skip to main content

A Model of FPGA Massively Parallel Calculations for Hard Problem of Scheduling in Transportation Systems

  • Conference paper
  • First Online:
Book cover Learning and Intelligent Optimization (LION 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10556))

Included in the following conference series:

  • 1033 Accesses

Abstract

The FPGA calculation hardware was estimated in terms of performance of solving a hard nonlinear discrete optimization problem of scheduling in transportation systems. The dynamic programming algorithm for a large-scale problem is considered and a model of its decomposition into a set of smaller problems is investigated.

The reported study was funded by RFBR according to the research project № 18-07-01078a.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kogan, D.I., Fedosenko, Yu.S.: Optimal servicing strategy design problems for stationary objects in a one-dimensional working zone of a processor. Autom. Remote Control 71(10), 2058–2069 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kogan, D.I., Fedosenko, Yu.S.: The discretization problem: analysis of computational complexity, and polynomially solvable subclasses. Discrete Math. Appl. 6(5), 435–447 (1996)

    Article  MathSciNet  Google Scholar 

  3. Sammarra, M., Cordeau, J.-F., Laporte, G., Monaco, M.F.: A tabu search heuristic for the quay crane scheduling problem. J. Sched. 10(4), 327–336 (2007)

    Article  MATH  Google Scholar 

  4. Bellman, R.E., Dreyfus, S.E.: Applied Dynamic Programming. Princeton Univ. Press, Princeton (1962)

    Book  MATH  Google Scholar 

  5. Cuencaa, J., Gimnezb, D., Martnez, J.: Heuristics for work distribution of a homogeneous parallel dynamic programming scheme on heterogeneous systems. Parallel Comput. 31(7), 711–735 (2005)

    Article  Google Scholar 

  6. Gergel, V.P.: High-Performance Computing for Multi-Processor Multi-Core Systems. MGU Press, Moscow (2010). (In Russian)

    Google Scholar 

  7. Brodtkorb, A.R., Dyken, C., Hagen, T.R., Hjelmervik, J.M., Storaasli, O.O.: State-of-the-art in Heterogeneous Computing. Scientific Programming 18(1), 1–33 (2010)

    Article  Google Scholar 

  8. Madhavan, A., Sherwood, T., Strukov, D.: Race logic: a hardware acceleration for dynamic programming algorithms. In: ISCA 2014, Minnesota, USA, pp. 517–528 (2014)

    Google Scholar 

  9. Tao, F., Zhang, L., Laili, Y.: Job shop scheduling with FPGA-based F4SA. In: Tao, F., Zhang, L., Laili, Y. (eds.) Configurable Intelligent Optimization Algorithm. SSAM, pp. 333–347. Springer, Cham (2015). doi:10.1007/978-3-319-08840-2_11

    Google Scholar 

  10. 7 Series FPGAs Data Sheet: Overview, March 2017. https://www.xilinx.com/support/documenta-tion/data_sheets/ds180_7Series_Overview.pdf

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Mikhail Reznikov or Yuri Fedosenko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Reznikov, M., Fedosenko, Y. (2017). A Model of FPGA Massively Parallel Calculations for Hard Problem of Scheduling in Transportation Systems. In: Battiti, R., Kvasov, D., Sergeyev, Y. (eds) Learning and Intelligent Optimization. LION 2017. Lecture Notes in Computer Science(), vol 10556. Springer, Cham. https://doi.org/10.1007/978-3-319-69404-7_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69404-7_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69403-0

  • Online ISBN: 978-3-319-69404-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics