東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Hybrid scheduling for graph-based al...

Robison, Braden Devin.

Linked to FindBook

Google Book

Amazon

博客來

Hybrid scheduling for graph-based algorithm decomposition in high-performance computing environments.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Hybrid scheduling for graph-based algorithm decomposition in high-performance computing environments./
Author:	Robison, Braden Devin.
Description:	81 p.
Notes:	Source: Masters Abstracts International, Volume: 52-05.
Contained By:	Masters Abstracts International52-05(E).
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1553595
ISBN:	9781303805899

Hybrid scheduling for graph-based algorithm decomposition in high-performance computing environments.
Robison, Braden Devin.

Hybrid scheduling for graph-based algorithm decomposition in high-performance computing environments. - 81 p.

Source: Masters Abstracts International, Volume: 52-05.

Thesis (M.S.)--The University of Utah, 2014.

At the beginning of the 21st century, it became apparent that the performance gains associated with continual die shrinks and the resulting increases in core central processing unit (CPU) speeds were beginning to flatten. This realization has gradually shifted the focus of CPU design away from single core speed increases and toward the idea of obtaining performance through increased concurrency. The resulting design paradigm has given us multi- and many-core CPUs, vector processing units, and more recently, programmable, massively parallel hardware coprocessors, such as graphics processing units from nVidia and Advanced Micro Devices, along with more recent general purpose devices such as Intel's "Knights Corner." One of the most significant resulting challenges in high-performance computing is to provide a framework in which the software development process is platform agnostic to its end users, while at the same time being capable of scaling efficiently on diverse hardware configurations. This thesis will present an improved approach for the analysis and scheduling of computational tasks within a heterogeneous hardware environment, while removing implementation details from end users. This will be presented within the context of the "Expressions" framework, a component within a computational fluid dynamics solver, known as "Wasatch," developed at the University of Utah.

ISBN: 9781303805899Subjects--Topical Terms:

626642
Computer Science.

Hybrid scheduling for graph-based algorithm decomposition in high-performance computing environments.
LDR:02264nam a2200277 4500 001 1966910
005 20141112075544.5
008 150210s2014 ||||||||||||||||| ||eng d
020 $a 9781303805899
035 $a (MiAaPQ)AAI1553595
035 $a AAI1553595
040 $a MiAaPQ $c MiAaPQ
100 1 $a Robison, Braden Devin. $3 2103812
245 1 0 $a Hybrid scheduling for graph-based algorithm decomposition in high-performance computing environments.
300 $a 81 p.
500 $a Source: Masters Abstracts International, Volume: 52-05.
500 $a Adviser: James Sutherland.
502 $a Thesis (M.S.)--The University of Utah, 2014.
520 $a At the beginning of the 21st century, it became apparent that the performance gains associated with continual die shrinks and the resulting increases in core central processing unit (CPU) speeds were beginning to flatten. This realization has gradually shifted the focus of CPU design away from single core speed increases and toward the idea of obtaining performance through increased concurrency. The resulting design paradigm has given us multi- and many-core CPUs, vector processing units, and more recently, programmable, massively parallel hardware coprocessors, such as graphics processing units from nVidia and Advanced Micro Devices, along with more recent general purpose devices such as Intel's "Knights Corner." One of the most significant resulting challenges in high-performance computing is to provide a framework in which the software development process is platform agnostic to its end users, while at the same time being capable of scaling efficiently on diverse hardware configurations. This thesis will present an improved approach for the analysis and scheduling of computational tasks within a heterogeneous hardware environment, while removing implementation details from end users. This will be presented within the context of the "Expressions" framework, a component within a computational fluid dynamics solver, known as "Wasatch," developed at the University of Utah.
590 $a School code: 0240.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Computer. $3 1669061
690 $a 0984
690 $a 0464
710 2 $a The University of Utah. $b School of Computing. $3 1672222
773 0 $t Masters Abstracts International $g 52-05(E).
790 $a 0240
791 $a M.S.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1553595