|
|
@@ -1,9 +1,307 @@
|
|
|
package me.yoqi.servermanager;
|
|
|
|
|
|
+import java.io.BufferedReader;
|
|
|
+import java.io.ByteArrayInputStream;
|
|
|
+import java.io.File;
|
|
|
+import java.io.FileInputStream;
|
|
|
+import java.io.FileReader;
|
|
|
+import java.io.IOException;
|
|
|
+import java.io.InputStream;
|
|
|
+import java.io.InputStreamReader;
|
|
|
+import java.util.ArrayList;
|
|
|
+import java.util.HashMap;
|
|
|
+import java.util.List;
|
|
|
+import java.util.Map;
|
|
|
+
|
|
|
+import com.google.common.base.Charsets;
|
|
|
+
|
|
|
+/**
|
|
|
+ * Created by mou.sunm on 2018/07/02.
|
|
|
+ */
|
|
|
public class Main {
|
|
|
+ // 参数
|
|
|
+ public static final double alpha = 10.;
|
|
|
+ public static final double beta = 0.5;
|
|
|
+ public static final int T = 98;
|
|
|
+ public static final int EXEC_LIMIT = 100000;
|
|
|
+
|
|
|
+ // 静态数据
|
|
|
+ private int n; // app数
|
|
|
+ private int N; // inst数
|
|
|
+ private int m; // machine数
|
|
|
+ private int k; // 资源种类
|
|
|
+ private List<Integer> cpuIter; // T个时刻的cpu资源
|
|
|
+ private Map<String, Integer> appIndex;
|
|
|
+ private Map<String, Integer> machineIndex;
|
|
|
+ private String[] apps;
|
|
|
+ private String[] machines;
|
|
|
+ private Map<String, Integer> inst2AppIndex;
|
|
|
+
|
|
|
+ private double[][] appResources;// app
|
|
|
+ private double[][] machineResources;// 主机
|
|
|
+ private Map<Integer, Integer>[] appInterference;// 限制条件
|
|
|
+
|
|
|
+ // 动态数据
|
|
|
+ private Map<String, Integer> inst2Machine;// 部署
|
|
|
+ private double[][] machineResourcesUsed;
|
|
|
+ private Map<Integer, Integer>[] machineHasApp;
|
|
|
+
|
|
|
+ /**
|
|
|
+ * 先对disk排序，然后first fit
|
|
|
+ */
|
|
|
+ private void run() {
|
|
|
+ // 未部署
|
|
|
+
|
|
|
+ while(inst2Machine.size()>0) {
|
|
|
+
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ private void sortInstanceByDisk(ArrayList<Integer> instance) {
|
|
|
+ for(int i=0;i<instance.size();i++) {
|
|
|
+ int appIt = inst2AppIndex.get(i);
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ private void sort(ArrayList<Integer> list) {
|
|
|
+
|
|
|
+ }
|
|
|
+
|
|
|
+ // 读取数据
|
|
|
+ protected void init(BufferedReader bufferedReader) throws IOException {
|
|
|
+ /*
|
|
|
+ * Preprocessing: cat *.csv to one file as: n app_resources.csv m
|
|
|
+ * machine_resources.csv N instance_deploy.csv iterference_cnt
|
|
|
+ * app_interference.csv judge framework
|
|
|
+ */
|
|
|
+ /** cpuIter */
|
|
|
+ cpuIter = new ArrayList<Integer>();// 1,2,3....98
|
|
|
+ for (int i = 0; i < T; i++)
|
|
|
+ cpuIter.add(i);
|
|
|
+ /** Read app_resources */
|
|
|
+ n = Integer.parseInt(bufferedReader.readLine());// 9338
|
|
|
+ apps = new String[n];
|
|
|
+ for (int i = 0; i < n; i++) {// 循环app表每一行
|
|
|
+ // appId,resources
|
|
|
+ String line = bufferedReader.readLine();
|
|
|
+ String[] parts = line.split(",", -1);
|
|
|
+ List<Double> resources = new ArrayList<Double>();
|
|
|
+ for (String x : parts[1].split("\\|", -1))// cpu
|
|
|
+ resources.add(Double.parseDouble(x));
|
|
|
+ for (String x : parts[2].split("\\|", -1))// mem
|
|
|
+ resources.add(Double.parseDouble(x));
|
|
|
+ for (int j = 3; j < parts.length; j++) // disk/P/M/PM
|
|
|
+ resources.add(Double.parseDouble(parts[j]));
|
|
|
+ if (i == 0) {
|
|
|
+ k = resources.size();
|
|
|
+ appIndex = new HashMap<String, Integer>();
|
|
|
+ appResources = new double[n][k];
|
|
|
+ }
|
|
|
+ if (k != resources.size())
|
|
|
+ throw new IOException("[DEBUG 2]Invaild problem");
|
|
|
+ if (appIndex.containsKey(parts[0]))
|
|
|
+ throw new IOException("[DEBUG 3]Invaild problem");
|
|
|
+ appIndex.put(parts[0], i);// {app_5269=5268, app_5267=5266,
|
|
|
+ // app_6598=6597}
|
|
|
+ apps[i] = parts[0];// [app_1, app_2, app_3, app_4]
|
|
|
+ for (int j = 0; j < k; j++)
|
|
|
+ appResources[i][j] = resources.get(j);
|
|
|
+ }
|
|
|
+ /** Read machine_resources */
|
|
|
+ m = Integer.parseInt(bufferedReader.readLine());// 6000
|
|
|
+ machineResources = new double[m][k];
|
|
|
+ machineResourcesUsed = new double[m][k];
|
|
|
+ machineIndex = new HashMap<String, Integer>();// {machine_3791=3790,
|
|
|
+ // machine_3792=3791}
|
|
|
+ machineHasApp = new Map[m];
|
|
|
+ machines = new String[m];
|
|
|
+ for (int i = 0; i < m; i++) {
|
|
|
+ // machineId,resources
|
|
|
+ String line = bufferedReader.readLine();
|
|
|
+ String[] parts = line.split(",", -1);
|
|
|
+ if (machineIndex.containsKey(parts[0]))
|
|
|
+ throw new IOException("[DEBUG 4]Invaild problem");
|
|
|
+ machineIndex.put(parts[0], i);
|
|
|
+ machines[i] = parts[0];
|
|
|
+ machineHasApp[i] = new HashMap<Integer, Integer>();
|
|
|
+ double cpu = Double.parseDouble(parts[1]);
|
|
|
+ double mem = Double.parseDouble(parts[2]);
|
|
|
+ for (int j = 0; j < T; j++) {
|
|
|
+ machineResources[i][j] = cpu;
|
|
|
+ machineResources[i][T + j] = mem;
|
|
|
+ }
|
|
|
+ for (int j = 3; j < parts.length; j++)
|
|
|
+ machineResources[i][2 * T + j - 3] = Double.parseDouble(parts[j]);
|
|
|
+ for (int j = 0; j < k; j++)
|
|
|
+ machineResourcesUsed[i][j] = 0.;
|
|
|
+ }
|
|
|
+ /** Read app_interference */
|
|
|
+ int icnt = Integer.parseInt(bufferedReader.readLine());// 35242
|
|
|
+ appInterference = new Map[n];
|
|
|
+ for (int i = 0; i < n; i++)
|
|
|
+ appInterference[i] = new HashMap<Integer, Integer>();
|
|
|
+ for (int i = 0; i < icnt; i++) {
|
|
|
+ String line = bufferedReader.readLine();
|
|
|
+ String[] parts = line.split(",", -1);
|
|
|
+ if (!appIndex.containsKey(parts[0]) || !appIndex.containsKey(parts[1]))
|
|
|
+ throw new IOException("[DEBUG 8]Invaild problem");
|
|
|
+ int app1 = appIndex.get(parts[0]);
|
|
|
+ int app2 = appIndex.get(parts[1]);
|
|
|
+ int limit = Integer.parseInt(parts[2]);
|
|
|
+ Map<Integer, Integer> inter = appInterference[app1];
|
|
|
+ if (inter.containsKey(app2))
|
|
|
+ throw new IOException("[DEBUG 9]Invaild problem");
|
|
|
+ if (app1 == app2)
|
|
|
+ limit += 1; // self-interference +1 here
|
|
|
+ inter.put(app2, limit);
|
|
|
+ }
|
|
|
+ /** Read instance_deploy */
|
|
|
+ N = Integer.parseInt(bufferedReader.readLine());// 68219
|
|
|
+ inst2AppIndex = new HashMap<String, Integer>();// 68219*2 {inst_33717=8766, inst_33718=2956}
|
|
|
+ inst2Machine = new HashMap<String, Integer>();// {inst_33717=5456, inst_33713=3427}
|
|
|
+ for (int i = 0; i < N; i++) {
|
|
|
+ String line = bufferedReader.readLine();
|
|
|
+ String[] parts = line.split(",", -1);
|
|
|
+ if (inst2AppIndex.containsKey(parts[0]))
|
|
|
+ throw new IOException("[DEBUG 5]Invaild problem");
|
|
|
+ if (!appIndex.containsKey(parts[1]))
|
|
|
+ throw new IOException("[DEBUG 6]Invaild problem");
|
|
|
+ inst2AppIndex.put(parts[0], appIndex.get(parts[1]));
|
|
|
+ if (!"".equals(parts[2])) {
|
|
|
+ if (!machineIndex.containsKey(parts[2]))
|
|
|
+ throw new IOException("[DEBUG 7]Invaild problem");
|
|
|
+ toMachine(parts[0], machineIndex.get(parts[2]), true);
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ private String toMachine(String inst, int machineIt) {
|
|
|
+ return toMachine(inst, machineIt, true);
|
|
|
+ }
|
|
|
+
|
|
|
+ private String toMachine(String inst, int machineIt, boolean doCheck) {
|
|
|
+ int appIt = inst2AppIndex.get(inst);
|
|
|
+ Map<Integer, Integer> hasApp = machineHasApp[machineIt];
|
|
|
+ if (doCheck) {
|
|
|
+ // 检查互斥规则，初始数据这里有冲突
|
|
|
+ int nowHas = 0;
|
|
|
+ if (hasApp.containsKey(appIt))
|
|
|
+ nowHas = hasApp.get(appIt);
|
|
|
+ for (Integer conditionalApp : hasApp.keySet()) {
|
|
|
+ if (hasApp.get(conditionalApp) <= 0)
|
|
|
+ continue;
|
|
|
+ if (!appInterference[conditionalApp].containsKey(appIt))
|
|
|
+ continue;
|
|
|
+ if (nowHas + 1 > appInterference[conditionalApp].get(appIt)) {
|
|
|
+ return "App Interference, inst: " + inst + ", " + apps[conditionalApp] + " -> " + apps[appIt] + ", "
|
|
|
+ + (nowHas + 1) + " > " + appInterference[conditionalApp].get(appIt);
|
|
|
+ }
|
|
|
+ }
|
|
|
+ //初始数据这里有冲突
|
|
|
+ for (Integer checkApp : hasApp.keySet()) {
|
|
|
+ if (!appInterference[appIt].containsKey(checkApp))
|
|
|
+ continue;
|
|
|
+ if (hasApp.get(checkApp) > appInterference[appIt].get(checkApp)) {
|
|
|
+ return "App Interference, inst: " + inst + ", " + apps[appIt] + " -> " + apps[checkApp] + ", "
|
|
|
+ + (nowHas + 1) + " > " + appInterference[appIt].get(checkApp);
|
|
|
+ }
|
|
|
+ }
|
|
|
+ // 检查资源限制，初始数据这里没有冲突
|
|
|
+ for (int i = 0; i < k; i++)
|
|
|
+ if (dcmp(machineResourcesUsed[machineIt][i] + appResources[appIt][i]
|
|
|
+ - machineResources[machineIt][i]) > 0) {
|
|
|
+ String res = "Resource Limit: inst: " + inst + ", " + "machine: " + machines[machineIt] + ", app: "
|
|
|
+ + apps[appIt] + ", resIter: " + i + ", " + machineResourcesUsed[machineIt][i] + " + "
|
|
|
+ + appResources[appIt][i] + " > " + machineResources[machineIt][i];
|
|
|
+ System.out.println(res);
|
|
|
+ return res;
|
|
|
+ }
|
|
|
+
|
|
|
+ }
|
|
|
+ // 将inst放入新的machine
|
|
|
+ inst2Machine.put(inst, machineIt);
|
|
|
+ if (!hasApp.containsKey(appIt))
|
|
|
+ hasApp.put(appIt, 0);
|
|
|
+ hasApp.put(appIt, hasApp.get(appIt) + 1);
|
|
|
+ for (int i = 0; i < k; i++)
|
|
|
+ machineResourcesUsed[machineIt][i] += appResources[appIt][i];
|
|
|
+
|
|
|
+ return "success";
|
|
|
+ }
|
|
|
+
|
|
|
+ /**
|
|
|
+ * 把实例inst 移除主机，撤销消耗资源
|
|
|
+ *
|
|
|
+ * @param inst 实例id
|
|
|
+ */
|
|
|
+ private void pickInstance(String inst) {
|
|
|
+ if (!inst2Machine.containsKey(inst))
|
|
|
+ return;
|
|
|
+ int appIt = inst2AppIndex.get(inst);
|
|
|
+ int fromMachine = inst2Machine.get(inst);
|
|
|
+ // 更新machineHasApp
|
|
|
+ Map<Integer, Integer> fromHasApp = machineHasApp[fromMachine];
|
|
|
+ fromHasApp.put(appIt, fromHasApp.get(appIt) - 1);
|
|
|
+ if (fromHasApp.get(appIt) <= 0)
|
|
|
+ fromHasApp.remove(appIt);
|
|
|
+ // 更新machineResourcesUsed
|
|
|
+ for (int i = 0; i < k; i++)
|
|
|
+ machineResourcesUsed[fromMachine][i] -= appResources[appIt][i];
|
|
|
+ // 更新inst2Machine
|
|
|
+ inst2Machine.remove(inst);
|
|
|
+ }
|
|
|
+
|
|
|
+ private int dcmp(double x) {
|
|
|
+ if (Math.abs(x) < 1e-9)
|
|
|
+ return 0;
|
|
|
+ return x < 0. ? -1 : 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ public static void main(String[] args) throws Exception {
|
|
|
+ if (args.length != 5 && args.length != 2) {
|
|
|
+ System.err.println(
|
|
|
+ "传入参数有误，使用方式为：java -cp xxx.jar app_resources.csv machine_resources.csv instance_deploy.csv app_interference.csv result.csv");
|
|
|
+ return;
|
|
|
+ }
|
|
|
+
|
|
|
+ System.out.println("-------开始部署啦--------");
|
|
|
+ long startTime = System.currentTimeMillis(); // 获取开始时间
|
|
|
+
|
|
|
+ InputStream problem;
|
|
|
+ InputStream result;
|
|
|
+ // app_resources.csv
|
|
|
+ // machine_resources.csv
|
|
|
+ // instance_deploy.csv
|
|
|
+ // app_interference.csv
|
|
|
+ // result.csv
|
|
|
+ if (args.length == 5) {
|
|
|
+ // 将赛题拼成评测数据
|
|
|
+ StringBuffer sb = new StringBuffer();
|
|
|
+ for (int i = 0; i < 4; i++) {
|
|
|
+ List<String> lines = new ArrayList<String>();
|
|
|
+ BufferedReader bs = new BufferedReader(new FileReader(new File(args[i])));
|
|
|
+ for (String line = bs.readLine(); line != null; line = bs.readLine())
|
|
|
+ lines.add(line);
|
|
|
+ sb.append("" + lines.size()).append("\n");
|
|
|
+ for (String line : lines)
|
|
|
+ sb.append(line).append("\n");
|
|
|
+ }
|
|
|
+ String alldata = sb.toString();
|
|
|
+ problem = new ByteArrayInputStream(alldata.getBytes());
|
|
|
+ result = new FileInputStream(args[4]);
|
|
|
+ } else {
|
|
|
+ problem = new FileInputStream(args[0]);
|
|
|
+ result = new FileInputStream(args[1]);
|
|
|
+ }
|
|
|
+
|
|
|
+ // 评测
|
|
|
+ Main evaluator = new Main();
|
|
|
+ evaluator.init(new BufferedReader(new InputStreamReader(problem, Charsets.UTF_8)));
|
|
|
+ evaluator.run();
|
|
|
|
|
|
- public static void main(String[] args) {
|
|
|
- // TODO 自动生成的方法存根
|
|
|
+ long endTime = System.currentTimeMillis(); // 获取结束时间
|
|
|
+ System.out.println("程序运行时间：" + (endTime - startTime) / 1000 + "s"); // 输出程序运行时间
|
|
|
+ System.out.println("-------部署结束啦--------");
|
|
|
|
|
|
}
|
|
|
|
