1. priority scheduling system> Processes scheduling in which the scheduler selects tasks to run based on their priority as opposed to, say, a simple round-robin. Priorities may be static or dynamic. Static priorities are assigned at the time of creation, while dynamic priorities are based on the processes behaviour while in the system. For example, the scheduler may favour I/O-intensive tasks so that expensive requests can be issued as early as possible. A danger of priority scheduling is starvation, in which processes with lower priorities are not given the opportunity to run. In order to avoid starvation, in preemptive scheduling, the priority of a process is gradually reduced while it is running. Eventually, the priority of the running process will no longer be the highest, and the next process will start running. This method is called aging. PRISM A distributed logic language. ["PRISM: A Parallel Inference System for Problem Solving", S. Kasif et al, Proc 1983 Logic Prog Workshop, pp. 123-152]. Prisoner of Bill PoB A derisory term, in use generally among Unix users, for anyone who uses Microsoft products either because they dont know there is anything better i. e. Unix or because they would be incapable of working anything more complex i. e. Unix. The interesting and widespread presumption among users of the term is that at least at the time of writing, 1998 using anything other than Unix or a Microsoft OS whether VMS, Macintosh, Amiga is so eccentric a choice as to be at least somewhat praiseworthy.
priority scheduling |
