From 0cc94a7672bf3a025c91ccf8ab9193a1ff3da360 Mon Sep 17 00:00:00 2001
From: Marius Tolzmann <tolzmann@molgen.mpg.de>
Date: Wed, 10 Jun 2015 23:59:37 +0200
Subject: [PATCH] Repository: Minor cleanup

---
 .gitignore       |  3 ---
 CONCEPT          | 39 ---------------------------------
 Makefile         |  1 -
 doc/fairness.tex | 57 ------------------------------------------------
 4 files changed, 100 deletions(-)
 delete mode 100644 CONCEPT
 delete mode 100644 doc/fairness.tex

diff --git a/.gitignore b/.gitignore
index d5cd7fc6..14d2c8ce 100644
--- a/.gitignore
+++ b/.gitignore
@@ -24,9 +24,6 @@ test_mx_util
 test_mx_log
 test_mx_mysql
 
-doc/fairness.aux
-doc/fairness.log
-doc/fairness.pdf
 *~
 
 gmon.out
diff --git a/CONCEPT b/CONCEPT
deleted file mode 100644
index 0156d700..00000000
--- a/CONCEPT
+++ /dev/null
@@ -1,39 +0,0 @@
-
-
-
-phase 1:
-
-- simple q+exec
-- first come, first serve
-
-- data:
-
-  - who?
-    - username
-
-  - job?
-    - jobname
-    
-  - task?
-    - pwd (absolute path, amd fixed)
-    - command
-      - argc
-      - argv (to strring)
-    - stdout (absolute path, amd fixed)
-    - stderr (absolute path, amd fixed)
-
-
-= CLIENT =
-
-  - write directly into the database
-
-  - setuid (to mxquser) to get connection information via my.cnf file
-    - host
-    - user
-    - password
-
-
-phase 2:
-
-- host selectors
-
diff --git a/Makefile b/Makefile
index 57e10012..5928880e 100644
--- a/Makefile
+++ b/Makefile
@@ -1,4 +1,3 @@
-
 MXQ_VERSION_MAJOR = 0
 MXQ_VERSION_MINOR = 5
 MXQ_VERSION_PATCH = 1
diff --git a/doc/fairness.tex b/doc/fairness.tex
deleted file mode 100644
index b99d2398..00000000
--- a/doc/fairness.tex
+++ /dev/null
@@ -1,57 +0,0 @@
-\documentclass{article}
-\usepackage{amsmath}
-\usepackage{amstext}
-
-\begin{document}
-
-Available ressources defined by every host:\\
-\(S_H =\) total number of slots available on host (number of cores)\\
-\(M_H =\) total amount of memory available on host
-
-Needed ressources defined by every job/task:\\
-\(S_J =\) minimum number of slots needed by task (number of threads)\\
-\(M_J =\) total amount of memory needed by task (total for all threads)
-
-Calculated resources for memory per slot available or needed:\\
-\(M_S =\) per slot amount of memory available on host\\
-\(M_T =\) per slot (thread)  amount of memory needed by task
-
-\begin{align}
-M_S &= \frac{M_H}{S_H}\\
-M_T &= \frac{M_J}{S_J}
-\end{align}
-
-\(F_O =\) factor of overcommitted memory if job would run on host
-\begin{equation}
-\begin{split}
-F_O &= \frac{M_T}{M_S} = \frac{\frac{M_J}{S_J}}{\frac{M_H}{S_H}}\\
-F_O &= \frac{M_J S_H}{S_J M_H}
-\end{split}
-\end{equation}
-
-\(M_O = \) maximum amount of memory available for a job:
-\begin{equation}
-\begin{split}
-M_O &= \frac{M_H}{F_O} = \frac{M_H}{\frac{M_J S_H}{S_J M_H}}\\
-M_O &= \frac{{M_H}^2 S_J}{M_J S_H}
-\end{split}
-\end{equation}
-
-\(S_P = \) number of slots a job can start with \(M_O\) memory:
-\begin{equation}
-\begin{split}
-S_P &= \frac{M_O}{M_T} = \frac{\frac{{M_H}^2 S_J}{M_J S_H}}{M_T}\\
-S_P &= \frac{{M_H}^2 S_J}{M_J S_H} \frac{S_J}{M_J}\\
-S_P &= \frac{{M_H}^2 {S_J}^2}{{M_J}^2 S_H}
-\end{split}
-\end{equation}
-
-\(S_O = \) maximum number of slots a job is allowed to use:
-\begin{equation}
-\begin{split}
-S_O &= \left \lfloor \frac{\lfloor (S_P + 0.5) \rfloor}{S_J} \right\rfloor \cdot S_J\\
-S_O &= \left \lfloor \frac{\left\lfloor\left(\frac{{M_H}^2 {S_J}^2}{{M_J}^2 S_H} + 0.5 \right)\right\rfloor}{S_J} \right\rfloor \cdot S_J
-\end{split}
-\end{equation}
-
-\end{document}