Parallel and Distributed Algorithms

6.1. Problem (6) Monte Carlo Approximation of π We show how to approximate π. Observe that the area of the circle C with radius one equals π, whereas the area of the square S = [−1,+1]2 equals four. Hence if we randomly draw p points from S and if p(C) is the number of points which already belong to the circle C, then the ratio p(C) p converges to π 4 . Assume that we draw n points from the square S at random.

[1]  Robert D. Blumofe,et al.  Scheduling multithreaded computations by work stealing , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[2]  Christos Kaklamanis,et al.  Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.

[3]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[4]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[5]  Burkhard Monien,et al.  Studying overheads in massively parallel MIN/MAX-tree evaluation , 1994, SPAA '94.

[6]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[7]  M. Mitzenmacher,et al.  Parallel randomized load balancing , 1998 .

[8]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[9]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[10]  Ming-Yang Kao,et al.  Parallel Depth-First Search in General Directed Graphs , 1990, SIAM J. Comput..

[11]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[12]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[13]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[14]  Jonathan Schaeffer,et al.  Asynchronous parallel game-tree search , 1998 .

[15]  Chris J. Scheiman,et al.  LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation , 1995, SPAA '95.

[16]  Katherine Yelick,et al.  Randomized load balancing for tree-structured computation , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[17]  Jesper Larsson Träff.  Distributed Shortest Path Algorithms , 1993 .

[18]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[19]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[20]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[21]  H. James Hoover,et al.  Limits to parallel computation , 1995 .

[22]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[23]  Michael J. Quinn,et al.  Parallel programming in C with MPI and OpenMP , 2003 .