please to all if any one have solve of these a program that will simulate the preemptive version of the Priority Scheduling Algorithm algorithm. The program should compute waiting time and turnaround time of every job as well as the average waiting time and average turnaround time.
A job table has the following entries: (Job#, Arrival Time, Burst Time [CPU Cycle] in milliseconds, Priority) respectively.
Assumption:
• The context switch time is 0.
• The lower number implies higher priority.
• Each job has a unique priority
ksa_msn 0 Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.