Get experience creating and running concurrent processes and threads.

  

Part 1: 

 Description: 

You will create processes, run processes in parallel, and pass information

 between processes. 

The data to be processed are text strings, lines of CSV separated values, 

we wish to sort these. 

1. Get any one of these data sets: 

http://earthquake.usgs.gov/earthquakes/feed/v1.0/csv.php 

(all quakes last 30 days) 

or 

http://www-odi.nhtsa.dot.gov/downloads/flatfiles.cfm 

(and get the FLAT_RCL file (zip) which are all vehicle recalls 

in the US (the RCL.txt is the “meta”-data (schema) description 

of the data) 

1a. If you sort the earthquake data, sort by latitude, in ascending order, 

if you sort the recalls sort by year of recall and manufacturer 

(first year, then manufacture name).

2.  Either: sort the data by hand (not a good idea), 

or write a two loop (bubble or insertion) sort program to sort the data.

  (Do not use a “better” (faster) sorting method, the purpose is to use a

“slow” sort method, but if you really want to, use much, much bigger

 data.) 

3. “Instrument” your program (time it). 

4. Create a program that will, in turn, run multiple processes “concurrently”

 (at the same time, employing all of your CPUs and CPU Cores, 

using “fork( )” and “exec( )” (there are several variants of exec 

(execl, execv, etc.) 

 Please do not use “threads” (yet). 

5. Do the sort, again, in parallel for 2 concurrent processes, then 4, 

and finally 10 processes. 

6. Instrument those sorts (like above). 

7. How will you pass data (parts of the array) to each process (IPC)? 

(Files, pipes, shared memory, message queues?)  

8. You may (not required) to use a menu to select number of processes, 

size of data, etc. 

  

Part 2: 

 Description: 

You will create a process and threads, run in parallel, and pass information

 between threads. 

You will use synchronization operations to avoid overwriting 

shared resources. 

As in Assignment above: 

1. Use the same data set, as assignment 2. 

2. Sort, using the same methods from part 1, (write a two loop (bubble 

or insertion) sort program to sort the numbers in ascending order. 

3. “Instrument” your program (time it). 

4. Create a program that will, in turn, run multiple threads “concurrently”

 using a kernel level threading system. 

 (there are several options: Pthreads, Java, C/C++) 

5. Do the sort, again, in parallel for 2 concurrent threads, then 4, 

and 10 threads. 

6. Instrument those sorts (above). 

7. How will you pass data (parts of the array) to each thread? 

(How will you synchronize sharing resources such as memory?) 

8. You may (not required) to use a menu to select number of threads, 

size of data, etc. 

Hint: 

Lawrence Livermore Lab thread tutorial:  

https://computing.llnl.gov/tutorials/pthreads/ 

includes thread creation, management, and using mutexes  

Order a unique copy of this paper
(550 words)

Approximate price: $22

Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

We value our customers and so we ensure that what we do is 100% original..
With us you are guaranteed of quality work done by our qualified experts.Your information and everything that you do with us is kept completely confidential.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

The Product ordered is guaranteed to be original. Orders are checked by the most advanced anti-plagiarism software in the market to assure that the Product is 100% original. The Company has a zero tolerance policy for plagiarism.

Read more

Free-revision policy

The Free Revision policy is a courtesy service that the Company provides to help ensure Customer’s total satisfaction with the completed Order. To receive free revision the Company requires that the Customer provide the request within fourteen (14) days from the first completion date and within a period of thirty (30) days for dissertations.

Read more

Privacy policy

The Company is committed to protect the privacy of the Customer and it will never resell or share any of Customer’s personal information, including credit card data, with any third party. All the online transactions are processed through the secure and reliable online payment systems.

Read more

Fair-cooperation guarantee

By placing an order with us, you agree to the service we provide. We will endear to do all that it takes to deliver a comprehensive paper as per your requirements. We also count on your cooperation to ensure that we deliver on this mandate.

Read more

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency