Sit-in Lab 4 Orders Topic: Stack and Queue

Overview Simulate an order management system that:  Can take multiple orders and processing them according to their time of arrival  New order must be assigned to the lowest-numbered available processor  If no processor available, the order will wait for the next readily available processor  For each order, print its order number, the number of assigned processor, and the time that the order is processed 2

Input  First line: Two integers K (number of processors) and O (number of orders)  O rows follow: T (time of arrival of the order), X (time needed to process that order) 3

Main Method  Read K (number of processors) and O (number of orders)  Initialize the processors  For each order:  Read order information  Process the order accordingly 4

Main Method public void run() { Scanner sc = new Scanner(System.in); int K = sc.nextInt(); // number of processors int O = sc.nextInt(); // number of orders initProcessors(K); // initialize the processors for (int i = 1; i <= O; i++){ int arrTime = sc.nextInt(); // arrival time of the order int timeNeeded = sc.nextInt(); // time needed to process processOrder(i, arrTime, timeNeeded); } 5

Class Processor 6 Processor -number: int -finishTime: int + getNumber(): int + setFinishTime(): void + getFinishTime(): int Note: Finish time of a processor is the finish time of the last order assigned to it. The default value of finish time is -1 (when the processor is not assigned to any order)

Choosing better processor to assigned // return true if processor x is better to be assigned // than processor y for the specific order arrival time private boolean isBetter(Processor x, Processor y, int orderArrTime){ // If the last order in the processor finish before orderArrTime, // the ready time is orderArrTime. Otherwise, the ready time is // the finish time of the last order int xReady = (x.getFinishTime() < orderArrTime) ? orderArrTime : x.getFinishTime(); int yReady = (y.getFinishTime() < orderArrTime) ? orderArrTime : y.getFinishTime(); // return true only when processor x has earlier ready time // or has the same ready time with y but smaller number return (xReady < yReady) || (xReady == yReady && x.getNumber() < y.getNumber()); } 7

Processing orders  For each order  Loop through the processors list to find the best processor to be assigned  Update the assigned processor in the list  Print the order number, the number of assigned processor, and the time that the order is processed 8

Processors list  What data structure can we use to store the list?  Array, ArrayList, LinkedList? (ok but not recommended)  Stack?  Queue? 9

Process order – Using stack private Stack processors; private void initProcessors(int K){ processors = new Stack (); for (int i = 1; i <= K; i++){ // push new processor with specific number // and default finish time value processors.push(new Processor(i, -1)); } 10

Process order – Using stack private void processOrder(int orderNum, int arrTime, int timeNeeded){ Stack temp = new Stack (); // find the best processor to be assigned //... // compute the finish time of the order with the assigned // processor int readyTime = (best.getFinishTime() < arrTime) ? arrTime : best.getFinishTime(); int finishTime = readyTime + timeNeeded; // Push elements back to the original stack and update // the assigned processor //... // print the result System.out.println(orderNum + " " + best.getNumber() + " “ + finishTime); } 11

Process order – Using stack processors P1 (-1)P2 (-1) temp 12

Order 1: arrTime = 0, timeNeeded = 9 processors P1 (-1)P2 (-1) temp 13 Best = … Loop through all elements in the list to find the best processor to be assigned to the order

Order 1: arrTime = 0, timeNeeded = 9 processors P1 (-1) temp P2(-1) 14 Best = P2

Order 1: arrTime = 0, timeNeeded = 9 processors temp P2(-1)P1(-1) 15 Best = P1 readyTime = 0, finishTime = = 9 P1.setFinishTime(9)

Order 1: arrTime = 0, timeNeeded = 9 processors P1(9) temp P2(-1) 16 Best = P1 Push elements back to the original stack and update the assigned processor

Order 1: arrTime = 0, timeNeeded = 9 processors P1(9)P2(-1) temp 17 Best = P1 Print “1 1 9”

Order 2: arrTime = 5, timeNeeded = 5 processors P1(9)P2(-1) temp 18 Best = … Loop through all elements in the list to find the best processor to be assigned to the order

Order 2: arrTime = 5, timeNeeded = 5 processors P1(9) temp P2(-1) 19 Best = P2

Order 2: arrTime = 5, timeNeeded = 5 processors temp P2(-1)P1(9) 20 Best = P2 readyTime = 5, finishTime = 5 +5 = 10 P2.setFinishTime(10)

Order 2: arrTime = 5, timeNeeded = 5 processors P1(9) temp P2(-1) 21 Best = P2 Push elements back to the original stack and update the assigned processor

Order 2: arrTime = 5, timeNeeded = 5 processors P1(9)P2(10) temp 22 Best = P2 Print “2 2 10”

Order 3: arrTime = 10, timeNeeded = 1 processors P1(9)P2(10) temp 23 Best = … Loop through all elements in the list to find the best processor to be assigned to the order

Order 3: arrTime = 10, timeNeeded = 1 processors P1(9) temp P2(10) 24 Best = P1

Order 3: arrTime = 10, timeNeeded = 1 processors temp P2(10)P1(9) 25 Best = P1 readyTime = 10, finishTime = = 11 P1.setFinishTime(11)

Order 3: arrTime = 10, timeNeeded = 1 processors P1(11) temp P2(10) 26 Best = P1 Push elements back to the original stack and update the assigned processor

Order 3: arrTime = 10, timeNeeded = 1 processors P1(11)P2(10) temp 27 Best = P1 Print “3 1 11”

Process order – Using Queue  Similar to Stack  Using offer() and poll() instead of push() and pop() 28

END OF FILE 29