| slovo | definícia |
scheduling
(encz) | scheduling,harmonogram n: Zdeněk Brož |
scheduling
(encz) | scheduling,naplánování n: Zdeněk Brož |
scheduling
(encz) | scheduling,plánování n: Zdeněk Brož |
scheduling
(encz) | scheduling,rozpis n: Zdeněk Brož |
scheduling
(encz) | scheduling,rozvrhování n: Zdeněk Brož |
scheduling
(encz) | scheduling,termínové plánování n: Zdeněk Brož |
scheduling
(wn) | scheduling
n 1: setting an order and time for planned events [syn:
scheduling, programming, programing] |
scheduling
(foldoc) | scheduling
scheduler
The arrangement of a number of related operations
in time.
There are several kinds of scheduling related to computers:
instruction scheduling - sequencing the instructions
executed by the CPU
multitasking ("process scheduling") - sharing a CPU between
several processes
application software to help organise your daily meetings
etc.
task scheduling - algorithms to solve the general problem
of satisfying time and resource constraints between a number
of tasks.
Compare planning.
(1998-04-25)
|
| | podobné slovo | definícia |
debt rescheduling
(encz) | debt rescheduling, |
interest rescheduling
(encz) | interest rescheduling, |
realtime scheduling
(encz) | realtime scheduling,okamžité plánování web |
rescheduling
(encz) | rescheduling, |
serial multiyear rescheduling agreement
(encz) | serial multiyear rescheduling agreement, |
serial multiyear rescheduling arrangement
(encz) | serial multiyear rescheduling arrangement, |
group-sweeping scheduling
(foldoc) | Group-Sweeping Scheduling
(GSS) A disk scheduling strategy in which
requests are served in cycles, in a round-robin manner. To
reduce disk arm movements ("seeking"), the set of streams is
divided into groups that are served in fixed order. Streams
within a group are served according to "SCAN".
If all clients are assigned to one group, GSS reduces to SCAN,
and if all clients are assigned to separate groups, GSS
effectively becomes round-robin scheduling. The service order
within one group is not fixed, and a stream may in fact be
first in one cycle while last in the next. This variation has
to be masked by extra buffering but whereas SCAN requires
buffer space for all streams, GSS can reuse the buffer for
each group and effect a trade-off between seek optimisation
and buffer requirements.
(1995-11-12)
|
guaranteed scheduling
(foldoc) | guaranteed scheduling
A scheduling algorithm used in multitasking
operating systems that guarantees fairness by monitoring the
amount of CPU time spent by each user and allocating
resources accordingly.
[How does it allocate resources?]
(1998-04-26)
|
instruction scheduling
(foldoc) | instruction scheduling
The compiler phase that orders instructions
on a pipelined, superscalar, or VLIW architecture so as
to maximise the number of function units operating in parallel
and to minimise the time they spend waiting for each other.
Examples are filling a delay slot; interspersing
floating-point instructions with integer instructions to
keep both units operating; making adjacent instructions
independent, e.g. one which writes a register and another which
reads from it; separating memory writes to avoid filling the
write buffer.
Norman P. Jouppi and David W. Wall, {"Available
Instruction-Level Parallelism for Superscalar and
Superpipelined Processors"
(ftp://gatekeeper.dec.com/archive/pub/DEC/WRL/research-reports/WRL-TR-89.7.ps.Z)},
Proceedings of the Third International Conference on
Architectural Support for Programming Languages and Operating
Systems, pp. 272--282, 1989.
[The SPARC Architecture Manual, v8, ISBN 0-13-825001-4]
|
priority scheduling
(foldoc) | priority scheduling
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.
|
process scheduling
(foldoc) | multitasking
concurrency
concurrent processing
multiprogramming
process scheduling
(Or "multi-tasking", "multiprogramming",
"concurrent processing", "concurrency", "process scheduling")
A technique used in an operating system for sharing a single
processor between several independent jobs. The first
multitasking operating systems were designed in the early
1960s.
Under "cooperative multitasking" the running task decides
when to give up the CPU and under "pre-emptive multitasking"
(probably more common) a system process called the
"scheduler" suspends the currently running task after it has
run for a fixed period known as a "time-slice". In both
cases the scheduler is responsible for selecting the next task
to run and (re)starting it.
The running task may relinquish control voluntarily even in a
pre-emptive system if it is waiting for some external event.
In either system a task may be suspended prematurely if a
hardware interrupt occurs, especially if a higher priority
task was waiting for this event and has therefore become
runnable.
The scheduling algorithm used by the scheduler determines
which task will run next. Some common examples are
round-robin scheduling, priority scheduling, {shortest job
first} and guaranteed scheduling.
Multitasking introduces overheads because the processor
spends some time in choosing the next job to run and in saving
and restoring tasks' state, but it reduces the worst-case time
from job submission to completion compared with a simple
batch system where each job must finish before the next one
starts. Multitasking also means that while one task is
waiting for some external event, the CPU to do useful work
on other tasks.
A multitasking operating system should provide some degree of
protection of one task from another to prevent tasks from
interacting in unexpected ways such as accidentally modifying
the contents of each other's memory areas.
The jobs in a multitasking system may belong to one or many
users. This is distinct from parallel processing where one
user runs several tasks on several processors. Time-sharing
is almost synonymous but implies that there is more than one
user.
Multithreading is a kind of multitasking with low
overheads and no protection of tasks from each other, all
threads share the same memory.
(1998-04-24)
|
rate monotonic scheduling
(foldoc) | Rate monotonic scheduling
A means of scheduling the time allocated to
periodic hard-deadline real-time users of a resource. The
users are assigned priorities such that a shorter fixed period
between deadlines is associated with a higher priority.
Rate monotonic scheduling provides a low-overhead, reasonably
resource-efficient means of guaranteeing that all users will
meet their deadlines provided that certain analytical
equations are satisfied during the system design. It avoids
the design complexity of time-line scheduling and the
overhead of dynamic approaches such as {earliest-deadline
scheduling}.
[D. R. Wilcox, Naval Ocean Systems Center Technical Report
1310, August 1989, "Periodic Phase Adjustment Distributed
Clock Synchronization in the Hard Realtime Environment",
p. 9].
(1996-03-23)
|
scheduling api
(foldoc) | Scheduling Application Programming Interface
Scheduling API
(SAPI, Scheduling API) An API aimed at software which aids
humans in arranging their (business) activities.
Microsoft has defined a SAPI for its Schedule+
application.
(1995-01-11)
|
scheduling application programming interface
(foldoc) | Scheduling Application Programming Interface
Scheduling API
(SAPI, Scheduling API) An API aimed at software which aids
humans in arranging their (business) activities.
Microsoft has defined a SAPI for its Schedule+
application.
(1995-01-11)
|
task scheduling
(foldoc) | task scheduling
The assignment of start and end times to a set of
tasks, subject to certain constraints. Constraints are
typically either time constraints (the payload must be
installed before the payload bay doors are closed) or resource
constraints (this task requires a small crane and a crane
operator).
In the case where the tasks are programs to run concurrently
on a computer, this is also known as multitasking.
(1998-04-25)
|
trace scheduling
(foldoc) | trace scheduling
A method of controlling and coordinating the
operation of multiple hardware elements of a {Very Long
Instruction Word} processor. It was developed by Josh Fisher
at the now-defunct Multiflow Computer Corporation
[Details?]
(1995-03-01)
|
|