• DocumentCode
    2569641
  • Title

    Massively parallel processing for dynamic airspace configuration

  • Author

    Gallet, Bart

  • fYear
    2011
  • fDate
    16-20 Oct. 2011
  • Firstpage
    1
  • Lastpage
    17
  • Abstract
    • Smaller data sets are problematic because — Overheads involved with launching a kernel — GPU underutilization: lower thread count has lower tolerance for long memory access latencies as there are no "other threads" ready to run. • Not all algorithms benefit from parallelization — Trade off between "parallelization effort" and "performance gain". — If it takes a lot of effort to parallelize an algorithm, it might mean that the algorithm is has no inherent parallelism, (e.g. the aircraft climbing metric).
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Digital Avionics Systems Conference (DASC), 2011 IEEE/AIAA 30th
  • Conference_Location
    Seattle, WA, USA
  • ISSN
    2155-7195
  • Print_ISBN
    978-1-61284-797-9
  • Type

    conf

  • DOI
    10.1109/DASC.2011.6096204
  • Filename
    6096204