先来先服务算法(FCFS java实现)
来源:互联网 发布:思途cms6.0源码 编辑:程序博客网 时间:2024/06/03 10:56
package Arithmetic;import java.io.BufferedReader;import java.io.InputStream;import java.io.InputStreamReader;import java.nio.ByteBuffer;import java.util.Scanner;import java.util.concurrent.CountDownLatch;public class Awara_OS_FCFS {public static int i;public double awara[];public double awara1[];public int process_number;public double arrival_time[];public double services_time[];public double start_time[];public double wait_time[];public double completion_time[];public double turn_around_time[];public double turn_around_time_with_weight[];private void Set_process_number(int process_nuber) {this.process_number = process_nuber;}private double get_process_number() {return process_number;}private void Set_arrival_time(int arrival_time[]) {for (i = 0; i < process_number; i++) {this.arrival_time[i] = arrival_time[i];}}private double[] get__arrival_time() {for (i = 0; i < process_number; i++) {awara[i] = arrival_time[i];}return awara;}private void Set_services_time(int services_time[]) {for (i = 0; i < process_number; i++) {this.services_time[i] = services_time[i];}}private double[] get_services_time() {for (i = 0; i < process_number; i++) {awara1[i] = services_time[i];}return awara1;}private void FCFS() {start_time[0] = arrival_time[0];completion_time[0] = arrival_time[0] + services_time[0];start_time[0] = arrival_time[0];turn_around_time[0] = completion_time[0] - arrival_time[0];turn_around_time_with_weight[0] = turn_around_time[0]/ services_time[0];for (i = 1; i < process_number; i++) {start_time[i] = completion_time[i - 1];wait_time[i] = start_time[i] - arrival_time[i];completion_time[i] = arrival_time[i] + services_time[i]+ wait_time[i];turn_around_time[i] = completion_time[i] - arrival_time[i];turn_around_time_with_weight[i] = turn_around_time[i]/ services_time[i];}System.out.println("\n:开始时间是: ");for (i = 0; i < process_number; i++) {System.out.print(start_time[i] + "\t");}System.out.println("\n等待时间是:");for (i = 0; i < process_number; i++) {System.out.print(wait_time[i] + "\t");}System.out.println("\n完成时间是:");for (i = 0; i < process_number; i++) {System.out.print(completion_time[i] + "\t");}System.out.println("\n周转时间是:");for (i = 0; i < process_number; i++) {System.out.print(turn_around_time[i] + "\t");}System.out.println("\n带权周转时间:");for (i = 0; i < process_number; i++) {System.out.print(turn_around_time_with_weight[i] + "\t");}}public static void main(String[] args) throws Exception {System.out.println("请输入进程数:");Awara_OS_FCFS cok = new Awara_OS_FCFS();BufferedReader buf = null;buf = new BufferedReader(new InputStreamReader(System.in));String str1 = null;str1 = buf.readLine();cok.process_number = (int) Double.parseDouble(str1);cok.arrival_time = new double[cok.process_number];cok.services_time = new double[cok.process_number];cok.completion_time = new double[cok.process_number + 1];cok.turn_around_time = new double[cok.process_number + 1];cok.start_time = new double[cok.process_number];cok.wait_time = new double[cok.process_number];cok.turn_around_time_with_weight = new double[cok.process_number];String str = null;String str2 = null;System.out.println("\n请输入各进程到达时间");for (i = 0; i < cok.process_number; i++) {str = buf.readLine();cok.arrival_time[i] = Double.parseDouble(str);}System.out.println("\n请输入各个进程服务时间");for (i = 0; i < cok.process_number; i++) {str2 = buf.readLine();cok.services_time[i] = Double.parseDouble(str2);}System.out.println("该进程数为" + cok.process_number);System.out.println("\n到达时间为");for (i = 0; i < cok.process_number; i++) {System.out.print(cok.arrival_time[i] + "\t");}System.out.println("\n服务时间为:");for (i = 0; i < cok.process_number; i++) {System.out.print(cok.services_time[i] + "\t");}cok.FCFS();}}
3 0
- 先来先服务算法(FCFS java实现)
- 先来先服务算法-FCFS
- 先来先服务(FCFS)算法
- 先到先服务(FCFS)算法C语言,Java语言实现
- java_实现先来先服务(FCFS)短作业优先算法(SJF)
- 先来先服务(First Come First Served,FCFS)调度算法
- 先来先服务算法(FCFS)和 短作业优先算法(SJF)
- OS的先到先服务调度算法(FCFS)
- Java简单实现进程调度算法 FCFS和SJF
- 操作系统进程调度先来先服务FCFS
- 【计算机操作系统】先来先服务FCFS和短作业优先SJF进程调度算法
- 【操作系统 - 1】先来先服务FCFS和短作业优先SJF进程调度算法
- 《操作系统》 先来先服务FCFS和短作业优先SJF进程调度算法相关计算及实验
- 先来先服务FCFS和短作业优先SJF进程调度算法
- 磁盘调度算法(FCFS&&SSTF)
- 操作系统算法 之 进程调度(FCFS)
- 磁盘调度算法(FCFS,SSTF,SCAN)
- c语言实现fcfs,rr_1,spn,srt4种调度算法(无数据结构)
- c#问题笔记
- Memcache的hash策略及配置总结
- Java 读取properties配置文件
- EntityFramework Core 1.1有哪些新特性呢?
- EL表达式 easyui年月
- 先来先服务算法(FCFS java实现)
- UVa 725
- SQL查询效率
- EntityFramework Core解决并发详解
- MySQL config in Django
- js中回调函数的理解 举例说明js回调函数
- 【深度学习技术】LRN 局部响应归一化
- 从某标签A内的B标签,即从A标签中选择B标签($("#B")是获取整个页面中的B标签),即获取A标签的子标签B,怎么获取?
- Codevs 4919 线段树练习4