Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
Sics a Talk

Sics a Talk

Ratings: (0)|Views: 3 |Likes:
Published by Paul Cockshott
Sicsa Multicore Challenge one
Sicsa Multicore Challenge one

More info:

Published by: Paul Cockshott on Apr 01, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

12/22/2013

pdf

text

original

 
SICSA Benchmarks in C
SICSA Multi-core challenge Workshop Dec 2010
Paul CockshottGlasgow
 
First Serial Experiments
Prior to doing any parallelisation it is advisable to initially set upa good sequential version. I was initially doubtfull that thischallenge would provide an effective basis for parallelisationbecause it seemed such a simple problem. Intutively it seemslike a problem that is likely to be of either linear or at worst loglinear complexity, and for such problems, especially onesinvolving text files, the time taken to read in the file and print outthe results can easily come to dominate the total time taken. If aproblem is disk bound, then there is little advantage inexpending effort to run it on multiple cores.
 
Algorithm
The algorithm is four pass.1)Read the file into a buffer2)Produce a tokenised version of the buffer3)Build the hash table and prefix trees.4)If the concordance is to be printed out, perform a traversal ofthe trees printing out the word sequences in the formatsuggested by the Haskell version.5)If we want it sorted, pipe through Linux sort

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->