logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

In-line code comments no fewer than every 5 lines of code which describe your algorithmic steps. Syntax transcriptions of the code are

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

1) Only one source code file as follows with filename as in the example where you will put your own first initial and lastname and your

   own section number. I show the example for my own name with an example section 23: JSvadlenka_prj2_sect23_src.c   (or .cpp)

 

 a) At top of the file: your name in comments, for example:  // First_Name Last_Name 

 

 

 b) Next, the gcc or g++ code compilation and linkage command, for example in my case (not yours) it would be:

 // gcc -o JSvadlenka_prj2_sect23_src.c  -o JSvadlenka_prj2_sect23_src.exe 

 

   Note that you will additionally need the -pthread option for compiling and linking.

    

 c) In-line code comments no fewer than every 5 lines of code which describe your algorithmic steps. Syntax transcriptions of the code are   

    not considered in-line code comments! (For example, I do not want to see the comment for i++ which says "Increment i.")

 

2) An MS Word or PDF document with a write-up of your software design and an explanation of the issues encountered and resolved. (1 page)

   Filename should be according to this example of my own name: JSvadlenka_prj2_sect23_wrt.doc (or pdf)

 

   No ZIP file submissions.

 

 

3) The source code accepts one command line argument which is the name of the input text file to be read (input files to be provided later by instructor). For your own testing, please create and use your own test input text files.

 

 

Project 2 Description  

---------------------

 

1) Your program will make use of the POSIX system calls and pthreads library functions discussed in lectures. That is, you must not use any C or C++ standard library functions. Your program will have 3 pthreads in a pipeline pattern. The mainline thread opens the input text file to get a file descriptor, it also creates 3 pthreads, and simply waits for each pthread to do its work and terminate. So the mainline thread calls pthread_join() three times before closing the input file and exitting the program. Each pthread will do a different task so each of the 3 pthreads executes a different function. So let's name the three pthreads as pthread 1, pthread 2, and pthread 3. 

 

Remember, pthread 1 is a producer of data for pthread 2, and pthread 2, in turn, is a producer for pthread 3 (the consumer for pthread 2). So pthread 2 is both a consumer and producer! You will be implementing the producer and consumer algorithms of Chapter 3. But wait, you say, thread 1 is easy as it is only a producer and thread 3 is easy because it is only a consumer. Yes, but remember you need different shared buffer arrays, and in and out variables between Threads 1 and 2 and between threads 2 and 3. BUFFER_SIZE size will equal 10 for the shared buffer array 1 between pthread 1 and pthread 2 while BUFFER_SIZE will be equal to 20 for the shared buffer array 2 between pthread 2 and pthread 3. Also, you will remember that I mentioned in lecture that you have to use the sched_yield() function for any thread producer or consumer as in:

 

#include <sched.h>

 

while((in + 1) % BUFFER_SIZE) == out) {

 

 // Insert sched_yield() function call here.

}

 

and for any thread consumer as in:

 

while (in == out) {

 // Insert sched_yield() function call here

}

 

 

So what will pthread 1 do? For each line of text it reads from the input text file, it will produce that line of text into an element of the shared buffer array 1. 

So what about about pthread 2 as it is both producer and consumer? That is where the interesting work lies! In a sense the consumption activity of thread 2 is really the production of the data content to eventually be consumed by thread 3. So just what exactly is that content being produced by pthread 2 and that will be consumed by pthread 3? It is all the words in the line of text consumed from an element of shared buffer array 1. So in pthread 2 you will have to parse each line into a set of all words in that line (what white space characters will you check?). Each word will be produced to an element of the shared buffer array 2. Additionally, pthread 2 will maintain a counter of the number of lines consumed from shared buffer 1.

 

What does pthread 3 do with the content it consumes from shared buffer array 2? It will write each word out to standard output (STDOUT_FILENO) with each word on its own line. After the last word of the input text file has been displayed, the total number of words will be printed out. Therefore, you have to maintain a word counter in pthread 3. Finally, pthread 3 will also print the total number of lines in the input file. Therefore, you have to devise a strategy to get the line counter from pthread 2 to pthread 3. 

 

You are NOT permitted to use any C++ nor C standard I/O library functions nor cin nor cout. Furthermore, you cannot use

   any C++ nor C standard library functions for string operations.  

 

OUTPUT: Remember, all thread output goes to the screen (standard out) and is done only by pthread 3.

 

Given a sample input file with only one line of text (of course, you can expect to have actual input files with more than one line) as follows:

 

          Let us all sing out loud together and enjoy the good times while we can.

 

The output to the screen from pthread 3 will be the following:

 

*Let*

*us*

*all*

*sing*

*out*

*loud*

*together*

*and*

*enjoy*

*the*

*good*

*times*

*while*

*we*

*can*

*WORD COUNT = 15*

*LINE COUNT = 1*

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

622 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

953 Answers

Hire Me
expert
Husnain SaeedComputer science

650 Answers

Hire Me
expert
Atharva PatilComputer science

928 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30