Lattice QCD with domain decomposition on Intel® Xeon Phi™ co-processors

The gap between the cost of moving data and the cost of computing continues to grow, making it ever harder to design iterative solvers on extreme-scale architectures. This problem can be alleviated by alternative algorithms that reduce the amount of data movement. We investigate this in the context...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis S. 69 - 80
Hauptverfasser:	Heybrock, Simon, Joó, Bálint, Kalamkar, Dhiraj D., Smelyanskiy, Mikhail, Vaidyanathan, Karthikeyan, Wettig, Tilo, Dubey, Pradeep
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Piscataway, NJ, USA IEEE Press 16.11.2014 IEEE
Schriftenreihe:	ACM Conferences
Schlagworte:	and very la Applied computing > Physical sciences and engineering > Physics Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Linear algebra algorithms Domain decomposition G.1.3 [Numerical Analysis]: Numerical Linear Algebra Sparse Gold Intel® Xeon Phi coprocessor Jacobian matrices Lattice QCD Categories and subject descriptors: D.3.4 [Programming Languages]: Processors Optimization Lattices Layout Linear systems Mathematics of computing > Mathematical analysis > Numerical analysis > Computations on matrices Mathematics of computing > Mathematical software Prefetching Software and its engineering > Software notations and tools > Compilers structured Vectors Xeon Phi domain decomposition Intel coprocessor lattice QCD
ISBN:	1479955000, 9781479955008
ISSN:	2167-4329
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!