Skip to main content

Timeline for Proccess scheduling arrival time

Current License: CC BY-SA 4.0

14 events
when toggle format what by license comment
Jan 15, 2019 at 7:25 vote accept Robert
Jan 15, 2019 at 0:34 comment added John L. There are not many choices left. Just go with one of them. Then the other. You will see.
Jan 15, 2019 at 0:27 comment added Robert @Apass.Jack Thanks. Things are more clear now. But still, for P2 start time could be both P1 and P6 finish time (27). How do I choose in a situation like that? Do I need to apply SJF rule?
Jan 14, 2019 at 23:24 comment added John L. The turnaround time is the sum of the waiting time and the (estimated) execution time.
Jan 14, 2019 at 18:36 comment added Robert I think P4 was executed first because it has 0 waiting time. Also (if I'm not wrong) the turn around time of a process X is equal to the waiting time of a process Y where Y is the successor of X.
Jan 14, 2019 at 18:28 comment added John L. Meanwhile, can you find which process was executed first? second? last? Etc. It would be great if you can add your thoughts or partial result to the question.
Jan 14, 2019 at 17:48 comment added Robert @Apass.Jack I added an image of the problem to the post
Jan 14, 2019 at 17:47 history edited Robert CC BY-SA 4.0
added 94 characters in body
Jan 14, 2019 at 17:09 comment added John L. Can you add an accessible reference to the original problem in the question such as a url or its location in a book? An image of the original problem description will do, too.
Jan 14, 2019 at 12:36 history edited Robert CC BY-SA 4.0
deleted 23 characters in body
Jan 13, 2019 at 18:12 answer added John L. timeline score: 0
Jan 13, 2019 at 17:10 comment added Robert @Apass.Jack No. The arrival time. The problem only gives 3 arrival times and I need to figure out what arrival time correspond to each process
Jan 13, 2019 at 14:40 review First posts
Jan 13, 2019 at 16:56
Jan 13, 2019 at 14:35 history asked Robert CC BY-SA 4.0