Anytime Algorithms for Automotive Architectures: UTC Final Report
Advanced Search
Select up to three search categories and corresponding keywords using the fields to the right. Refer to the Help section for more detailed instructions.

Search our Collections & Repository

For very narrow results

When looking for a specific result

Best used for discovery & interchangable words

Recommended to be used in conjunction with other fields

Dates

to

Document Data
Library
People
Clear All
Clear All

For additional assistance using the Custom Query please check out our Help Page

i

Anytime Algorithms for Automotive Architectures: UTC Final Report

Filetype[PDF-2.24 MB]


English
Details You May Also Like

Details:

  • Creators:
    Mangharam, Rahul
  • Corporate Creators:
    University of Pennsylvania. Dept. of Systems Engineering
  • Corporate Contributors:
    University Transportation Centers Program (U.S.)
  • Subject/TRT Terms:
  • Resource Type:
    Tech Report
  • Geographical Coverage:
    United States
  • TRIS Online Accession Number:
    01675039
  • Edition:
    Final Report
  • Corporate Publisher:
    University Transportation Centers Program (U.S.)
  • Abstract:
    Most algorithms are run-to-completion and provide one answer upon completion and no answer if interrupted before completion. On the other hand, anytime algorithms have a monotonic increasing utility with the length of execution time. This investigation focuses on the development of time-bounded anytime algorithms on Graphics Processing Units (GPUs) to trade-off the quality of output with execution time. Given a time-varying workload, the algorithm continually measures its progress and the remaining contract time to decide its execution pathway and select system resources required to maximize the quality of the result. To exploit the quality-time trade-off, the focus is on the construction, instrumentation, on-line measurement and decision making of algorithms capable of efficiently managing GPU resources. The author demonstrates this with a Parallel A* routing algorithm on a CUDA-enabled GPU. The algorithm execution time and resource usage is described in terms of CUDA kernels constructed at design-time. At runtime, the algorithm selects a subset of kernels and composes them to maximize the quality for the remaining contract time. The author demonstrates the feedback-control between the GPU-CPU to achieve controllable computation tardiness by throttling request admissions and the processing precision. As a case study, the author has implemented AutoMatrix, a GPU-based vehicle traffic simulator for real-time congestion management which scales up to 16 million vehicles on a US street map. This is an early effort to enable imprecise and approximate real-time computation on parallel architectures for stream-based time-bounded applications such as traffic congestion prediction and route allocation for large transportation networks.
  • Format:
    PDF
  • Funding:
    DTRT12GUTC11
  • Collection(s):
  • Main Document Checksum:
  • Download URL:
  • File Type:

Supporting Files

  • No Additional Files
More +

You May Also Like

Checkout today's featured content at rosap.ntl.bts.gov