PPT-PRAM Algorithms

Sathish Vadhiyar PRAM Model Introduction Parallel Random Access Machine Allows parallelalgorithm designers to treat processing power as unlimited Ignores complexity of interprocess communication. Rahul. . Santhanam. University of Edinburgh. Plan of the Talk. Preliminaries and Motivation. Informational Bottlenecks: Proof Complexity and Related Models. Computational Bottlenecks: OPP and Compression. 1. Graph Algorithms. Many problems are naturally represented as graphs. Networks, Maps, Possible paths, Resource Flow, etc.. Ch. 3 focuses on algorithms to find connectivity in graphs. Ch. 4 focuses on algorithms to find paths within graphs. vs. Sequential Algorithms. Design of efficient algorithms. A parallel computer is of little use unless efficient parallel algorithms are available.. The issue in designing parallel algorithms are very different from those in designing their sequential counterparts.. George Caragea, and Uzi Vishkin. University of Maryland. 1. Speaker. James Edwards. It has proven to be quite . difficult. to obtain significant performance improvements using current parallel computing platforms.. Too Easy? or Too difficult?. Uzi Vishkin. . Using Simple Abstraction to Reinvent Computing for Parallelism, CACM, January 2011, pp. 75-85. . http://www.umiacs.umd.edu/users/vishkin/XMT/. Commodity computer systems. Annie . Yang and Martin Burtscher*. Department of Computer Science. Highlights. MPC compression algorithm. Brand-new . lossless . compression algorithm for single- and double-precision floating-point data. matter and can matter more: . Big . lead of PRAM algorithms on prototype-HW. Uzi Vishkin. There is nothing more practical than a good theory. -- James C. Maxwell. Mainstream many-cores are in trouble. Raman Veerappan. EPS 109 Final Project. Introduction. Goals. To examine various maze solving algorithms using MATLAB determine which algorithms are most effective for which mazes. Two main algorithms examined. Computing. Jie Liu. , . Ph.D.. Professor. Computer Science Division. Western Oregon University. Monmouth, Oregon, USA. liuj@wou.edu. outline. The . fastest computers. The PRAM model. The O(1) algorithm that finds the max. 2. 　. Turing machine. 　. RAM (. Figure . ). 　. Logic circuit model. . RAM . (Random Access Machine). Operations . supposed to be executed in one unit time. (1). 　. Control operations such as. Algorithm. Input. Output. 1. Analysis of Algorithms. How long does this take to open 1) know 2) don’t know. . Analysis of Algorithms. 2. If know combination O(n) . where n is number of rings. . If the alphabet is size m, O(nm). Instructor: Arun Sen. Office: BYENG . 530. Tel: 480-965-6153. E-mail: asen@asu.edu. Office Hours: . MW 3:30-4:30 or by appointment. TA: . TBA. Office. : TBA. Tel: . TBA. E-mail: . TBA. Office Hours. : . Problem - a well defined task.. Sort a list of numbers.. Find a particular item in a list.. Find a winning chess move.. Algorithms. A series of precise steps, known to stop eventually, that solve a problem.. 1. Decrease-and-Conquer. Reduce . original problem . instance to . smaller . instance . of the same problem. Solve smaller . instance. Extend solution . of smaller . instance . to obtain solution to original instance.