Priority Scheduling

 Priority Scheduling:

A priority number (integer) is associated with each process
The CPU is allocated to the process with the highest priority (smallest integer º highest priority).
Preemptive
non preemptive
SJF is a priority scheduling where priority is the predicted next CPU burst time.
Problem º Starvation – low priority processes may never execute.

Solution º Aging – as time progresses increase the priority of the process.

Comments

Post a Comment

Popular posts from this blog

Classification of Data-Delivery Mechanisms in mobile computing

Image
Data Dissemination and Broadcasting Systems: Classification of Data-Delivery Mechanisms: ·          Push-based mechanisms (publish–subscribe mode) ·          Pull-based mechanisms (on-demand mode) ·          Hybrid mechanisms (hybrid mod                        Push-based Mechanisms: ·          Server pushes data records from a set of distributed computing systems ·          Examples of distributed computing systems advertisers or generators of traffic congestion, weather reports, stock quotes, and news report A server or computing system pushing the data records from a set of distributed systems : Publish–subscribe mode • In which the data push...
Read more

Client Server Computing with Adaptation

Image
Client Server Computing with Adaptation • Two adapters (adaptation software) at a mobile device • An adapter for standard data format for synchronization at the mobile-device • Another adapter for the backend database copy, which is in a different data format for the API at the mobile-device Adaptation: Software to get data in one format or data governed by one protocol and convert it to another format or to data governed by another protocol ·          Used for interchange between standard data formats and data formats for the API ·          IBM WebSphere Everyplace Access (WEA) provides adapters for synchronization objects (for example, XML format synchronization objects) and the objects of API databases (for example, for the PIM APIs)
Read more

Data Dissemination Broadcast-disk Models

Image
Data Dissemination Broadcast-disk Models: ·          Presumed that all the n records to be broadcast are stored on a circular disk from 0° to 360° ·          A hypothetical disk revolves and the angle changes from 0°to 360° ·          The entire N bits in n records get pushed through a hypothetical reading-head over the disk. ·          The head continuously reads each bit of a record just beneath it and broadcasts it instantaneously on the wireless network ·          During next revolution each bit in the records positioned from 0° to 360° broadcast once again in the same sequence as in earlier revolution Number of adaptations and algorithms for broadcast: 1. Circular Multi-disk Model 2. Flat Disk Model 3. Multi-disk Model with repetition rate proportional to pr...
Read more