Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Towards dense linear algebra for hybrid GPU accelerated manycore systems
Tomov S., Dongarra J., Baboulin M. Parallel Computing36 (5-6):232-240,2010.Type:Article
Date Reviewed: Dec 17 2010

Tomov et al.’s work involves the interface of hardware (hybrid systems made up of graphics processing units (GPUs) with more conventional central processing unit (CPU)-based systems) and software (for treating dense linear algebra (DLA) systems). This is an important paper from a hardware viewpoint, since it addresses both the cost and performance of GPUs, which make them highly desirable target systems, as is illustrated by their popularity in the video game arena and their potential in computational science fields. On the other hand, the target of DLA software is an example of an initial software project, both in terms of its utility and as a demonstration of dealing with the issues that need to be addressed when developing software of such hybrid hardware systems.

The paper begins with an introduction and background section on the history of GPUs, followed specifically by an overview of prior work on GPUs and DLA. Section 3 deals with the details of a hybrid system of a multicore CPU and GPUs. This section focuses on approaches to the hybridization of LAPACK, and it details task splitting and scheduling using directed acyclic graphs (DAGs). In Section 4, an illustrative example of DLA algorithms is given, along with performance results. This approach uses a random butterfly transformation (RBT) as a preconditioner. The paper includes performance results and conclusions for extending this approach. This interesting paper can serve as a foundation for dealing with more advanced hybrid systems and more complex mathematical software problems.

Reviewer:  Mike Minkoff Review #: CR138648 (1105-0527)
Bookmark and Share
  Reviewer Selected
 
 
Linear Programming (G.1.6 ... )
 
 
Graphics Processors (I.3.1 ... )
 
 
Hybrid Systems (C.1.m ... )
 
 
Multiple-Instruction-Stream, Multiple-Data-Stream Processors (MIMD) (C.1.2 ... )
 
 
Parallel Algorithms (G.1.0 ... )
 
 
Types And Design Styles (B.7.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Linear Programming": Date
Convex separable optimization is not much harder than linear optimization
Hochbaum D., Shanthikumar J. Journal of the ACM 31(4): 843-862, 1984. Type: Article
Apr 1 1991
Linear programming
Karloff H. (ed), Birkhäuser Boston Inc., Cambridge, MA, 1991. Type: Book (9780817635619)
May 1 1992
A model-management framework for mathematical programming
Palmer K., Boudwin N., Patton H., Sammes J., Rowland A., Smith D., John Wiley & Sons, Inc., New York, NY, 1984. Type: Book (9780471804727)
Aug 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy