first commit

CS4210/CVS/Entries

@@ -0,0 +1,11 @@
+D/Homework 1////
+D/Lecture Slides////
+D/Project 1////
+D/Homework 2////
+D/Project 2////
+D/Readings////
+D/Tests////
+D/cs4210////
+D/Homework 3////
+D/Project 3////
+D/Homework 4////

CS4210/CVS/Entries.Extra

@@ -0,0 +1,11 @@
+D/Homework 1///////
+D/Lecture Slides///////
+D/Project 1///////
+D/Homework 2///////
+D/Project 2///////
+D/Readings///////
+D/Tests///////
+D/cs4210///////
+D/Homework 3///////
+D/Project 3///////
+D/Homework 4///////

CS4210/CVS/Entries.Extra.Old

@@ -0,0 +1,10 @@
+D/Homework 1///////
+D/Lecture Slides///////
+D/Project 1///////
+D/Homework 2///////
+D/Project 2///////
+D/Readings///////
+D/Tests///////
+D/cs4210///////
+D/Homework 3///////
+D/Project 3///////

CS4210/CVS/Entries.Old

@@ -0,0 +1,10 @@
+D/Homework 1////
+D/Lecture Slides////
+D/Project 1////
+D/Homework 2////
+D/Project 2////
+D/Readings////
+D/Tests////
+D/cs4210////
+D/Homework 3////
+D/Project 3////

CS4210/CVS/Repository

@@ -0,0 +1 @@
+CS4210

CS4210/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Homework 1/CVS/Entries

@@ -0,0 +1,4 @@
+/Homework1.pdf/1.1/Thu Jan 26 02:09:58 2006/-kb/
+/answers.txt/1.2/Mon Jan 30 07:34:15 2006//
+/question1.c/1.1/Mon Jan 30 06:01:52 2006//
+D

CS4210/Homework 1/CVS/Entries.Extra

@@ -0,0 +1,3 @@
+/Homework1.pdf////*///
+/answers.txt////*///
+/question1.c////*///

CS4210/Homework 1/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Homework 1

CS4210/Homework 1/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Homework 1/answers.txt

@@ -0,0 +1,76 @@
+Jose Caban
+gtg184g
+CS4210 HW#1
+
+Question 1:
+-----------
+
+struct RecMutex {
+    pthread_mutex_t mutex;
+    pthread_cond_t locked;
+    int lock;
+    int owner; 
+};
+
+int rec_mutex_lock(RecMutex *rmutex) {        
+    
+    //CurrentThread is owner, increment lock
+    if (rmutex->owner == CurrentThread()) {
+        rmutex->lock++;
+        return 0;
+    } else {
+        //Lock the mutex
+        pthread_mutex_lock(&(rmutex->mutex));
+        
+        //Wait until the lock is free     
+        while (rmutex->lock != 0) {
+            pthread_cond_wait( &(rmutex->locked), &(rmutex->mutex) );
+        }
+        
+        //Set structure paramaters
+        rmutex->owner = CurrentThread();
+        rmutex->lock = 1;
+        pthread_mutex_unlock(&(rmutex->mutex));
+        
+        return 0; //Everything is A-OK
+    }
+}
+
+int rec_mutex_unlock(RecMutex *rmutex) {
+    if (rmutex->owner == CurrentThread()) {
+        rmutex->lock--;   
+    } else {
+        return -2; //called without reason = error
+    }
+    
+    if (rmutex->lock == 0) {
+        rmutex->owner = -1;
+        pthread_cond_signal(&(rmutex->locked));
+    } else if (rmutex->lock < 0) {
+        return -1; //lock is broken = error
+    }
+    
+    return 0; //everything is A-OK       
+}
+
+int rec_mutex_init(RecMutex *rmutex) {
+    pthread_mutex_init(&(rmutex->mutex), NULL);
+    pthread_cond_init(&(rmutex->locked),NULL);
+    rmutex->lock = 0;
+    rmutex->owner = -1;
+    
+    return 0;
+}
+
+Question 2:
+-----------
+
+a) No context switch is needed (everything done at user level).  Very fast since only a stack and program counter need to be switched.
+b) The LWP has to be switched.  This is relatively slow as it has to switch the process control block (with associated register data), accounting information, and memory information.
+c) Full Context switch is needed.  Slowest of these 4 situations.  The memory address space has to be switched to that of the other process in addition to all the other contents of the LWP's associated with that process.
+d) Faster than b and c (but slower than a) as it just requires switching between kernel threads.  This basically means switching a small data structure and stack and is relatively fast.
+
+Question 3:
+-----------
+
+Possible.  Requires change to unlock return values to avoid using C++ local variables. I just didn't figure out the macro on my own, so I can't write it here out of pride :(

CS4210/Homework 1/question1.c

@@ -0,0 +1,56 @@
+struct RecMutex {
+    pthread_mutex_t mutex;
+    pthread_cond_t locked;
+    int lock;
+    int owner; 
+};
+
+int rec_mutex_lock(RecMutex *rmutex) {        
+    
+    //CurrentThread is owner, increment lock
+    if (rmutex->owner == CurrentThread()) {
+        rmutex->lock++;
+        return 0;
+    } else {
+        //Lock the mutex
+        pthread_mutex_lock(&(rmutex->mutex));
+        
+        //Wait until the lock is free     
+        while (rmutex->lock != 0) {
+            pthread_cond_wait( &(rmutex->locked), &(rmutex->mutex) );
+        }
+        
+        //Set structure paramaters
+        rmutex->owner = CurrentThread();
+        rmutex->lock = 1;
+        pthread_mutex_unlock(&(rmutex->mutex));
+        
+        return 0; //Everything is A-OK
+    }
+}
+
+int rec_mutex_unlock(RecMutex *rmutex) {
+    if (rmutex->owner == CurrentThread()) {
+        rmutex->lock--;   
+    } else {
+        return -2; //called without reason = error
+    }
+    
+    if (rmutex->lock == 0) {
+        rmutex->owner = -1;
+        pthread_cond_signal(&(rmutex->locked));
+    } else if (rmutex->lock < 0) {
+        return -1; //lock is broken = error
+    }
+    
+    return 0; //everything is A-OK       
+}
+
+int rec_mutex_init(RecMutex *rmutex) {
+    pthread_mutex_init(&(rmutex->mutex), NULL);
+    pthread_cond_init(&(rmutex->locked),NULL);
+    rmutex->lock = 0;
+    rmutex->owner = -1;
+    
+    return 0;
+}

CS4210/Homework 2/CVS/Entries

@@ -0,0 +1,3 @@
+/Homework2.pdf/1.1/Wed Feb 22 16:18:23 2006/-kb/
+/hw2_gtg184g_answers.txt/1.2/Fri Feb 24 06:03:39 2006//
+D

CS4210/Homework 2/CVS/Entries.Extra

@@ -0,0 +1,2 @@
+/Homework2.pdf////*///
+/hw2_gtg184g_answers.txt////*///

CS4210/Homework 2/CVS/Entries.Extra.Old

@@ -0,0 +1,2 @@
+/Homework2.pdf////*///
+/hw2_gtg184g_answers.txt////*///

CS4210/Homework 2/CVS/Entries.Old

@@ -0,0 +1,3 @@
+/Homework2.pdf/1.1/Wed Feb 22 16:18:23 2006/-kb/
+/hw2_gtg184g_answers.txt/1.1/Fri Feb 24 02:21:02 2006//
+D

CS4210/Homework 2/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Homework 2

CS4210/Homework 2/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Homework 2/hw2_gtg184g_answers.txt

@@ -0,0 +1,45 @@
+Question 1:
+-----------
+
+Task 1: CPU bound
+Task 2-11: I/O bound tasks
+CS: context switch
+
+Assumptions:
+    1) Queue is in above order
+    2) Scheduler is not preemptive (will not switch out tasks waiting on I/O)
+    3) Executes next "ready" thread in FCFS order
+
+a) 1, CS, 2, CS, 3, CS, 4, CS, 5, CS, 6, CS, 7, CS, 8, CS, 9, CS, 10, CS, 11, CS, 1, CS, 2, CS, 3, CS, 4, ...
+
+In this case, the quanta is 1 ms, so the I/O bound threads will not be wasting CPU time by using a 10ms quanta when only using 1ms of CPU time.  The .1 ms of context switch time becomes the real drawback here.  In this case, the CPU will ALWAYS be utilized (discounting context switch time).  The utilization will be 100% (assuming the context switch counts as CPU utilization).  It will be 1/(quanta+context Switch time) utilization = 1/1.1 ~= 90.9%  
+
+b) 1, CS, 2, CS, 3, CS, 4, CS, 5, CS, 6, CS, 7, CS, 8, CS, 9, CS, 10, CS, 11, CS, 1, CS, 2, CS, 3, CS, 4, ...
+
+In this case, the CPU will be under-utilized.  Tasks 2-11 will use a single millisecond of CPU time and then sit there, idle.  Because of this, 9ms out of 10ms will be wasted for the 10 I/O bound tasks and the CPU bound task will use its full 10ms on the CPU.  If the RR scheduler is fully preemptive, as in Windows NT4+ and Linux 2.6+, the I/O threads will be switched out as soon as they finish their CPU usage and make the I/O request.  If this is the case, then the CPU usage will be 100% (assuming the context switch counts as CPU utilization) or (10+10)/(11*.1 + 10 + 10) ~= 94.7% if the context switch does not count as CPU util.  If the former is the case, then for 10 of the 11 tasks, 9ms will be wasted CPU time.  In this case, the utilization will be (10+10)/(110+11*.1) ~= 18% (context switches count as wasted time).
+
+c) If the scheduler is scheduling to increase CPU utilization with parameters such as in case b, the I/O bound tasks will get starved.  However, if it schedules to increase I/O device utilization, the CPU will be wasted.  In case a, the quanta is short enough with these specific tasks, that both are being utilized fully.  However, the context switch time will become a drawback.
+
+Question 2:
+-----------
+a) Deadlock.
+
+b) No Deadlock.
+
+c) No Deadlock.
+
+d) Deadlock.
+
+e) Deadlock.
+
+Question 3:
+-----------
+
+"In Solaris, one side-effect of preemption is that if the target thread is blocked in the kernel executing a system call, it will be interrupted by SIGLWP, and the system call will be re-started when the thread resumes execution after the preemption. This is only a problem if the system call should not be re-started."
+Basically, the process will be switched, and the system call will be restarted when the process gets processor time again.
+
+In Psyche, the system call mechanism is the "protected procedure call" mechanism.  When a thread makes a blocking system call that can be completed in a single quanta, it will get a "reply from PPC" and continue execution.  However, if it is preempted to be switched while waiting on the call, it will be switched and as soon as it gets scheduled again, it will get a "blocked in the kernel" interrupt and an "unblocked in kernel" interrupt when the call completes and it can continue executing.
+In short, the system call does not need to be restarted.
+
+
+

CS4210/Homework 3/CVS/Entries

@@ -0,0 +1,4 @@
+/Homework3.pdf/1.1/Sat Apr  1 23:47:26 2006/-kb/
+/Book1.xls/1.1/Sun Apr  2 20:43:55 2006/-kb/
+/hw3ans.doc/1.1/Sun Apr  2 22:32:42 2006/-kb/
+D

CS4210/Homework 3/CVS/Entries.Extra

@@ -0,0 +1,3 @@
+/Homework3.pdf////*///
+/Book1.xls////*///
+/hw3ans.doc////*///

CS4210/Homework 3/CVS/Entries.Extra.Old

@@ -0,0 +1,3 @@
+/Homework3.pdf////*///
+/Book1.xls////*///
+/hw3ans.doc////*///

CS4210/Homework 3/CVS/Entries.Old

@@ -0,0 +1,4 @@
+/Homework3.pdf/1.1/Sat Apr  1 23:47:26 2006/-kb/
+/Book1.xls/0/dummy timestamp/-kb/
+/hw3ans.doc/0/dummy timestamp/-kb/
+D

CS4210/Homework 3/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Homework 3

CS4210/Homework 3/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Homework 4/CVS/Entries

@@ -0,0 +1,3 @@
+/Homework4.pdf/1.1/Tue Apr 25 21:31:40 2006/-kb/
+/hw4ans.txt/1.1/Tue Apr 25 23:31:07 2006//
+D

CS4210/Homework 4/CVS/Entries.Extra

@@ -0,0 +1,2 @@
+/Homework4.pdf////*///
+/hw4ans.txt////*///

CS4210/Homework 4/CVS/Entries.Extra.Old

@@ -0,0 +1,2 @@
+/hw4ans.txt////*///
+/Homework4.pdf////*///

CS4210/Homework 4/CVS/Entries.Old

@@ -0,0 +1,3 @@
+/hw4ans.txt/0/dummy timestamp//
+/Homework4.pdf/0/dummy timestamp/-kb/
+D

CS4210/Homework 4/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Homework 4

CS4210/Homework 4/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Homework 4/hw4ans.txt

@@ -0,0 +1,67 @@
+Question 1
+----------
+
+In an MT architecture, the multiple threads share a single address space and use atomic operations and mutexes to access shared memory.  However, in order for the MT model to work efficiently, the Operating System must support some sort of kernel threads to allow context switching between threads when blocking for I/O.  If the OS does not support kernel threads, then the server's performance will be negatively affected.
+
+The AMPED architecture brings together the performance characteristics of a SPED architecture while avoid the problems associated with a lack of asynchronous disk I/O provided by the Operating System.  The implementation of the model involves multiple helper processes to perform blocking disk I/O.  These helper processes can be separate processes communicating through IPC or kernel threads, the implementation simply requires that it allows parallel completion of tasks during blocking I/O calls.
+
+In terms of disk I/O, neither MT nor AMPED cause a halt in server operations due to disk I/O, assuming kernel thread support in the case of the MT server.  Both the MT and AMPED models can make 1 disk request per thread or helper, respectively.
+
+Memory usage is higher on an MT server, as each thread takes up some amount of memory and kernel resources.  In the AMPED model, the helper functions take up their own memory (be it due to multiple process or threads), but they are required on a per disk operation basis not on a per connection basis as in the MT model.
+
+The AMPED model has easier information gathering about requests to increase performance or for accounting than the MT model.  It also avoids the need for synchronization on cache wheras the MT model can use a single cache but requires synchronization.  Long lived connections cost very little to an AMPED server, simply a file descriptor.  The MT model loses an entire thread to some guy who refuses to upgrade to broadband or lives in the middle of nowhere.  However, the commication on the AMPED model requires the use of IPC (if using multiprocess helpers), which can become limiting.
+
+Question 2
+----------
+
+a) Consider the following sequence of operations:
+ P1: W(x)1    W(x)3
+ P2:          W(x)2
+ P3:                  R(x)3 R(x)2
+ P4:                  R(x)2 R(x)3
+ 
+  The execution is causally consistent.  The causal consistency (according to the slides) comes from a "write [that] comes after a read that returned the value of the other write".  Writes that are concurrently executed can be seen in different orders on different machines.
+
+  Change to make it non causally consistent:
+  P1: W(x)1    
+  P2:          R(x)0 W(x)2
+  P3:                  
+  P4:                  
+  
+b) Consider the following sequence of operations:
+ P1: W(x)1         W(x)3
+ P2:        R(x)1          R(x)1   R(x)3
+Is this execution strictly consistent? Add or modify an event to change the answer.
+
+ No way, Jose (haha, I made a funny).  This is totally not strictly consistent. It's not strict at all.  Pretty Lazy, I'd say.
+ 
+  P1: W(x)1         W(x)3
+  P2:        R(x)1          R(x)3   R(x)3
+ 
+ Now that's strict.
+ 
+c) Consider the following sequence of operations:
+ P1: W(x)1    W(x)3    S
+ P2:                   R(x)3 S       R(x)1
+ Is this execution weakly consistent? Add or modify an event to change the answer.
+ 
+  Heaven's no.  Totally not weakly consistent.
+  
+  P1: W(x)1    W(x)3    S
+  P2:                   R(x)3 S    R(x)3
+ 
+ Now it's weakly consistent.
+ 
+d) Consider the following sequence of operations:
+ P1: L    W(x)1    W(x)3 U
+ P2:               L     R(x)3    U     R(x)1
+ Is this execution release consistent? Add or modify an event to change the answer.
+ 
+ No, though it is POSSIBLE that it is, it'd be totally weird that the Read that was just 3 on P2 is suddenly 1 after the unlock, but hey implementations are weird.
+ 
+ P1: L    W(x)1    W(x)3 U
+ P2:               L     R(x)3    U     R(x)3
+ 
+ That is mos def release consistent.
+
+  

CS4210/Lecture Slides/CVS/Entries

@@ -0,0 +1,26 @@
+/01-Intro.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/02-Overview.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/03-Birrell.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/04-Multithreading.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/05-Pthreads_Intro.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/06-ContextSwitch.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/07-Scheduling.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/08-Synchronization.pdf/1.1/Fri Feb 24 00:33:40 2006/-kb/
+/09-Deadlocks.pdf/1.1/Fri Feb 24 00:33:47 2006/-kb/
+/10-KernelThreads.pdf/1.1/Fri Feb 24 00:33:50 2006/-kb/
+/11-UserLevelThreads.pdf/1.1/Fri Feb 24 00:33:54 2006/-kb/
+/12-Psyche.pdf/1.1/Fri Feb 24 00:33:58 2006/-kb/
+/13-Spinlock.pdf/1.1/Sun Apr  2 00:32:00 2006/-kb/
+/14-ReviewSlides.pdf/1.1/Sun Apr  2 00:32:08 2006/-kb/
+/15-Webserver.pdf/1.1/Sun Apr  2 00:32:14 2006/-kb/
+/17-UserIPC.pdf/1.1/Sun Apr  2 00:32:31 2006/-kb/
+/18-RPC.pdf/1.1/Sun Apr  2 00:32:38 2006/-kb/
+/20-JavaRMI.pdf/1.1/Tue Apr 25 21:52:55 2006/-kb/
+/21-DFS.pdf/1.1/Tue Apr 25 21:53:04 2006/-kb/
+/22-Sprite.pdf/1.1/Tue Apr 25 21:53:08 2006/-kb/
+/23-DSM.pdf/1.1/Tue Apr 25 21:53:26 2006/-kb/
+/24-Virtualization.pdf/1.1/Tue Apr 25 21:53:31 2006/-kb/
+/ch18-trans.pdf/1.1/Tue Apr 25 21:53:12 2006/-kb/
+/threads_hotos_2003_slides.pdf/1.1/Sun Apr  2 00:32:25 2006/-kb/
+/xen-io.pdf/1.1/Tue Apr 25 21:53:36 2006/-kb/
+D

CS4210/Lecture Slides/CVS/Entries.Extra

@@ -0,0 +1,25 @@
+/01-Intro.pdf////*///
+/02-Overview.pdf////*///
+/03-Birrell.pdf////*///
+/04-Multithreading.pdf////*///
+/05-Pthreads_Intro.pdf////*///
+/06-ContextSwitch.pdf////*///
+/07-Scheduling.pdf////*///
+/08-Synchronization.pdf////*///
+/09-Deadlocks.pdf////*///
+/10-KernelThreads.pdf////*///
+/11-UserLevelThreads.pdf////*///
+/12-Psyche.pdf////*///
+/13-Spinlock.pdf////*///
+/14-ReviewSlides.pdf////*///
+/15-Webserver.pdf////*///
+/17-UserIPC.pdf////*///
+/18-RPC.pdf////*///
+/20-JavaRMI.pdf////*///
+/21-DFS.pdf////*///
+/22-Sprite.pdf////*///
+/23-DSM.pdf////*///
+/24-Virtualization.pdf////*///
+/ch18-trans.pdf////*///
+/threads_hotos_2003_slides.pdf////*///
+/xen-io.pdf////*///

CS4210/Lecture Slides/CVS/Entries.Extra.Old

@@ -0,0 +1,25 @@
+/01-Intro.pdf////*///
+/02-Overview.pdf////*///
+/03-Birrell.pdf////*///
+/04-Multithreading.pdf////*///
+/05-Pthreads_Intro.pdf////*///
+/06-ContextSwitch.pdf////*///
+/07-Scheduling.pdf////*///
+/08-Synchronization.pdf////*///
+/09-Deadlocks.pdf////*///
+/10-KernelThreads.pdf////*///
+/11-UserLevelThreads.pdf////*///
+/12-Psyche.pdf////*///
+/13-Spinlock.pdf////*///
+/14-ReviewSlides.pdf////*///
+/15-Webserver.pdf////*///
+/17-UserIPC.pdf////*///
+/18-RPC.pdf////*///
+/20-JavaRMI.pdf////*///
+/21-DFS.pdf////*///
+/22-Sprite.pdf////*///
+/23-DSM.pdf////*///
+/24-Virtualization.pdf////*///
+/ch18-trans.pdf////*///
+/threads_hotos_2003_slides.pdf////*///
+/xen-io.pdf////*///

CS4210/Lecture Slides/CVS/Entries.Old

@@ -0,0 +1,26 @@
+/01-Intro.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/02-Overview.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/03-Birrell.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/04-Multithreading.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/05-Pthreads_Intro.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/06-ContextSwitch.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/07-Scheduling.pdf/1.1/Mon Jan 30 06:01:52 2006/-kb/
+/08-Synchronization.pdf/1.1/Fri Feb 24 00:33:40 2006/-kb/
+/09-Deadlocks.pdf/1.1/Fri Feb 24 00:33:47 2006/-kb/
+/10-KernelThreads.pdf/1.1/Fri Feb 24 00:33:50 2006/-kb/
+/11-UserLevelThreads.pdf/1.1/Fri Feb 24 00:33:54 2006/-kb/
+/12-Psyche.pdf/1.1/Fri Feb 24 00:33:58 2006/-kb/
+/13-Spinlock.pdf/0/dummy timestamp/-kb/
+/14-ReviewSlides.pdf/0/dummy timestamp/-kb/
+/15-Webserver.pdf/0/dummy timestamp/-kb/
+/17-UserIPC.pdf/0/dummy timestamp/-kb/
+/18-RPC.pdf/0/dummy timestamp/-kb/
+/20-JavaRMI.pdf/0/dummy timestamp/-kb/
+/21-DFS.pdf/0/dummy timestamp/-kb/
+/22-Sprite.pdf/0/dummy timestamp/-kb/
+/23-DSM.pdf/0/dummy timestamp/-kb/
+/24-Virtualization.pdf/0/dummy timestamp/-kb/
+/ch18-trans.pdf/0/dummy timestamp/-kb/
+/threads_hotos_2003_slides.pdf/0/dummy timestamp/-kb/
+/xen-io.pdf/0/dummy timestamp/-kb/
+D

CS4210/Lecture Slides/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Lecture Slides

CS4210/Lecture Slides/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Project 1/.cvsignore

@@ -0,0 +1,6 @@
+l33t_server.vcproj.CRYSTAL.AssKoala.user
+l33t_server.suo
+Debug
+Release
+l33t_server.ncb
+bin

CS4210/Project 1/.picasa.ini

@@ -0,0 +1,3 @@
+[pwner.jpg]
+faces=rect64(6bca0831aaaa4ccd),ffffffffffffffff
+backuphash=9443

CS4210/Project 1/CVS/Entries

@@ -0,0 +1,19 @@
+/l33t_server.sln/1.1/Thu Jan 26 02:43:32 2006//
+/makefile.win32/1.1/Mon Jan 23 04:13:37 2006//
+/pthreadGC2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+/pthreadGCE2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+/pthreadVC2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+/pthreadVSE2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+D/asn////
+D/bin////
+D/client////
+D/home////
+D/src////
+/l33t_server.vcproj/1.14/Sat Feb 18 00:35:20 2006//
+/pwner.jpg/1.3/Sun Feb 19 07:32:36 2006/-kb/
+D/docs////
+D/testFiles////
+/.cvsignore/1.4/Tue Feb 21 03:42:45 2006//
+D/turn-in////
+/l33t_server.conf/1.16/Tue Mar 28 00:07:49 2006//
+/makefile/1.20/Tue Mar 28 00:07:49 2006//

CS4210/Project 1/CVS/Entries.Extra

@@ -0,0 +1,19 @@
+/l33t_server.sln////*///
+/makefile.win32////*///
+/pthreadGC2.dll////*///
+/pthreadGCE2.dll////*///
+/pthreadVC2.dll////*///
+/pthreadVSE2.dll////*///
+D/asn///////
+D/bin///////
+D/client///////
+D/home///////
+D/src///////
+/l33t_server.vcproj////*///
+/pwner.jpg////*///
+D/docs///////
+D/testFiles///////
+/.cvsignore////*///
+D/turn-in///////
+/l33t_server.conf////*///
+/makefile////*///

CS4210/Project 1/CVS/Entries.Extra.Old

@@ -0,0 +1,19 @@
+/l33t_server.sln////*///
+/makefile.win32////*///
+/pthreadGC2.dll////*///
+/pthreadGCE2.dll////*///
+/pthreadVC2.dll////*///
+/pthreadVSE2.dll////*///
+D/asn///////
+D/bin///////
+D/client///////
+D/home///////
+D/src///////
+/l33t_server.vcproj////*///
+/pwner.jpg////*///
+D/docs///////
+D/testFiles///////
+/l33t_server.conf////*///
+/.cvsignore////*///
+/makefile////*///
+D/turn-in///////

CS4210/Project 1/CVS/Entries.Old

@@ -0,0 +1,19 @@
+/l33t_server.sln/1.1/Thu Jan 26 02:43:32 2006//
+/makefile.win32/1.1/Mon Jan 23 04:13:37 2006//
+/pthreadGC2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+/pthreadGCE2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+/pthreadVC2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+/pthreadVSE2.dll/1.1/Thu Feb  2 03:32:41 2006/-kb/
+D/asn////
+D/bin////
+D/client////
+D/home////
+D/src////
+/l33t_server.vcproj/1.14/Sat Feb 18 00:35:20 2006//
+/pwner.jpg/1.3/Sun Feb 19 07:32:36 2006/-kb/
+D/docs////
+D/testFiles////
+/l33t_server.conf/1.15/Tue Feb 21 00:27:18 2006//
+/.cvsignore/1.4/Tue Feb 21 03:42:45 2006//
+/makefile/1.19/Tue Feb 21 03:42:45 2006//
+D/turn-in////

CS4210/Project 1/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Project 1

CS4210/Project 1/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Project 1/asn/CVS/Entries

@@ -0,0 +1,2 @@
+/Project1.pdf/1.1/Mon Jan 23 04:13:37 2006/-kb/
+D

CS4210/Project 1/asn/CVS/Entries.Extra

@@ -0,0 +1 @@
+/Project1.pdf////*///

CS4210/Project 1/asn/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Project 1/asn

CS4210/Project 1/asn/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Project 1/bin/.cvsignore

@@ -0,0 +1,2 @@
+*.o
+*.obj

CS4210/Project 1/bin/CVS/Entries

@@ -0,0 +1,2 @@
+/.cvsignore/1.1/Mon Jan 23 04:13:37 2006//
+D

CS4210/Project 1/bin/CVS/Entries.Extra

@@ -0,0 +1 @@
+/.cvsignore////*///

CS4210/Project 1/bin/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Project 1/bin

CS4210/Project 1/bin/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS

CS4210/Project 1/client/.cvsignore

@@ -0,0 +1,11 @@
+client.vcproj.CRYSTAL.AssKoala.user
+client.suo
+client.ncb
+Debug
+Release
+pthreadVC2.dll
+pthreadVSE2.dll
+pthreadVC2.lib
+pthreadVSE2.lib
+pthreadGC2.dll
+pthreadGCE2.dll

CS4210/Project 1/client/CVS/Entries

@@ -0,0 +1,8 @@
+/client.sln/1.2/Tue Feb 14 00:39:47 2006//
+D/src////
+/client.vcproj/1.8/Sun Feb 19 00:51:40 2006//
+D/tests////
+/.cvsignore/1.3/Mon Feb 20 16:12:03 2006//
+/testFile.xml/1.5/Mon Feb 20 21:51:38 2006//
+D/results////
+/makefile/1.7/Tue Feb 21 03:42:45 2006//

CS4210/Project 1/client/CVS/Entries.Extra

@@ -0,0 +1,8 @@
+/client.sln////*///
+D/src///////
+/client.vcproj////*///
+D/tests///////
+/.cvsignore////*///
+/testFile.xml////*///
+D/results///////
+/makefile////*///

CS4210/Project 1/client/CVS/Entries.Extra.Old

@@ -0,0 +1,9 @@
+/client.sln////*///
+D/src///////
+/client.vcproj////*///
+D/tests///////
+/.cvsignore////*///
+/testFile.xml////*///
+D/results///////
+/makefile////*///
+D/bin///////

CS4210/Project 1/client/CVS/Entries.Old

@@ -0,0 +1,9 @@
+/client.sln/1.2/Tue Feb 14 00:39:47 2006//
+D/src////
+/client.vcproj/1.8/Sun Feb 19 00:51:40 2006//
+D/tests////
+/.cvsignore/1.3/Mon Feb 20 16:12:03 2006//
+/testFile.xml/1.5/Mon Feb 20 21:51:38 2006//
+D/results////
+/makefile/1.7/Tue Feb 21 03:42:45 2006//
+D/bin////

CS4210/Project 1/client/CVS/Repository

@@ -0,0 +1 @@
+CS4210/Project 1/client

CS4210/Project 1/client/CVS/Root

@@ -0,0 +1 @@
+:ext:asskoala@192.168.0.3:/usr/_CVS