Data Processing Server & Client Collaboration

PURPOSE Develop a practical understanding of task collaboration using socket programming, semaphores, and multithreading. OBJECTIVES Develop a client/server application using Linux TCP sockets and the C programming language. Your solution will be based on the code you developed for project-1 and previous programming assignments. Both the client and the server will collaborate with a helper to perform their tasks. All communications involving the referred three components must be performed by sharing frames through shared socket. All frames will follow the specifications provided in project-1. No error checking will be required for this exercise. All encoding and decoding must be performed by the helper node. PROBLEM You are to develop a data processing system to process strings of characters. The solution must report the total number of letters (a, e, i, o, u) found in a document. Both the server and the client nodes will collaborate with another node, the helper. THE SERVER NODE The server receives requests from the client and contacts the helper node to encode and decode data. The following six threads are created by the server to perform its service: 1 The charA thread will read characters available through a socket and will append to each character aA ( either upper and lower case ) an integer to indicate the number of characters aA found. It will share the updated data with the charE thread through a queue of messages that is shared between charA and charE threads. The charA thread will share the character aA updated count with the count thread. Note that if the string data is received by this thread it will share the string da1ta2 with charE and the total count of character a in thread count would be incremented from zero to 1, when the first a is processed and to 2 when the second a is found. In essence, thread count will be updated every time a vowel is found. 2 The charE thread will read characters supplie by the charA thread node and will append to each character eE ( either upper and lower case ) an integer to indicate the number of characters eE found. It will share the updated data with the charI thread through a queue of messages that is shared between charE and charI threads. The charE thread will share the character eE updated count with the count thread. 3 The charI thread will read characters supplied by the charE thread node and will append to each character iI ( either upper and lower case ) an integer to indicate the number of characters iI found. It will share the updated data with the charO thread through a queue of messages that is shared between charI and charO threads. The charI thread will share the character iI updated count with the count thread. 4 The charO thread will read characters supplied by the charI thread node and will append to each character oO ( either upper and lower case ) an integer to indicate the number of characters oO found. It will share the updated data with the charU thread through a queue of messages that is shared between charO and charU threads. The charO thread will share the character oO updated count with the count thread. 5 The charU thread will read characters supplied by the charO thread node and will append to each character uU ( either upper and lower case ) an integer to indicate the number of characters uU found. The charU thread will share the character oO updated count with the count thread. 6 The count thread will update the vowel counts based on the requests provided by each of the five previous listed threads. This thread will use an array of five integers to store the total count during the complete processing of the input file. The server creates file [login to view URL] and populates it with the totals obtained. The data format for this file must be: Totals Letter aA : total number obtained, Letter eE : same as above, Letter iI : same as above, Letter oO: same as above, Letter uU: same as above. The server will share the contents of file [login to view URL] with the helper node and will receive its associated encoded frame(s) from the helper. With the information received, the server uses a socket to share the frames with the client node. SERVER NODE IMPLEMENTATION DETAILS 1. You must develop a module that implements a queue of character strings. 2. This structure will be an array of pointers to strings with integers (pointers) to indicate the head and tail of the list. 3. The size of all five character queues is 5. 4. You must create and join all 6 threads. The operating system will select each thread to execute and your solution must adapt to whatever it. 5. Thread count will use an array of 5 integers. 6. Threads should terminate when end of input data is reached. THE HELPER NODE The helper component will use sockets to all communications with both the server and the client. Its services are to encode and decode the information received. The helper node will use an array of 536 characters for socket reads and writes. Encoding During encoding it will receive a string of characters and (1) obtain a 7bit binary representation of a character, (2) add a parity bit to it, and (3) will create a frame with the resulting “binary” data created. The helper also uses a socket to return each frame created. Decoding During decoding it will receive a frame and (1) perform a deframing process, (2) remove the parity bit for each binary encoded character, and (3) obtain the character from the 7bit binary representation of it. The helper also uses a socket to return strings of characters. The following two tables describe the six threads and its associated data structures that are to be used for the performance of all services provided by the Helper node. Threads charToBin Helper Encoding Data Structures Array of 7 characters addParity createFrame Array of 8 characters Array of 536 characters ((3+64)*8) Threads Deframe Helper Decoding Data Structures Array of 536 characters ((3+64)*8) removeParity binToChar Array of 8 characters Array of 7 characters THE CLIENT NODE The client will read [login to view URL] file and share the data obtained with the helper node. It will collect the results produced by the helper and share them with the server. The client will also collect all the frames shared by the server and request the helper node to decoded it. The client will collect the results shared by the helper, and will save it as receivedVowelCount.txt. TESTING You are to use the same data you have used for testing your project-1. DOCUMENTATION Your program should be developed using GNU versions of the C compiler. You are to use POSIX threads only. This means your solution must use the functions available in the pthread.h header file. It should be layered, modularized, and well commented. The following is a tentative marking scheme and what is expected to be submitted for this assignment: 1. External Documentation (as many pages necessary to fulfill the requirements listed below.) including the following: a. Title page b. A table of contents c. [6%] System documentation i. [4%] A high-level data flow diagram for the system ii. iii. [1%] A list of routines and their brief descriptions [1%] Implementation details d. [15%] Test documentation i. [5%] Client test ii. iii. e. [5%] Server test [5%] Helper test [3%] User documentation i. Where is your source ii. iii. 2. Source Code How to run your program Describe parameter (if any) a. [74% total] Correctness i. [5%] Client to Server communication ii. iii. iv. v. vi. vii. viii. [5%] Server to Client communication [5%] Client to Helper communication [5%] Helper to Client communication [5%] Server to Helper communication [5%] Helper to Server communication [24%] Server multithreading [20%] Helper multithreading b. [2%] Programming style i. Layering ii. iii. iv.