A General-purpose Parallel and Heterogeneous Task Programming System for VLSI CAD

This paper introduces Taskflow to address the critical question of "How can we make it easier to implement and deploy parallel computer-aided design (CAD) algorithms on large heterogeneous nodes with high performance and simultaneous high productivity?" Parallelizing CAD is an extremely ch...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design s. 1 - 2
Hlavní autor: Huang, Tsung-Wei
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Association on Computer Machinery 02.11.2020
Témata:
CAD
computer-aided design
general-purpose parallel task programming system
graphics processing units
heterogeneous task programming system
high-level programming model
manycore central processing units
Object oriented modeling
parallel algorithms
Parallel programming
Productivity
Solid modeling
Task analysis
Taskflow
Timing
user requirements
VLSI
VLSI CAD
ISSN:1558-2434
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper introduces Taskflow to address the critical question of "How can we make it easier to implement and deploy parallel computer-aided design (CAD) algorithms on large heterogeneous nodes with high performance and simultaneous high productivity?" Parallelizing CAD is an extremely challenging job. Modern CAD applications exhibit unique computational patterns and user requirements that need very strategic decomposition to benefit from parallelism. Taskflow assists researchers and developers in the implementation complexity of parallel algorithms by introducing a new high-level programming model supported by an efficient runtime. By capitalizing on emerging parallelism comprising manycore central processing units (CPUs), graphics processing units (GPUs), and custom accelerators, Taskflow enables CAD to achieve new performance and productivity milestones that were previously out of reach.
ISSN:1558-2434
DOI:10.1145/3400302.3415750