From: Randy Crawford Newsgroups: comp.parallel Subject: Re: superlinear question Date: 17 Oct 1998 07:42:40 GMT Organization: Approved: bigrigg@cs.cmu.edu Message-Id: <709hpg$9f1$1@encore.ece.cmu.edu> Originator: bigrigg@ece.cmu.edu @PUB:EMAIL.COM EMDIR wrote: > > [i'm going to pass this along even though it looks like homework. > -mike] > > Is there anyone who can give us the SIMPLEST algorithm and codes to > achieve SUPERLINEAR speedup. I am using MPI (Message Passing > Interface) and C to study the parallel algoritm. Any help will be > appreciated. Please send them straight to my e-mail Implement a serial sort via bubblesort and then implement a parallel sort via a partitioned quicksort. Voila, superlinear speedup. OR... Implement an algorithm that has rotten communincation overhead when fewer processes are spawned, and that as more processes are added, reduces communication overhead. Again, voila, superlinear speedup. OR... Implement the serial verion of the algorithm and compile with -O0, then compile the parallel implementation with increasing amounts of optimization as you add additional processes. I think by now you're getting my drift... Superlinear speedup == (perpetual motion machine || perverse serial implementation). -- Randy Crawford rcrawford@erols.com N=1 ==> P=NP -- Articles to bigrigg+parallel@cs.cmu.edu (Admin: bigrigg@cs.cmu.edu) Archive: http://www.hensa.ac.uk/parallel/internet/usenet/comp.parallel