Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

OS > Introduction to OS > Flashcards

Introduction to OS Flashcards

1
Q
  • a program that acts as an intermediary between a user of a computer and the computer hardware
  • controls and coordinates use of hardware among various applications and users.
  • is a resource allocator and control program making efficient use of HW and managing executing of user programs.
A

operating system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  • execute user programs and make solving user problems easier.
  • make the computer system convenient to use.
  • use the computer hardware in an efficient manner.
A

OG goals

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

(computer system structure)

  • provides basic computing resources
  • CPU, memory, I/O devices
A

hardware

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

(computer system structure)

  • define the ways in which the system resource are used to solve the computing problems of the users.
  • word processors, compilers, web browsers, database systems, video games
  • all programs not associated with the operating system.
A

application programs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

(computer system structure)

  • people, machines, other computers.
  • want convenience, ease of use and good performance.
A

users

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

-mainframe or minicoputer must keep all users happy.

A

shared computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

the one program running at all times on the computer-part of the operating system.

A

kernel

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

-ships with the operating system, but not part of the kernel

A

system program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  • today’s OS for general purpose and mobile computing also includes this.
  • a set of software frameworks that provide addition services to application developers such as databases, multimedia, graphics.
A

middleware

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
  • one or more CPUs, device controllers connect through common bus providing access to shared memory.
  • concurrent execution of CPUs and devices competing for memory cycles.
A

computer-system operation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
  • is in charge of a particular device type
  • has a local buffer.
  • each type has an operating system device driver to manage it.
  • informs CPU that it has finished its operation by causing an interrupt.
A

device controller

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

each device controller type has an operating system this to manage it

A

device driver

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

(common functions of interrupts)

-control to the interrupt service routine.

A

interrupt transfers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

(common functions of interrupts)

-contains the addresses of all the service routines.

A

interrupt vector

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

(common functions of interrupts)

-must save the address of the interrupted instruction

A

interrupt architecture

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

(common functions of interrupts)

-is a software-generated caused either by an error or a user request.

A

trap/exception

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

(common functions of interrupts)

-an operating system is.

A

interrupt driven

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q
  • the operating system preserves that state of the CPU by storing the registers and the program counter.
  • determienes which type of interrupt has occurred.
A

interrupt handling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

types of interrupt

A

polling/vectored interrupt system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

-determine what action should be taken for each type of interrupt.

A

separate segments of code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q
  • after I/O starts, control returns to user program only upon I/O completion
  • after I/O starts, control returns to user program without waiting for I.O completion.
A

two methods (for handling I/O)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

-request the OS to allow user to wait for I/O completion

A

system call

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q
  • contains entry for each device I/O device indicating its type, address, and state
  • OS indexes into I.O device table to determine device status and to modify table entry to include interrupt.
A

device-status update

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q
  • the computer cannot handle too many processes occurring simultaneously.
  • all memory is being used up.
  • too many threads.
A

hanging computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q
  • if the process is waiting for too long

- once the process has acquired the resources, it will not release it unless it is done with the execution.

A

starvation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

-you are requesting for process that are waiting for you
>deadlock
>no release of resource and no acquiring of resource
>hanging

A

cyclical waiting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q
  • copying information into faster storage system; main memory can be viewed as a cache for secondary storage
  • important principle, performed at many levels in a computer (in hardware, operating system, software).
  • information is use copied from slower to faster storage temporarily.
  • faster storage (cache) checked first to determine if information is there.
  • -its is, information used directly from the cache (fast).
  • -if not, data copied to cache and used there.
A

caching

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

(I/O Structure)

-it will not proceed with the execution of the remaining code for the user programs without compleing the interrupt.

A

synchronous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q
  • (I/O Structure)

- it will resume the operating of the CPU for the execution of user program without for I/O completion.

A

asynchronous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q
  • CPU is running the user program and it processes I/O interrupts.
  • If the I/O device is idle, the CPU is kept busy on the user program execution.
  • every device in a computer system has an interrupt address or interrupt request.
A

interrupt timeline

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

(storage structure)

  • only large storage media that the CPU can access directly.
  • random access
  • typically volatile-temporary storage, it requires power.
  • typically random-access memory in the form of Dynamic Random-access memory (DRAM)
A

main memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

(storage structure)

-extension of main memory that provides large nonvolatile storage capacity.

A

secondary storage

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

(storage structure|secondary storage)

-rigid metal or glass platters overed with magnetic recording material

A

hard disk drives (HDD)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

(storage structure|secondary storage|HDD)

-is logically divided into tracks, which are subdivided into sectors.

A

disk surface

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

(storage structure|secondary storage|HDD)

-determines the logical interaction between the device and the computer.

A

disk controller

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

(storage structure)

  • faster than hard disks, nonvolatile
  • various technologies
  • becoming more popular as capacity and performace increases, price drops.
A

non-volatile memory (NVM)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

(operating-system operations)

-simple code to initialize system, load the kernel

A

boostrap program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

(operating-system operations)

-services provided outside of the kernel

A

system daemons

39
Q

(operating-system operations)

  • software error
  • request for operating system service-system call
  • other process problems include infinite loop, processes modifying each other or the operating system.
A

software interrupt

40
Q
  • Bootstrap Program
  • Kernel Loads
  • Starts system daemons
  • Kernel interrupt driven
  • -Hardware interrupt
  • -Software interrupt
A

Operating-system operations

41
Q

(multiprogramming)

  • single user cannot always keep CPU and I/O devices busy
  • multiprogramming organizes jobs (code and data) so CPU always has one to execute.
  • a subset of total jobs in system is kept in memory
  • one job is selected and run via job scheduling
  • when job has to wait (for I/O for example), OS switches to another job.
A

batch system

42
Q
  • I/O routine supplied by the system
  • Memory management- they system must allocate memory to several jobs (also known as process for the program in execution)
  • CPU scheduling (job scheduling)-the system must choose among the several jobs read to run.
  • allocation of devices.
A

OS features needed for multiprogramming

43
Q

(multitasking)
-a logical extension of Batch systems-the CPU switches jobs so frequently that users can interact with each job while it is running, creating interactive computing.
>Response time should be < 1 second
>Each user has at least one program executing in memory -> process
>if several jobs ready to run at the same time -> CPU scheduling
>if processes don’t fit in memory, swappingmoves them in and out to run
> Virtual memory allows execution of processes not completely in memory.

A

timesharing

44
Q

-allows OS to protect itself and other system components.
>user mode and kernel mode
-Mode bit provided by hardware
-some instructions designated as provelaged, only executable in kernel mode.

A

dual-mode operation

45
Q
  • provides ability to distinguish when system is running user code or kernel mode.
  • when a user is running -> is user
  • when kernel code is execuitng -> is kernel
A

mode bit

46
Q

(dual-mode operation)

  • execution done on behalf of user
  • the system is in this mode when the OS is running a user application (text editor).
A

user mode

47
Q

(dual-mode operation)

  • execution done on behalf of operating system
  • the system starts with this mode when it boots and after the OS is loaded
  • it executes the application in user mode
  • there are some privilege instructions that can only be executed in kernel mode- these are interrupt instructions (I/O management, etc.)
  • if privilege instruction is executed in user mode, it is illegal, and a trap is generated
A

kernel mode

48
Q

-when the application requests the help of OS or an interrupt or a system call

A

transition from user mode to kernel mode

49
Q
  • is to prevent infinite loop (or porcess hogging resources)
  • is set to interrupt the coputer after some time period.
  • keep a counter that is decremented by the physical clock.
  • operating system set the counter (priveleged instruction)
  • when counter zero generate an interrupt.
  • set up before scheduling process to regain control or terminate program that exceeds allotted time.
A

timer

50
Q

(process management)

-program is not running

A

passive entity

51
Q

(process managment)

  • process
  • program when it runs
A

active entity

52
Q

(process management)

  • has one program counter specifying location of next instructin to execute.
  • -process executes instructions sequantially, one at a time, until completion.
A

single-threaded process

53
Q

(process management)

-has one program counter per thread

A

multi-threaded process

54
Q
  • includes process creation and deletion
  • there is provision of mechanism for process synchronization and process communication.

Activities:
>Creating and deleting both user and system processes/
>Suspending and resuming processes.
>Providing mechanisms for process synchronization
>Providing mechanisms for process communication
>Providing mechanisms for deadlock handling.

A

process management

55
Q
  • to execute a program all (or pasrt) of the instructions must be in memory.
  • all (or part) of the data that is needed by the program must be in memory.
  • determines what is in memory and when
  • -optimizing CPU utilization and computer response to users.

activities:
>keeping track of which parts of memory are currently being used and by whom.
>deciding which processes (or parts thereof) and data to move into and out of memory.
>allocating and deallocating memory space as needed.

A

memory management

56
Q
  • is a large array of words or bytes, each with its own address.
  • it is a repository of quickly accessible data shared by the CPU and I/O devices.
A

memory

57
Q
  • OS provides uniform, logical view of information storage
  • each medium is controlled by device (disk drive, tape drive)
  • -varying properties include access speed, capacity, data-transfer rate, access method (sequential or random)
  • files usually organized intro directories.
  • access control on most systems to determine who can access what.

Activites:
>Creating and deleting files and directories
>primitives to manipulate files and directories
>mapping files onto secondary storage
>backup files onto stable (non-volatile) storage media

A

file-system management

58
Q
  • abstract physical properties to logical storage unit
  • is a collection of related information defined by its creator
  • represent programs both source and object forms and data.
A

file

59
Q
  • usually disks used to store data that does not fit in main memory or data that must be kept for a “long” period of time.
  • proper management is of central importance
  • entire speed of computer operation hinges in disk subsystem and its algorithms
activities:
>mounting and unmounting
>free-space management
>storage allocation
>disk scheduling
>partitioning
>protection
A

mass-storage management

60
Q

-multiprocessor environmentmust provide this in hardware such that all CPUs have the mmost recent value in their cache.

A

cache coherency

61
Q

-one purpose of OS is to hide peculiarities of hardware devices from the user.
>memory management of I/O including buffering (storing data temporarily while it is being transferred), cahing (soring parts of data in faster storage for performance), spooling (the overlapping of output of one job with input of other jobs).
>general device-driver interface
>drivers for specific hardware devices.

A

I/O subsystem

62
Q

-anny mechanisms for controlling access of processes or users to resources defined by the OS.

A

protection

63
Q
  • defense of the system against internal and external attacks.
  • -huge range, including denial-of-service, worms, viruses, identity theft, theft of service.
A

security

64
Q

(protection & security)

  • include name and associated number, one per user.
  • then associated with all files, processes of that user to determine access control.
A

user ID

65
Q

(protection and security)

-allows set of users to be defined and controls managed, then also asscoiated with each process, file.

A

group ID

66
Q

(protection and security)

-allows user to change to effective ID with more rights

A

privilege escalation

67
Q
  • allows OS to run applications within other OSes
  • OS natively compiled for CPU, running guest OSes also natively compiled.
  • -consider VMware running WinXP guests, ech running application, all on native WinXp host OS.
  • VMM= provides virtualization services.
A

virtualization

68
Q
  • use when source CPU type different from target types
  • -generally slowest methos
  • -when computer language not compiled to native code– Interpretation
A

emulation

69
Q
  • collection of separate, possibly heterogeneous, systems networked together.
  • is a collection of processors that do not share memory or a clock.
  • provides user access to various system resources, access to shared rsources allows computation speed up, data availability, and enhanced reliability.
A

distributed systems

70
Q 
-is a communications path, TCP/IP most common
>LAN
>WAN
>MAN
>PAN
A

network

71
Q
  • provides features between systems across netwwork
  • communication scheme allows systems to exchange messages
  • illusion of a single system
A

network operating system

72
Q

-systems growing in use and importance
>also known as parallel systems, tightly-coupled systems
>advantages:
-increased throughput–faster execution but not 100% linear speed up
-economy of scale –peripherals, disks, memory shared among processors.
-increased reliability–graceful degradation or fault tolerance

A

multiprocessors

73
Q

(multiprocessors)

-each processor is assigned a specie task.

A

asymmetric multiprocessing

74
Q

(multiprocessors)

-each processor performs all tasks

A

symmetric multiprocessing

75
Q
  • multi-chip and multicore
  • systems containing all chips
  • -chassis containing multiple separate systems
  • each core has their own register and cache
  • both share l2 cache leading to the same memory
A

dual-core design

76
Q
  • one core could switch from one CPU to the next.

- CPU is accessing memory in non-uniform fashion.

A

non-uniform memory access system

77
Q
  • multiple systems working together
  • usually sharing storage via a storage-area networ (SAN)
  • provides a high-availability service which survives failures.
  • some clusters are for high-performance computing (HPC)
  • applications must be written to use parallelization
  • some have distributed lock manager (DLM) to avoid conflicting operations
A

clustered systems

78
Q

(clustered systems)

-has one machine in hot-standby mode

A

asymmetric clustering

79
Q

(clustered systems)

-has multiple nodes running application, mobitoring each other.

A

symmetric clustering

80
Q

-this board is fully-functioning computer, once its slots are populated. It consistsof a processor socket containing a CPU, DRAM sockets, PCle bus slots, and I/O connectors of various types. Even the lowest-cost general-purpose CPU conatins multiple cores. Some contains multiple processor sockets. More advanced computers allow more than one system bpard, creating NUMA systems.

A

PC Motherboard

81
Q

(computing environments)

  • stand-alone general-purpose machines
  • but blurred as most systems interconnect with others (the internet)
  • portals provde web access to internal systems
  • network computers (thin clients) are like Web terminals
  • mobile computers interconnect via wireless
  • netowkring becoming ubiquitous-even home systems use firewalls to protect home computers from Internet attacks
A

Traditional

82
Q

(computing environments)

  • handheld smartphones, tablets, etc.
  • what is the functional difference between them and a “traditional” laptop
  • extra feature-more OS eatures (GPS, gyroscope)
  • allows new types of appls like augmented reality
  • use IEEE 802.11 wireless, or cellular data networs for connectivity
  • leaders are Apple iOS and Google Android.
A

mobile

83
Q

(computing environments)

  • dumb terminals supplanted by smart PCs
  • many systems now servers, responding requests generated by clients
  • you have a server that caters the demands of the clients
A

client server

84
Q

(computing envronments | client server)

-provides an interface to client to request services (i.e. database)

A

computer-server system

85
Q

(computing envrionments | client server)

-provides interface for clients to store ad retreive files

A

file-server system

86
Q

(computing envrionments)

  • another model of distributed system
  • P2P does not distinguish clients and servers
  • instead all nodes are considered peers
  • may each act as client, server or both
  • node must join P2P network
  • broadcast request for service and respond to requests for service via discovery protocol.
  • examples: Napster and Gnutella, Voice over IP (VoIP) such as Skype
A

peer-to-peer

86
Q

(computing envrionments)

  • another model of distributed system
  • P2P does not distinguish clients and servers
  • instead all nodes are considered peers
  • may each act as client, server or both
  • node must join P2P network
  • broadcast request for service and respond to requests for service via discovery protocol.
  • examples: Napster and Gnutella, Voice over IP (VoIP) such as Skype
A

peer-to-peer

87
Q

(computing envrionments)

  • delivers computing, storage, even apps as a service across a network
  • logical extension of virtualization because it uses virtualization as the base for it functionality.
  • amazon EC2 has thousands of servers, millions of virtual machines, petabyte of storage available across the internet, pay based on usage
A

cloud computing

88
Q

(computing envrionments | cloud computing)

-available via internet to anyone willing to pay

A

public cloud

89
Q

(computing envrionments | cloud computing)

-run by a company for the company’s own use

A

private cloud

90
Q

(computing envrionments | cloud computing)

-includes both public and private cloud components

A

hybrid cloud

91
Q

(computing envrionments | cloud computing)

-one or more applications available via the internet (i.e., word processor)

A

software as a service (SaaS)

92
Q

(computing envrionments | cloud computing)

-software stack ready for application use via the Internet (i.e., a database server)

A

platform as a service (PaaS)

93
Q

(computing envrionments | cloud computing)

-servers or storage available over Internet (i.e., storage avaiable for backup use)

A

infrastructure as a service (IaaS)

OS (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions