دانلود کتاب High Performance Computing in Science and Engineering '21: Transactions of the High Performance Computing Center, Stuttgart
by Wolfgang E. Nagel, Dietmar H. Kroner, Michael M. Resch
|
عنوان فارسی: محاسبات با عملکرد بالا در علم و مهندسی '21: معاملات مرکز محاسبات با عملکرد بالا، اشتوتگارت |
دانلود کتاب
جزییات کتاب
Developing scalable algorithms is a challenging task that requires careful analysis and extensive experimental evaluation. CPU technology shifts to deliver increasing amounts of cores with relatively low clock rates, since these are cheaper to produce and operate. Parallelizing computationally intensive algorithms at the core of all applications is therefore an important research topic. Developing distributed algorithms on cluster computers such as the ForHLR II is an integral part of this scalability challenge. Our focus is especially on discrete algorithms, such as graph partitioning, text search, and propositional satisfiability (SAT) solving.
In previous years, we studied distributed online sorting and string sorting in our Big Data toolkit Thrill, developed a scalable approach to edge partitioning, developed and evaluated algorithms for maintaining uniform and weighted samples over distributed data streams (reservoir sampling), and designed new approaches to massively parallel malleable job scheduling applied to propositional satisfiability (SAT) solving. Thrill – A High-Performance Big Data Framework in C++. We improved the sorting algorithm of Thrill, our next-generation C++ framework for distributed Big Data batch processing on a cluster of homogeneous machines which enables writing distributed applications conveniently using “dataflow” graph-like computations.