Post

[OS] Operating System(1-2): Operation, Resource Management, Virtualization

[OS] Operating System(1-2): Operation, Resource Management, Virtualization

πŸ€ 운영체제 전곡 μˆ˜μ—… 정리

OS-Operations


  • Bootstrap program - simple code to initialize the system, load the kernel(컴퓨터λ₯Ό μ΄ˆκΈ°ν™”(λΆ€νŒ…)ν•˜λŠ” 역할을 ν•˜λŠ” κ°„λ‹¨ν•œ μ½”λ“œ)
  • Kernel load
  • Starts system daemons
    • λ°±κ·ΈλΌμš΄λ“œμ—μ„œ μ‹€ν–‰λ˜λŠ” μ„œλΉ„μŠ€ ν”„λ‘œκ·Έλž¨
    • 컀널이 λ‘œλ“œλœ ν›„, system daemonsκ°€ μ‹€ν–‰λ˜λ©° 운영 체제의 μ£Όμš” κΈ°λŠ₯을 λ‹΄λ‹Ή
    • 컀널 μ™ΈλΆ€μ—μ„œ μ œκ³΅λ˜λŠ” μ„œλΉ„μŠ€λ“€λ‘œ, OSκ°€ μ •μƒμ μœΌλ‘œ λ™μž‘ν•˜λ„λ‘ 지원
  • Kernel interrupt driven(기반)
    • Hardware interrupt by one of the devices - μ»΄ν“¨ν„°μ˜ deviceκ°€ CPUμ—κ²Œ μž‘μ—… μš”μ²­μ„ 보낼 λ•Œ λ°œμƒ
      • ex: ν‚€λ³΄λ“œλ₯Ό λˆ„λ₯΄λ©΄ CPUκ°€ 이λ₯Ό κ°μ§€ν•˜κ³  μž…λ ₯을 처리, ν•˜λ“œλ””μŠ€ν¬μ—μ„œ 데이터λ₯Ό 읽을 λ•Œ CPUμ—κ²Œ μ™„λ£Œ μ‹ ν˜Έλ₯Ό 보냄
    • Software interrupt (exception or trap)- Softwareμ—μ„œ νŠΉμ •ν•œ μ΄λ²€νŠΈκ°€ λ°œμƒν•  경우 CPUκ°€ μ²˜λ¦¬ν•˜λŠ” interrupt (λ™κΈ°μ μž„/ ctrl+c 같은 μ™ΈλΆ€ interruptλŠ” 비동기적)
      • software error (ex: Division by Zero, Segmentation Fault)
      • system call - Request for OS service(ν”„λ‘œκ·Έλž¨μ΄ 운영 체제의 κΈ°λŠ₯을 μ‚¬μš©ν•˜κΈ° μœ„ν•΄)
      • ex: 파일 읽기/μ“°κΈ°(read(), write()), ν”„λ‘œμ„ΈμŠ€ 생성(fork()), λ©”λͺ¨λ¦¬ ν• λ‹Ή(malloc())
    • Other process problems
      • ex: Infinite loop, processes modifying each other or the operating system

Multiprogramming and Multitasking


  1. Multiprogramming (Batch System)
    • Single user cannot keep CPU and I/O devices busy at all times(병원 μ§„λ£Œμ²˜λŸΌ)
    • μ—¬λŸ¬ 개의 μž‘μ—…(code, data)을 κ΄€λ¦¬ν•˜μ—¬ CPU always has one to execute(CPUκ°€ 항상 μ‹€ν–‰ν•  μž‘μ—…μ„ κ°€μ§ˆ 수 μžˆλ„λ‘ 함)
    • νŠΉμ§•:
    1. A subset of total jobs in system is kept in memory
    2. One job selected and run via job scheduling
    3. When it has to wait (for I/O for example), OS switches to another job (λ‹€λ₯Έ μž‘μ—…μœΌλ‘œ μ „ν™˜ν•˜μ—¬ CPUκ°€ 놀지 μ•Šλ„λ‘ 함)
  2. Timesharing (multitasking)
    • logical extension in which CPU switches jobs so frequently that users can interact with each job while it is running, creating interactive computing
    • νŠΉμ§•:
    1. Response time should be < 1 second
    2. Each user has at least one program executing in memory -> process
    3. If several jobs ready to run at the same time -> CPU scheduling (CPU scheduling을 톡해 μ—¬λŸ¬ 개의 μ€€λΉ„λœ μž‘μ—… 쀑 ν•˜λ‚˜λ₯Ό 선택 ν›„ μ‹€ν–‰)
    4. If processes don’t fit in memory, swapping moves them in and out to run
    5. Virtual memory allows execution of processes not completely in memory

Multiprogramming vs Multitasking 비ꡐ

κ°œλ…MultiprogrammingMultitasking
λ°©μ‹ν•˜λ‚˜μ˜ ν”„λ‘œκ·Έλž¨μ΄ CPUλ₯Ό μ μœ ν•˜λ©΄, λ‹€λ₯Έ ν”„λ‘œκ·Έλž¨μ€ λŒ€κΈ°CPUκ°€ μ—¬λŸ¬ μž‘μ—…μ„ λΉ λ₯΄κ²Œ μ „ν™˜, λ™μ‹œμ— μ‹€ν–‰λ˜λŠ” κ²ƒμ²˜λŸΌ
λͺ©μ CPUκ°€ 항상 μž‘μ—…μ„ μ‹€ν–‰ν•˜λ„λ‘ μœ μ§€μ‚¬μš©μžκ°€ μ—¬λŸ¬ ν”„λ‘œκ·Έλž¨μ„ λ™μ‹œμ— μ‚¬μš©ν•  수 μžˆλ„λ‘ 지원
CPU ν™œμš©CPUκ°€ 놀지 μ•Šλ„λ‘ I/O μž‘μ—…μ΄ 끝날 λ•ŒκΉŒμ§€ λ‹€λ₯Έ μž‘μ—…μ„ μ‹€ν–‰μ‚¬μš©μžκ°€ μ‹€ν–‰ν•˜λŠ” μ—¬λŸ¬ 개의 ν”„λ‘œκ·Έλž¨μ„ λΉ λ₯΄κ²Œ μ „ν™˜
λ°˜μ‘ 속도즉각적이지 μ•ŠμŒ (배치 처리)< 1초 (즉각적인 λ°˜μ‘)
λŒ€ν‘œ 사둀Batch System (병원 μ§„λ£Œ μ˜ˆμ•½)μš΄μ˜μ²΄μ œμ—μ„œ μ—¬λŸ¬ ν”„λ‘œκ·Έλž¨ μ‹€ν–‰ (Windows, macOS)

alt text

  • λ©”λͺ¨λ¦¬λŠ” OS μ˜μ—­, User Process μ˜μ—­μœΌλ‘œ λ‚˜λ‰¨
  • OSλŠ” λ©”λͺ¨λ¦¬μ˜ max μ£Όμ†Œμ—μ„œ μ‹€ν–‰λ˜λ©°, μ‹œμŠ€ν…œμ„ μ œμ–΄ν•˜κ³  κ΄€λ¦¬ν•œλ‹€
  • μ‚¬μš©μž ν”„λ‘œμ„ΈμŠ€(Process 1, 2, 3, 4)λŠ” λ©”λͺ¨λ¦¬μ˜ ν•˜λ‹¨λΆ€ν„° μœ„μͺ½ λ°©ν–₯으둜 λ‘œλ“œλ¨
    (즉, ν”„λ‘œμ„ΈμŠ€λŠ” μ£Όμ†Œ 0μ—μ„œ μ‹œμž‘ν•˜μ—¬ μœ„μͺ½μœΌλ‘œ 할당됨)
  • 닀쀑 ν”„λ‘œκ·Έλž˜λ° μ‹œμŠ€ν…œμ—μ„œλŠ” μ—¬λŸ¬ 개의 ν”„λ‘œμ„ΈμŠ€κ°€ λ™μ‹œμ— λ©”λͺ¨λ¦¬μ— μ μž¬λ˜μ–΄ CPUκ°€ μž‘μ—…μ„ κ΅μ²΄ν•˜λ©° μ‹€ν–‰ν•  수 있음

Dual-mode and Multimode Operation


Dual-mode operation allows OS ot protect itself and other system components

  • 운영체제λ₯Ό λ³΄ν˜Έν•˜κΈ° μœ„ν•΄ CPUλŠ” 두가지 λͺ¨λ“œμ—μ„œ μž‘λ™:
    • User mode: 일반 μ‚¬μš©μž μ‘μš© ν”„λ‘œκ·Έλž¨ μ‹€ν–‰
    • Kernel mode: OSκ°€ μ‹€ν–‰, ν•˜λ“œμ›¨μ–΄ 및 μ‹œμŠ€ν…œ λ¦¬μ†ŒμŠ€μ— λŒ€ν•œ 전체 κΆŒν•œμ„ 가짐(priviledged mode, supervised mode, system mode)
  • Mode bit: provided by hardware
    • Provides ability to distinguis when system is running user code or kernel code
    • μš΄μ˜μ²΄μ œλŠ” mode bitλ₯Ό ν™•μΈν•˜μ—¬ μ‹œμŠ€ν…œ 보호λ₯Ό μˆ˜ν–‰
  • Privileged Instruction only executable in kernel mode

  • Increasingly CPUs support multi-mode operations
    • Virtual Machine Manager(VMM) λͺ¨λ“œ 지원
    • VMM has more priviledges than user processes but fewer than the kernel

Transition from User to kernel Mode


alt text

Timer to prevent infinite loop / process hogging resources

  • Timer Set: To interrupt the computer after some time period
  • Keep Counter: Decremented(κ°μ†Œ) by the physical clock
  • Operating system set the counter (privileged instruction으둜만 κ°€λŠ₯)
  • When counter zero, generate an interrup
  • Set up before scheduling process to regain control or terminate program that exceeds allotted time

  • μž‘λ™ 방식
    1. User Modeμ—μ„œ μ‹€ν–‰ 쀑인 ν”„λ‘œμ„ΈμŠ€κ°€ System Call (ex: 파일 읽기, λ„€νŠΈμ›Œν¬ μš”μ²­, λ©”λͺ¨λ¦¬ ν• λ‹Ή λ“±)
    2. μ‚¬μš©μžκ°€ System Call β†’ CPUλŠ” trap λ°œλ™ -> Kernel mode둜 변경됨(mode bit = 0)
    3. μž‘μ—… μ™„λ£Œ ν›„ λ‹€μ‹œ User Mode둜 변경됨(mode bit = 1)

alt text

mechanism

Resource Management

Process Management


  1. Processλž€?
    • μ‹€ν–‰ 쀑인 ν”„λ‘œκ·Έλž¨
    • Program은 λ‹¨μˆœν•œ μ½”λ“œ(passive entity), ProcessλŠ” μ‹€ν–‰ 쀑인 μ½”λ“œ(active entity)
  • Process needs resources to accomplish its task
    • CPU, memory, I/O, files, Initialization data
  • Process termination(μ’…λ£Œ) requires reclaim of any reusable resources
    • 즉, OSλŠ” μ’…λ£Œλœ processκ°€ μžμ›μ„ μ°¨μ§€ν•˜μ§€ μ•Šλ„λ‘ ν•΄μ œν•΄μ•Ό 함
  1. Single-threaded vs Multi-threaded
    |β€”β€”|β€”β€”| | Single-threaded | ν•˜λ‚˜μ˜ ν”„λ‘œμ„ΈμŠ€λŠ” ν•˜λ‚˜μ˜ Program Counter 만 가짐 | | β€”β€”β€”β€”β€”β€”- |ν•œ λ²ˆμ— ν•œ 개의 λͺ…λ Ήμ–΄λ§Œ μ‹€ν–‰ κ°€λŠ₯ (순차적 μ‹€ν–‰) | | Multi-threaded | ν•˜λ‚˜μ˜ ν”„λ‘œμ„ΈμŠ€κ°€ μ—¬λŸ¬ 개의 μŠ€λ ˆλ“œλ₯Ό 가짐 | | β€”β€”β€”β€”β€”β€” |각 μŠ€λ ˆλ“œλŠ” 독립적인 Program Counterλ₯Ό κ°€μ§€λ©°, 병렬 μ‹€ν–‰ κ°€λŠ₯ |

  2. Concurrency(λ™μ‹œμ„±)

    • OSλŠ” μ—¬λŸ¬ 개의 processλ₯Ό λ™μ‹œμ— μ‹€ν–‰
    • 일뢀 ν”„λ‘œμ„ΈμŠ€λŠ” User process, μΌλΆ€λŠ” OS process
    • Concurrency by Multiplexing
      • CPUλŠ” μ—¬λŸ¬ processλ₯Ό λΉ λ₯΄κ²Œ Scheduling(μ „ν™˜)ν•˜λ©° μ‹€ν–‰(λ™μ‹œμ— μ‹€ν–‰ν•˜λŠ” κ²ƒμ²˜λŸΌ 보이게)

Process Management Activities


  1. Creating and deleting both user and system processes
  2. Suspending and resuming processes
  3. Providing mechanisms for process synchronization(λ°μ΄ν„°μ˜ 일관성을 μœ„ν•΄)
  4. Providing mechanisms for process communication
  5. Providing mechanisms for deadlock handling

Memory Management


  • To execute a program, all (or part) of the instructions(λͺ…λ Ήμ–΄) must be in memory
  • All (or part) of the data that is needed by the program must be in memory
  • Memory management determines what is in memory and when
    • Optimizing CPU utilization and computer response to users

βœ… Memory management activities

  1. memory μ‚¬μš© 좔적 * Keeping track of which parts of memory are currently being used and by whom
  2. process 관리 * Deciding which processes (or parts thereof) and data to move into and out of memory
  3. memory 곡간 ν• λ‹Ή 및 ν•΄μ œ * Allocating and deallocating memory space as needed

File-system Management


  • OS provides uniform, logical view of information storage
    (μΌκ΄€λ˜κ³  λ…Όλ¦¬μ μœΌλ‘œ 정보λ₯Ό μ €μž₯, 관리)
  • Abstracts physical properties to logical storage unit - file
  • Each medium is controlled by device (ex: disk drive, tape drive)
    • Varying properties:
      1. Access speed
      2. Capacity
      3. Data transfer rate
      4. Access method(sequantial or random)

**File-system management**:

  • Files usually organized into directories
  • Access control: most systems use access control to determine who can access what
  • OS activities include:
    1. Creating and deleting files and directories
    2. Primitives(κΈ°λ³Έ κΈ°λŠ₯) to manipulate files and directories
    3. Mapping files onto secondary storage
      • Mapping: μ‚¬μš©μžκ°€ μ§€μ •ν•œ 파일 이름을 μ €μž₯μž₯치의 μ‹€μ œ μœ„μΉ˜λ‘œ μ—°κ²°ν•΄μ£ΌλŠ” κ³Όμ •
    4. Backup files onto stable(non-volatile) storage media

Mass-storage management


πŸ“šWhat is Mass-storage?

  • Stores data that cannot fit in main memory or needs to be kept for a long period.
    (i.e. Hard disk, SSD, optical disk, magnatic tapes)

βœ… OS management Activities

  1. Mounting/Unmounting: Connecting and disconnecting storage devices
  2. Free-space Management: Managing available storage space
  3. Storage allocation
  4. Disk scheduling: Optimizing input/output operations
  5. Partitioning: Dividing disks into separate sections
  6. Protection
  • Optical storage, magnetic tapes are slower but requre management by the OS or applications.

Caching(⭐)


  • Caching is an important concpet applied at multiple levels in a computer(H/W, OS, S/W)

πŸ“š Principle of Caching

  • Temporarily copying data from slower to faster storage(cache) for quicker access

βœ… Caching works

  • When accessing data, the system checks the cache first
    • If found β†’ Use it directly from cache(fast)
    • If not β†’ Copy from slow storage to cache, then use it

πŸ“ Why need Cache Management

  • Cache smaller than storage being cached, so efficient management is key
  • Design factors:
    • Cache size
    • Replacement policy(Which data to remove when the cache is full)

Type of Storage


alt text

  • lower levels(registers, cache) are faster but smaller, while higher levels(SSD, HDD) are slower but larger
  • registers are inside the CPU, extremely fast but small
  • cache is close to the CPU, faster than main memory but smaller
  • main memory(RAM) holds data during program execution
  • SSD is faster than HDD but slower than RAM
  • magnetic disk(HDD) is the slowest but offers the largest storage capacity\

Data Migration Process


alt text

Data Migration Process

  1. Multitasking Environment
    • The system must always use the most recent data, regardless of where it is stored in the storage hierarchy
  2. Multiprocessor Environment
    • Requires cache coherency(일관성) to ensure that all CPUs have the most recent data in their cache
  3. Distributed Environment
    • The situation is even more complex
    • Multiple copies of the same data can exist, requiring proper management strategies

I/O subsystem


  • OS is to hide peculiarities of hardware devices from the user

βœ… Responsibilities of the I/O Subsystem

  • Memory Management for I/O:
    1. Buffering: Temporarily stores data while it’s being transferred
    2. Caching: Stores parts of data in faster storage for better performance
    3. Spooling: Manages overlapping of job outputs and inputs by placing I/O data in a buffer
      (It refers to putting data of various I/O jobs in a buffer.)
  • Provides a General Device-Driver Interface
    • Ensures that hardware can communicate with the OS
  • Drivers for Specific Hardware Devices

Protection and Security


πŸ“šProtection

  • Mechanisms for controlling access to processes or resources as defined by the OS

πŸ“šSecurity

  • Defense against internal and external attacks Types of attacks include:
    1. denial-of-service(DoS)
    2. worms and viruses
    3. identity Theft
    4. Theft of Service
  • User Identification and Management
    • Systems distinguish among users, to determine who can do what
    • User ID
      • Include usernames and unique IDs(one per user)
      • Linked to files and processes for access control(IDλŠ” μ‚¬μš©μžμ˜ fileκ³Ό process에 μ—°κ²°λ˜μ–΄ access controlλ₯Ό κ²°μ •)
    • Group ID
      • Allow management of user groups for access rights
      • Associated with processes and files
    • Privilege Escalation(κΆŒν•œ μƒμŠΉ)
      • Allows users to switch to an effective ID with higher rights

Virtualization


πŸ“šWhat is virtualization

  • Technology that allows an OS to run applications within other OSes
  • βœ… Emulation: Used when the source CPU type is different from the target type (i.e. PowerPC β†’ Intel x86 β†’ M1 / Apple의 Rosetta)
  • Generally the slowest method
  • If the computer language is not compiled to native code(CPUκ°€ 직접 μ‹€ν–‰ν•  수 μžˆλŠ” 기계어(λ°”μ΄λ„ˆλ¦¬ μ½”λ“œ)), it uses interpretation(μ†ŒμŠ€ μ½”λ“œλ₯Ό ν•œ 쀄씩 ν•΄μ„ν•˜κ³  μ‹€ν–‰ν•˜λŠ” 방식)

βœ… Virtualization

  • OS is natively compiled for the CPU, and it runs guest OSes that are also natively compiled Example:
    • Running Windows XP guests on VMware, with the host OS being Windows XP.
  • VMM (Virtual Machine Manager)
    • Software that provides virtualization services (e.g., VMware, VirtualBox).

βœ… Use case of virtualization

  • Used for exploring and ensuring compatibility(ν˜Έν™˜μ„±) when running multiple OSes Examples:
    1. Running Mac OS X as the host and Windows as the guest on an Apple laptop
    2. Developing apps for multiple OSes without owning multiple systems β†’ Performing QA testing
    3. Executing and managing compute environments within data centers

βœ… Native Execution of VMM

  • If VMM runs natively, it acts as the host OS itself
  • In this case, there is no general-purpose host OS (ex: VMware ESX, Citrix XenServer) β†’ VMMμžμ²΄κ°€ host

Computing Environment - virtualization


alt text

Computing Environment - virtualization

  • The VMM manages multiple VMs, and each VM operates independently with its own kernel and processes
  • This allows multiple OSes to run simultaneously on a single hardware system.
  • VMM = Host OS
ꡬ뢄Computing Environment-Non-virtualized(a)Computing Environment-Virtualized(b)
Kernel단일 컀널 μ‚¬μš©κ° VM이 κ°œλ³„ 컀널 μ‚¬μš©
Process단일 OS의 ν”„λ‘œμ„ΈμŠ€κ° VM이 독립적인 ν”„λ‘œμ„ΈμŠ€ μ‹€ν–‰
Managementν•˜λ“œμ›¨μ–΄λ₯Ό 컀널이 직접 관리VMM이 ν•˜λ“œμ›¨μ–΄ μžμ›μ„ κ΄€λ¦¬ν•˜κ³  VM에 ν• λ‹Ή

Distributed Systems


πŸ“š Distributed Computing

  • A collection of separate, possibly heterogeneous systems that are networked together
  • Systems typically communicate using TCP/IP Types of networks:
    • 🌐 Local Area Network(LAN): Connects computers in a small
    • 🌍 Wide Area Network(WAN): Covers large geographical areas
    • πŸŒ† Metropolitan Area Network(MAN)
    • πŸ“± Personal Area Network(PAN)

πŸ“š Network Operating System

  • Provides features to manage interactions b/w systems across a network Key features:
    1. Communication Scheme: Allows systems to exchange messages
    2. Illusion of a Single System: Users perceive the network as a single system

Computing Environment


Traditional


  1. stand-alone general purpose machines
    • Early computers were stand-alone systems with no internet or network connection
  2. But blurred as most systems interconnect with others (i.e. the Internet)
  3. Portals
    • Provide **web access to internal systems **
  4. Network computers(Thin Clients: ν΄λΌμ΄μ–ΈνŠΈ λ‹¨μ—μ„œλŠ” μ΅œμ†Œν•œμ˜ 처리만 μˆ˜ν–‰ν•˜κ³ , μ£Όμš” μž‘μ—…μ€ 쀑앙 μ„œλ²„μ—μ„œ 처리)
    • Thin clients act like web terminals, depending on central servers for processing and data
  5. Wireless Networks
    • Mobile computers connect with each other using wireless networks
  6. Networking Becoming Ubiquitous(λ³΄νŽΈν™”)
    • Home systems use firewalls to protect against internet attacks.

βœ… Stand-alone β†’ Connected

Mobile


  • Handheld smartphones, tablets, and similar portable devices
  • Functional difference from Traditional laptops
    • Extra Features: Mobile OS offer more features like GPS and gyroscope
  • Allows new types of apps like augmented reality(AR)
  • Connectivity
    • Using IEEE 802.11 wireless networks(Wi-Fi) or cellular data networks(4G, 5G)
  • Leaders
    • Apple iOS, Google Andriod

Client-Server


Older dumb terminals(:μ„œλ²„μ—μ„œ 처리된 데이터λ₯Ό λ‹¨μˆœνžˆ 좜λ ₯) have been replaced by smart PCs

πŸ“š Now many systems act as servers, handling requests generated by clients = Client-Server Computing

βœ… Types of Servers

  1. Computer-server system: Provides an interface for clients to request services, such as accessing databases.
  2. File-server system: Provides an interface for clients to store and retrieve files alt text

    Client-Server Connection Structure

Peer-to-Peer(P2P)


πŸ“š P2P is another type of distributed system where nodes connect directly with each other alt text

P2P

βœ… Key feature of P2P

  • No distinction b/w clients and servers
  • All nodes are treated as peers
  • Each node can act as a client, server, or both depending on the situation
  • A node must join the P2P network to participate
    β†’ How to Join a P2P Network
    1. Register Service: Nodes register their services with a central lookup service on the network
    2. Broadcast Request: Nodes broadcast service requests and respond to requests using the discovery protocol(λ„€νŠΈμ›Œν¬μ—μ„œ μ„œλΉ„μŠ€λ₯Ό μ°Ύκ³  μƒν˜Έ μž‘μš©μ„ λ•λŠ” protocol)
  • Examples of P2P:
    • Napster, Gnutella
    • VoIP(Voice over IP): like Skype

Cloud Computing


πŸ“š Cloud Computing: Delivers computing, storage, and applications as services over a network

  • Cloud computing is a logical extension of virtualization
    • EX: Amazon EC2 - Provides thousands of servers, millions of virtual machines, and massive storage βœ… **Type of Cloud Computing**: 1. 🌐 Public Cloud: Available over the Internet to anyone willing to pay 2. 🏒 Private Cloud: Operated internally by a company for its own use 3. πŸ”„ Hybrid Cloud: Combines public and private cloud components

βœ… **Cloud Service Models**:

  1. SaaS(Software as a Service)
    • Delivers software applications via the Internet (i.e. word processor(Google Docs, Microsoft Office 365))
  2. PaaS(Platform as a Service)
    • Provides a platform for developers to build and deploy applications (i.e. database server)
  3. IaaS(Infrastructure as a Service)
    • Offers infrastructure resources like servers and storage over the Internet(i.e. storage available for backup use)
  • Components of Cloud Computing
    • Traditional OSes
    • VMMs (Virtual Machine Managers)
    • Cloud Management Tools
  • Internet connectivity requires security tools like firewalls
  • Load Balancers: Distribute traffic across multiple applications(to ensure no single server is overloaded)

alt text

Cloud Computing

Real-Time Embedded Systems


πŸ“š Real-Time(μ‹€μ‹œκ°„) Embedded Systems

  • Most prevalent form of computers today
  • Use special-purpose OS designed for specific tasks(Ex: Real-Time OS(RTOS))

  • Some systems have OS, while others operate without an OS

βœ… Feature of Real-Time OS(RTOS)

  1. Well-defined, fixed time constraints for processing
  2. Processing must be completed within the specified time(Failure to meet deadlines results in system errors)
  3. Correct operation only if constraints met
This post is licensed under CC BY 4.0 by the author.