Add files via upload

Author: patrickstevens24

Makefile

@@ -0,0 +1,15 @@
+CC=gcc
+CFLAGS=-pthread -I. -Wall -Wno-int-conversion -D_GNU_SOURCE
+
+binaries=pcMatrix 
+
+all: $(binaries)
+
+pcMatrix: matrix.c pcmatrix.c tasks.c
+	$(CC) $(CFLAGS) $^ -o $@
+
+clean:
+	$(RM) -f $(binaries) *.o
+
+
+ 

matrix.c

@@ -0,0 +1,126 @@
+/*
+ *  Matrix task processor - matrix module
+ *  Based on Operating Systems: Three Easy Pieces by R. Arpaci-Dusseau and A. Arpaci-Dusseau
+ * 
+ *  Wes J. Lloyd
+ *  University of Washington, Tacoma
+ *  TCSS 422 - Operating Systems
+ *  Spring 2017
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <pthread.h>
+#include <assert.h>
+
+int SumMatrix(int ** matrix, const int height, const int width);
+
+// MATRIX ROUTINES
+int ** AllocMatrix(int r, int c) 
+{
+  int ** a;
+  int i;
+  a = (int**) malloc(sizeof(int *) * r);
+  assert(a != 0);
+  for (i = 0; i < r; i++)
+  {
+    a[i] = (int *) malloc(c * sizeof(int));
+    assert(a[i] != 0);
+  }
+  return a;
+}
+
+void FreeMatrix(int ** a, int r, int c)
+{
+  int i;
+  for (i=0; i<r; i++)
+  {
+    free(a[i]);
+  }
+  free(a);
+}
+
+void GenMatrixType(int ** matrix, const int height, const int width, int type)
+{
+  int i, j;
+  if (type > 100)
+    type = 100;
+  if (type < 1)
+    type = 1;
+  for (i = 0; i < height; i++)
+  {
+    for (j = 0; j < width; j++)
+    {
+      int * mm = matrix[i];
+      switch (type)
+      {
+        case 1:
+        mm[j] = 1;
+        break;
+        case 2:
+        mm[j] = j;
+        break;
+        default:
+        mm[j] = rand() % type;
+      }
+#if OUTPUT
+      printf("matrix[%d][%d]=%d \n",i,j,mm[j]);
+#endif
+    }
+  }
+}
+
+void GenMatrix(int ** matrix, const int height, const int width)
+{
+  GenMatrixType(matrix, height, width, 1);
+}
+
+// TO DO
+// Implement the AvgElement function
+int AvgElement(int ** matrix, const int height, const int width)
+{
+    int sum = SumMatrix(matrix, height, width);
+    int num = height * width;
+    int avg = sum / num;
+
+  return avg;
+
+}
+
+int SumMatrix(int ** matrix, const int height, const int width)
+{
+  int sum=0;
+  int y=0;
+  int i, j;
+  for (i=0; i<height; i++)
+  {
+    int *mm = matrix[i];
+    for (j=0; j<width; j++)
+    {
+      y=mm[j];  
+      sum=sum+y;
+    }
+  }
+  return sum;
+}
+
+void DisplayMatrix(int ** matrix, const int height, const int width, FILE *stream)
+{
+  int y=0;
+  int i, j;
+  for (i=0; i<height; i++)
+  { 
+    int *mm = matrix[i];
+    fprintf(stream, "|");
+    for (j=0; j<width; j++)
+    {
+      y=mm[j];
+      if (j==0)  
+        fprintf(stream, "%3d",y);
+      else
+        fprintf(stream, " %3d",y);
+    }
+    fprintf(stream, "|\n");
+  }
+}
+

matrix.h

@@ -0,0 +1,22 @@
+/*
+ *  Matrix task processor - matrix header file
+ *  Based on Operating Systems: Three Easy Pieces by R. Arpaci-Dusseau and A. Arpaci-Dusseau
+ * 
+ *  Wes J. Lloyd
+ *  University of Washington, Tacoma
+ *  TCSS 422 - Operating Systems
+ *  Spring 2017
+ */
+
+#define ROW 5
+#define COL 5
+
+// MATRIX ROUTINES
+int ** AllocMatrix(int r, int c);
+void FreeMatrix(int ** a, int r, int c);
+void GenMatrix(int ** matrix, const int height, const int width);
+void GenMatrixType(int ** matrix, const int height, const int width, int type);
+int AvgElement(int ** matrix, const int height, const int width);
+int SumMatrix(int ** matrix, const int height, const int width);
+void DisplayMatrix(int ** matrix, const int height, const int width, FILE *stream);
+

pcMatrix

@@ -0,0 +1,52 @@
+/*
+ *  Matrix Task Processor
+ *  Based on Operating Systems: Three Easy Pieces by R. Arpaci-Dusseau and A. Arpaci-Dusseau
+ * 
+ *  Assignment 3 code
+ *  Program operates on tasks submitted to the tasks_input directory
+ *  Results are created in the tasks_output directory
+ *
+ *  A bounded buffer is used to store pending tasks
+ *  A producer thread reads tasks from the tasks_input directory 
+ *  Consumer threads perform tasks in parallel
+ *  Program is designed to run as a daemon (i.e. forever) until receiving a request to exit.
+ *
+ *  This program mimics the client/server processing model without the use of any networking constructs.
+ *
+ *  Wes J. Lloyd
+ *  University of Washington, Tacoma
+ *  TCSS 422 - Operating Systems
+ *  Spring 2017
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <pthread.h>
+#include <time.h>
+#include "matrix.h"
+#include "tasks.h"
+#include "pcmatrix.h"
+
+int main (int argc, char * argv[])
+{
+  // Uncomment to see example operation of the readtasks() routine
+  int sleep = 500;
+  if(argc == 2) {
+      sleep = atoi(argv[1]);
+  } 
+  // Uncomment to see example operation of the dotasks() routine
+
+  pthread_t p;
+  pthread_t c, c1;
+  // To do
+  // Use pthreads
+  // Create one pthread for readtasks()
+  pthread_create(&p, NULL, readtasks, sleep);
+  // Create one or more pthreads for dotasks()
+  pthread_create(&c, NULL, dotasks, NULL);
+  pthread_create(&c1, NULL, dotasks, NULL);
+  pthread_join(c, NULL);
+  pthread_join(c1, NULL);
+  pthread_join(p, NULL);
+  return 0;
+}

pcmatrix.c

@@ -0,0 +1,14 @@
+/*
+ *  matrix task processor pcmatrix header file
+ *  Based on Operating Systems: Three Easy Pieces by R. Arpaci-Dusseau and A. Arpaci-Dusseau
+ * 
+ *  Wes J. Lloyd
+ *  University of Washington, Tacoma
+ *  TCSS 422 - Operating Systems
+ *  Spring 2017
+ */
+
+#define OUTPUT 1
+
+
+