Optimal implementation of general divide- and-conquer on the hypercube and related networks

Author(s):  
Ernst W. Mayr ◽  
Ralph Werchner
2003 ◽  
Vol 13 (04) ◽  
pp. 575-587 ◽  
Author(s):  
HOLGER BISCHOF ◽  
SERGEI GORLATCH ◽  
EMANUEL KITZELMANN

Skeletons are reusable, parameterized program components with well-defined semantics and pre-packaged efficient parallel implementation. This paper develops a new, provably cost-optimal implementation of the DS (double-scan) skeleton for programming divide-and-conquer algorithms. Our implementation is based on a novel data structure called plist (pointed list); implementation's performance is estimated using an analytical model. We demonstrate the use of the DS skeleton for parallelizing a tridiagonal system solver and report experimental results for its MPI implementation on a Cray T3E and a Linux cluster: they confirm the performance improvement achieved by the cost-optimal implementation and demonstrate its good predictability by our performance model.


2011 ◽  
Vol 36 (12) ◽  
pp. 1697-1705 ◽  
Author(s):  
Rong-Chuan SUN ◽  
Shu-Gen MA ◽  
Bin LI ◽  
Ming-Hui WANG ◽  
Yue-Chao WANG
Keyword(s):  

2014 ◽  
Vol 12 (2) ◽  
pp. 124-130 ◽  
Author(s):  
Cosme Santiesteban-Toca ◽  
Gerardo Casanola-Martin ◽  
Jesus Aguilar-Ruiz

Author(s):  
Anany Levitin ◽  
Maria Levitin

While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary on the puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking through more difficult puzzles.


Sign in / Sign up

Export Citation Format

Share Document