Added OS II assignments

2025-11-09 21:51:15 +00:00 · 2018-06-08 00:50:59 -07:00
parent 43b3555da8
commit 06c37d59e1
76 changed files with 103393 additions and 0 deletions
--- a/Assignments/Concurrency
+++ b/Assignments/Concurrency
@@ -0,0 +1,170 @@
+/* 
+ * File:   main.c
+ * Author: caperren
+ *
+ * Created on April 13, 2018, 7:27 PM
+ */
+
+/*
+ * Important implementation notes...
+ * Consumer prints out number in struct on consumption
+ * Timeout is how long before consumer is done with item (2-7 seconds)
+ * Producer waits 3-7 seconds
+ * Max buffer size is 32
+ * Consumer/s and producer need lock on buffer when doing things
+ * If nothing in queue, consumer blocks until there is
+ */
+
+#include "mt19937ar.h"
+
+#include <stdio.h>
+#include <string.h>
+#include <stdint.h>
+#include <fcntl.h>
+#include <unistd.h>
+#include <pthread.h>
+
+// Program defines you might want to change
+#define MAX_BUFFER_SIZE 32
+
+#define MIN_RANDOM_PRODUCER 3
+#define MAX_RANDOM_PRODUCER 7
+
+#define MIN_RANDOM_CONSUMER 2
+#define MAX_RANDOM_CONSUMER 9
+
+//RDRAND value to check for
+#define RDRAND_FLAG (1 << 30)
+
+// Data structure for the buffer elements
+struct two_values {
+    uint8_t number;
+    uint8_t work_timeout;
+};
+
+//Storage containers and mutex for access
+struct two_values storage_buffer[MAX_BUFFER_SIZE];
+uint16_t tasks_in_buffer = 0;
+
+pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
+
+// Get random number based on whether rdrand is supported.
+uint8_t get_random_number(uint8_t min, uint8_t max) {
+    uint8_t rand_val;
+    unsigned long seed;
+
+    unsigned int eax;
+    unsigned int ebx;
+    unsigned int ecx;
+    unsigned int edx;
+
+    eax = 0x01;
+
+    // ASM for checking if RDRAND supported
+    __asm__ __volatile__("cpuid"
+            : "=a" (eax),
+            "=b" (ebx),
+            "=c" (ecx),
+            "=d" (edx)
+            : "a" (1),
+            "c" (0)
+            );
+
+    // Seed random with /dev/random
+    int random = open("/dev/random", O_RDONLY);
+    read(random, &seed, sizeof (seed));
+
+    unsigned int random_value;
+
+    if ((ecx & RDRAND_FLAG) == RDRAND_FLAG) {
+	char return_code = 0;
+	char count = 0;
+
+        // ASM for RDRAND
+	while(return_code != 1 && count < 10){
+		__asm__ volatile(
+		        "rdrand %0 ; setc %1"
+		        : "=r" (random_value), "=qm" (return_code)
+		);
+
+		count++;
+	}
+    } else {
+        // Twister if RDRAND not supported
+        init_genrand(seed);
+	random_value = genrand_int32();
+    }
+
+    return (random_value % (max + 1 - min)) + min;
+}
+
+void *consume_buffer_items(){
+    uint8_t number;
+    uint8_t work_timeout;
+    
+    while(1){
+        // This waits for a task to exist, then makes a temporary copy
+        // of the data in the last item in the queue.
+        // It then removes the item, while mutex locking during all of this
+        while(tasks_in_buffer == 0);
+        pthread_mutex_lock(&mutex);
+        
+        number = storage_buffer[tasks_in_buffer - 1].number;
+        work_timeout = storage_buffer[tasks_in_buffer - 1].work_timeout;
+        storage_buffer[tasks_in_buffer - 1].number = 0;
+        storage_buffer[tasks_in_buffer - 1].work_timeout = 0;
+        tasks_in_buffer--;
+        
+        pthread_mutex_unlock(&mutex);
+        
+        printf("Consumer found number: %u. Now waiting %u seconds.\n", number, work_timeout);
+        fflush(stdout);
+        
+        sleep(work_timeout);   
+    }
+    
+}
+
+int main(int argc, char **argv) {  
+    pthread_t consumer_thread;
+    
+    // This makes the consumer thread
+    if(pthread_create(&consumer_thread, NULL, consume_buffer_items, NULL)) {
+        fprintf(stderr, "Error creating thread\n");
+        return 1;
+    }
+    
+    //Zero out array
+    for(uint16_t i = 0 ; i < MAX_BUFFER_SIZE ; i++){
+        storage_buffer[i].number = 0;
+        storage_buffer[i].work_timeout = 0;
+    }
+    
+    uint8_t number;
+    uint8_t work_timeout;
+    uint8_t producer_sleep;
+    
+    while(1){
+        // This generates values for a new buffer element, waits until theres
+        // space in the buffer, then adds and item to the buffer
+        number = get_random_number(0, UINT8_MAX);
+        work_timeout = get_random_number(MIN_RANDOM_CONSUMER, MAX_RANDOM_CONSUMER);
+        producer_sleep = get_random_number(MIN_RANDOM_PRODUCER, MAX_RANDOM_PRODUCER);
+        
+        while(tasks_in_buffer == MAX_BUFFER_SIZE);
+        
+        pthread_mutex_lock(&mutex);
+        storage_buffer[tasks_in_buffer].number = number;
+        storage_buffer[tasks_in_buffer].work_timeout = work_timeout;
+        tasks_in_buffer++;
+        pthread_mutex_unlock(&mutex);
+        
+        printf("Producer adding number: %u. Consumers's delay will be %u seconds. Producer waiting %u seconds.\n", number, work_timeout, producer_sleep);
+        fflush(stdout);
+        
+        sleep(producer_sleep);
+    }
+
+    return 0;
+}
+
--- a/Assignments/Concurrency
+++ b/Assignments/Concurrency
@@ -0,0 +1,8 @@
+all: clean build
+	
+clean:
+	rm -f *.o
+	rm -f concurrency1
+	
+build:
+	gcc main.c mt19937ar.h -o concurrency1 -std=c99 -pthread
--- a/Assignments/Concurrency
+++ b/Assignments/Concurrency
@@ -0,0 +1,190 @@
+/* 
+   A C-program for MT19937, with initialization improved 2002/1/26.
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   Before using, initialize the state by using init_genrand(seed)  
+   or init_by_array(init_key, key_length).
+
+   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.                          
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions
+   are met:
+
+   1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+   2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+   3. The names of its contributors may not be used to endorse or promote 
+   products derived from this software without specific prior written 
+   permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+   Any feedback is very welcome.
+   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
+*/
+
+#include <stdio.h>
+
+/* Period parameters */  
+#define N 624
+#define M 397
+#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
+#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
+#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
+
+static unsigned long mt[N]; /* the array for the state vector  */
+static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
+
+/* initializes mt[N] with a seed */
+void init_genrand(unsigned long s)
+{
+	mt[0]= s & 0xffffffffUL;
+	for (mti=1; mti<N; mti++) {
+		mt[mti] = 
+			(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti); 
+		/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
+		/* In the previous versions, MSBs of the seed affect   */
+		/* only MSBs of the array mt[].                        */
+		/* 2002/01/09 modified by Makoto Matsumoto             */
+		mt[mti] &= 0xffffffffUL;
+		/* for >32 bit machines */
+	}
+}
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+/* slight change for C++, 2004/2/26 */
+void init_by_array(unsigned long init_key[], int key_length)
+{
+	int i, j, k;
+	init_genrand(19650218UL);
+	i=1; j=0;
+	k = (N>key_length ? N : key_length);
+	for (; k; k--) {
+		mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+			+ init_key[j] + j; /* non linear */
+		mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+		i++; j++;
+		if (i>=N) { mt[0] = mt[N-1]; i=1; }
+		if (j>=key_length) j=0;
+	}
+	for (k=N-1; k; k--) {
+		mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
+			- i; /* non linear */
+		mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+		i++;
+		if (i>=N) { mt[0] = mt[N-1]; i=1; }
+	}
+
+	mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */ 
+}
+
+/* generates a random number on [0,0xffffffff]-interval */
+unsigned long genrand_int32(void)
+{
+	unsigned long y;
+	static unsigned long mag01[2]={0x0UL, MATRIX_A};
+	/* mag01[x] = x * MATRIX_A  for x=0,1 */
+
+	if (mti >= N) { /* generate N words at one time */
+		int kk;
+
+		if (mti == N+1)   /* if init_genrand() has not been called, */
+			init_genrand(5489UL); /* a default initial seed is used */
+
+		for (kk=0;kk<N-M;kk++) {
+			y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+			mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
+		}
+		for (;kk<N-1;kk++) {
+			y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+			mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
+		}
+		y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
+		mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
+
+		mti = 0;
+	}
+  
+	y = mt[mti++];
+
+	/* Tempering */
+	y ^= (y >> 11);
+	y ^= (y << 7) & 0x9d2c5680UL;
+	y ^= (y << 15) & 0xefc60000UL;
+	y ^= (y >> 18);
+
+	return y;
+}
+
+/* generates a random number on [0,0x7fffffff]-interval */
+long genrand_int31(void)
+{
+	return (long)(genrand_int32()>>1);
+}
+
+/* generates a random number on [0,1]-real-interval */
+double genrand_real1(void)
+{
+	return genrand_int32()*(1.0/4294967295.0); 
+	/* divided by 2^32-1 */ 
+}
+
+/* generates a random number on [0,1)-real-interval */
+double genrand_real2(void)
+{
+	return genrand_int32()*(1.0/4294967296.0); 
+	/* divided by 2^32 */
+}
+
+/* generates a random number on (0,1)-real-interval */
+double genrand_real3(void)
+{
+	return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0); 
+	/* divided by 2^32 */
+}
+
+/* generates a random number on [0,1) with 53-bit resolution*/
+double genrand_res53(void) 
+{ 
+	unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6; 
+	return(a*67108864.0+b)*(1.0/9007199254740992.0); 
+} 
+/* These real versions are due to Isaku Wada, 2002/01/09 added */
+
+//int main(void)
+//{
+//	int i;
+//	unsigned long init[4]={0x123, 0x234, 0x345, 0x456}, length=4;
+//	init_by_array(init, length);
+//	printf("1000 outputs of genrand_int32()\n");
+//	for (i=0; i<1000; i++) {
+//		printf("%10lu ", genrand_int32());
+//		if (i%5==4) printf("\n");
+//	}
+//	printf("\n1000 outputs of genrand_real2()\n");
+//	for (i=0; i<1000; i++) {
+//		printf("%10.8f ", genrand_real2());
+//		if (i%5==4) printf("\n");
+//	}
+//	return 0;
+//}
--- a/Assignments/Concurrency
+++ b/Assignments/Concurrency
@@ -0,0 +1,5 @@
+Corwin Perren - Concurrency HW 1
+
+To make this program on the os server, cd into this directory and run "make".
+
+To run the program, type "./concurrency1" into the terminal and hit enter.