Within the Memory Manager the Segment Link Table lists details about each segment (one for each job).

Multiple-level queues isn't really a separate scheduling algorithm but works in conjunction with several other schemes.

In general, when a job is allocated to the CPU its Page Map Table is loaded into main memory while the Segment Map Tables are loaded only as needed.

The Processor Manager is a composite of two submanagers: one in charge of job scheduling and the other in charge of program scheduling.

The first-in first-out (FIFO) page replacement policy will remove the pages that have been in memory the shortest.

In the dining philosophers problem there are five philosophers and four forks.

Starvation is the result of the liberal allocation of resources.

From HOLD, the job moves to WAITING when it's ready to run but is waiting for the CPU.

A deadlock is preceded by six simultaneous conditions that the operating system could have recognized.

A job's working set is the set of pages residing in memory that can be accessed indirectly

Once starvation has been detected, an algorithm can be implemented in which the system blocks new jobs until the starving jobs have been satisfied.

Every time an instruction is executed, or a data value is used, the operating system (or the hardware) must translate the job space address, which is relative, into its physical address, which is absolute.

One sector will hold one page of job instructions and fit into one page frame of memory.

When modeling deadlock, if there's a cycle in the graph, then there is a deadlock involving the processes and the resources in the cycle.

A variation of the LRU page replacement algorithm is known as the clock page replacement policy because it is implemented with a circular queue and uses a pointer to step through the reference bits of the active pages, simulating a clockwise motion.

Each page of a job is actually stored in a page frame that can be located anywhere in available main memory.

Deadlock does not usually affect the entire system.

When using a FIFO scheme, more memory will always result in better performance.

According to the Banker's Algorithm an unsafe state always leads to deadlock.

If locks are not used to preserve data integrity, the updated records in a database might include only some of the data—and their contents would depend on the order in which each process finishes its execution.

Demand paging requires that the Page Map Table for each job keep track of each page as it is loaded or removed from main memory.

As a job moves through the system it is always in one of five states (or at least three); these are called the job status or the process status.

The advantage of RAID Level 3 is that if any one drive fails, data can be restored using the bits in the parity disk.

The job of the I/O control unit is to keep up with the I/O requests from the CPU and pass them down the line to the appropriate control unit.

RAID-0 is ideal for data-critical real-time systems.

An optical disc drive adjusts the speed of the disc's spin to compensate for the sector's location on the disc—this is called continuous linkage velocity (CLV).

The SCAN algorithm moves the arm methodically from the inner to the outer track, servicing every request in its path.

Additional complex configurations of RAID can be created by combining multiple levels.

Two of the most important measures of optical disc drive performance are sustained data-transfer rate and longest access time.

Additional complex configurations of RAID can be created by combining multiple levels.

Two of the most important measures of optical disc drive performance are sustained data-transfer rate and longest access time.

Additional complex configurations of RAID can be created by combining multiple levels.

A DVD with a fast data transfer rate will drop fewer frames when playing back a recorded video segment than will a unit with a slower transfer rate.

The traffic controller maintains a database containing the status and connections for each unit in the I/O subsystem, grouped into Channel Control Blocks, Control Unit Control Blocks, and Device Control Blocks.

When using DMA, the CPU is involved in transferring data to and from memory for the entire transfer.

Among the many differences between an optical disc and a magnetic disk is the design of the disc track and sectors.

A fixed-head disk is lower in cost than a movable head disk.

Direct access storage devices (DASDs) are devices that can directly read or write to a specific place on a disk.

For many computational purposes, serial processing is sufficient; it's easy to implement and fast enough for most users.

Threads share the same resources as the process that created them.

The classic problem of producers and consumers is one in which one process produces some data that another process consumes later.

Multiprocessing can refer to one job using several processors to execute sets of instructions in parallel.

The loosely coupled configuration features several complete computer systems, each with its own memory, I/O devices, CPU, and operating system.

The success of process synchronization hinges on the capability of the operating system to make a resource available to other processes while it is being used by one of them.

The common element in all synchronization schemes is to allow a process to finish work on a critical region of the program before other processes have access to it.

The symmetric configuration is best implemented if the processors are all of the same type.

The only reason for multiprocessing is to increase computer power.

The best-fit free list scheme uses memory more efficiently than the first-fit free scheme but it is slower to implement.

In the relocatable dynamic partitions scheme, the Memory Manager relocates programs to gather together all of the empty blocks and compact them to make one block of memory large enough to accommodate some or all of the jobs waiting to get in.

To overlay is to transfer segments of a program from main memory into secondary storage for execution, so that two or more segments take turns occupying the same memory locations.

During compaction, the operating system must distinguish between addresses and data values, and the distinctions are not obvious once the program has been loaded into memory

After relocation and compaction, both the free list and the busy list are updated.

Research continues to focus on finding the optimum allocation scheme.

The first attempt to allow for multiprogramming used fixed partitions.

One of the problems with the best-fit algorithm is that the entire table must be searched before the allocation can be made because the memory blocks are physically stored in sequence according to their location in memory.

Onboard systems are computers placed inside other products to add features and capabilities.

The supercomputer was developed primarily for government applications needing massive and fast number-crunching ability to carry out military operations and weather forecasting.

In the 1950s, only one FORTRAN program could run at a time, and then the FORTRAN compiler had to be reloaded into memory.

The File Manager is responsible for data files but not program files.

Real-time systems are used in time-critical environments where reliability is key and data must be processed within a strict time limit.

Few major advances were made in data management during the 1960s.

Since the mid-1970s rapid advances in computer technology have blurred the distinguishing characteristics of early machines.

Card systems date from the earliest computers, which relied on punched cards or tape for input when a job was entered by assembling the cards into a deck and running the entire deck of cards through a card reader as a group.

The first bug was a moth trapped in a Harvard computer.

The minicomputer of the 1970s was smaller than the microcomputer.

Many early programs used convoluted logic that only the original programmer could understand, so it was nearly impossible for anyone else to debug or change the program later on.

The high-level portion of the Process Manager is called the Process Scheduler.

A process requires space in main memory where it resides during its execution although, from time to time, it requires other resources such as data files or I/O devices.