Go on. Explore!

lvl 0 • 0 xp

lvl 1

Home Market Decks Interests

OS Chapter 1 & 2

memorize.ai (lvl 286)

(0)

33 cards

()

Section 1

Preview this deck

Data Processing

Front

1 / 33

iOS Dev

0.0

0 reviews

5			0
4			0
3			0
2			0
1			0

Active users

All-time users

Favorites

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (33)

Section 1

(33 cards)

Data Processing

Front

The processor may perform some arithmetic or logic operation on data.

Back

Temporal Locality

Front

refers to the tendency for a processor to access memory locations that have been used recently. For example, when an iteration loop is executed, the processor executes the same set of instructions repeatedly.

Back

Process

Front

A collection of one or more threads and associated system resources (such as memory containing both code and data, open files, and devices). This corresponds closely to the concept of a program in execution. By breaking a single application into multiple threads, the programmer has great control over the modularity of the application and the timing of application-related events.

Back

virtual memory address

Front

page number and an offset within the page

Back

System Bus

Front

Provides for communication among processors, main memory, and I/O modules

Back

Multithreading

Front

A technique in which a process, executing an application, is divided into threads that can run concurrently.

Back

Process isolation

Front

The OS must prevent independent processes from interfering with each other's memory, both data and instructions.

Back

Main Memory

Front

Stores data and programs. This memory is typically volatile; that is, when the computer is shut down, the contents of the memory are lost. In contrast, the contents of disk memory are retained even when the computer system is shut down. Main memory is also referred to as real memory or primary memory.

Back

Object-oriented design

Front

Lends discipline to the process of adding modular extensions to a small kernel. At the OS level, an object-based structure enables programmers to customize an OS without disrupting system integrity. Object orientation also eases the development of distributed tools and full-blown distributed operating systems.

Back

Hit Ratio

Front

is defined as the fraction of all memory accesses that are found in the faster memory (e.g., the cache)

Back

Protection and access control

Front

Sharing of memory, at any level of the memory hierarchy, creates the potential for one program to address the memory space of another. This is desirable when sharing is needed by particular applications. At other times, it threatens the integrity of programs and even of the OS itself. The OS must allow portions of memory to be accessible in various ways by various users

Back

Secondary Memory (Auxiliary Memory)

Front

External, nonvolatile memory

Back

I/O Interrupt

Front

[Type of Interrupt] Generated by an I/O controller, to signal normal completion of an operation or to signal a variety of error conditions.

Back

I/O Modules

Front

Move data between the computer and its external environment. The external environment consists of a variety of devices, including secondary memory devices (e.g., disks), communications equipment, and terminals.

Back

Scheduling - Fairness

Front

Typically, we would like all processes that are competing for the use of a particular resource to be given approximately equal and fair access to that resource. This is especially so for jobs of the same class, that is, jobs of similar demands.

Back

Automatic allocation and management:

Front

Programs should be dynamically allocated across the memory hierarchy as required. Allocation should be transparent to the programmer. Thus, the programmer is relieved of concerns relating to memory limitations, and the OS can achieve efficiency by assigning memory to jobs only as needed.

Back

Hardware Failure Interrupt

Front

[Type of Interrupt] Generated by a failure, such as power failure or memory parity error.

Back

Symmetric multiprocessing (SMP)

Front

A term that refers to a computer hardware architecture (described in Chapter 1 ) and also to the OS behavior that exploits that architecture. The OS of an SMP schedules processes or threads across all of the processors. SMP has a number of potential advantages over uniprocessor architecture.

Back

Interrupt

Front

Virtually all computers provide a mechanism by which other modules (I/O, memory) may interrupt the normal sequencing of the processor.

Back

Scheduling - Differential responsiveness:

Front

On the other hand, the OS may need to discriminate among different classes of jobs with different service requirements. The OS should attempt to make allocation and scheduling decisions to meet the total set of requirements. The OS should also make these decisions dynamically. For example, if a process is waiting for the use of an I/O device, the OS may wish to schedule that process for execution as soon as possible to free up the device for later demands from other processes.

Back

Control

Front

An instruction may specify that the sequence of execution be altered. For example, the processor may fetch an instruction from location 149, which specifies that the next instruction will be from location 182. The processor sets the program counter to 182. Thus, on the next fetch stage, the instruction will be fetched from location 182 rather than 150.

Back

Processor-Memory

Front

Data may be transferred from processor to memory or from memory to processor.

Back

Spatial Locality

Front

refers to the tendency of execution to involve a number of memory locations that are clustered. This reflects the tendency of a processor to access instructions sequentially.

Back

Processor-I/O

Front

Data may be transferred to or from a peripheral device by transferring between the processor and an I/O module

Back

Thread

Front

A dispatchable unit of work. It includes a processor context (which includes the program counter and stack pointer) and its own data area for a stack (to enable subroutine branching). A thread executes sequentially and is interruptable so that the processor can turn to another thread.

Back

Long-term storage

Front

Many application programs require means for storing information for extended periods of time, after the computer has been powered down.

Back

Processor (CPU)

Front

Controls the operation of the computer and performs its data processing functions. When there is only one processor, it is often referred to as the central processing unit (CPU).

Back

Support of modular programming

Front

Programmers should be able to define program modules, and to create, destroy, and alter the size of modules dynamically.

Back

Program Interrupt

Front

[Type of Interrupt] Generated by some condition that occurs as a result of an instruction execution, such as arithmetic overflow, division by zero, attempt to execute an illegal machine instruction, and reference outside a user's allowed memory space.

Back

Scheduling - Efficiency

Front

The OS should attempt to maximize throughput, minimize response time, and, in the case of time sharing, accommodate as many users as possible. These criteria conflict; finding the right balance for a particular situation is an ongoing problem for OS research.

Back

Locality of Reference (Locality)

Front

During the course of execution of a program, memory references by the processor, for both instructions and data, tend to cluster.

Back

Timer Interrupt

Front

[Type of Interrupt] Generated by a timer within the processor. This allows the operating system to perform certain functions on a regular basis.

Back

distributed operating system

Front

provides the illusion of a single main memory space and a single secondary memory space, plus other unified access facilities, such as a distributed file system. Although clusters are becoming increasingly popular, and there are many cluster products on the market, the state of the art for distributed operating systems lags that of uniprocessor and SMP operating systems.

Back