0% found this document useful (0 votes)
16 views11 pages

Unit V Complete (2) Os

Uploaded by

Yogesh Gaur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views11 pages

Unit V Complete (2) Os

Uploaded by

Yogesh Gaur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Real Time Systems

Real time system means that the system is subjected to real time, i.e., response should be guaranteed
within a specified timing constraint or system should meet the specified deadline. For example: flight
control system, real time monitors etc.

Types of real time systems based on timing constraints:

1. Hard real time system –

This type of sytem can never miss its deadline. Missing the deadline may have disastrous
consequences.The usefulness of result produced by a hard real time system decreases abruptly and
may become negative if tardiness increases. Tardiness means how late a real time system completes its
task with respect to its deadline. Example: Flight controller system.

2. Soft real time system –

This type of system can miss its deadline occasionally with some acceptably low probability. Missing
the deadline have no disastrous consequences. The usefulness of result produced by a soft real time
system decreases gradually with increase in tardiness. Example: Telephone switches.

Reference model of real time system: Our reference model is characterized by three elements:

1. A workload model: It specifies the application supported by system.

2. A resource model: It specifies the resources available to the application.

3. Algorithms: It specifies how the application system will use resources.

Terms related to real time system:

• Job – A job is a small piece of work that can be assigned to a processor and may or may not
require resources.

• Task – A set of related jobs that jointly provide some system functionality.

• Release time of a job – It is the time at which job becomes ready for execution.

• Execution time of a job – It is the time taken by job to finish its execution.

• Deadline of a job – It is the time by which a job should finish its execution. Deadline is of two
types: absolute deadline and relative deadline.
• Response time of a job – It is the length of time from release time of a job to the instant when it
finishes.

• Maximum allowable response time of a job is called its relative deadline.

• Absolute deadline of a job is equal to its relative deadline plus its release time.

• Processors are also known as active resources. They are essential for execution of a job. A job
must have one or more processors in order to execute and proceed towards completion. Example:
computer, transmission links.

• Resources are also known as passive resources. A job may or may not require a resource during
its execution. Example: memory, mutex

• Two resources are identical if they can be used interchangeably else they are heterogeneous.

Palm OS

Palm OS is a proprietary mobile operating system. Designed in 1996 for Palm Computing, Inc.'s new
Pilot PDA, it has been implemented on a wide array of mobile devices, including smartphones, wrist
watches, handheld gaming consoles, barcode readers and GPS devices.

Palm OS versions earlier than 5.0 run on Motorola/Freescale DragonBall processors. From version 5.0
onwards, Palm OS runs on ARM architecture-based processors.

The key features of the current Palm OS Garnet are:

• Simple, single-tasking environment to allow launching of full screen applications with a basic,
common GUI set

• Monochrome or color screens with resolutions up to 480x320 pixel

• Handwriting recognition input system called Graffiti 2

• HotSync technology for data synchronization with desktop computers

• Sound playback and record capabilities

• Simple security model: Device can be locked by password, arbitrary application records can be
made private

• TCP/IP network access

• Serial port/USB, infrared, Bluetooth and Wi-Fi connections

• Expansion memory card support


• Defined standard data format for personal information management applications to store
calendar, address, task and note entries, accessible by third-party applications.

Symbian OS

• Design

o Symbian features pre-emptive multitasking and memory protection

o Symbian OS was created with three systems design principles in mind:

o the integrity and security of user data is paramount

o user time must not be wasted

o all resources are scarce

o Symbian uses a microkernel, has a request-and-callback approach to services, and


maintains separation between user interface and engine.

o The OS is optimised for low-power battery-based devices

o Applications, and the OS itself, follow an object-oriented design: Model-view-controller


(MVC).

o Later OS iterations diluted this approach in response to market demands, notably with the
introduction of a real-time kernel and a platform security model in versions 8 and 9.

o There is a strong emphasis on conserving resources

Symbian^3/An Symbian^1/Series Series 60 3rd


Feature Symbian^2[58] Series 80
na/Belle 60 5th Edition Edition

2010
(Symbian^3), 2010 (Japan only
Year released 2011 (Symbian with MOAP/OPP 2008 2006 2001
Anna, Nokia middleware)
Belle)

Symbian Symbian
Company Symbian Foundation Nokia Nokia
Foundation Foundation

9.5
Symbian OS
(Symbian^3/Sy 9.4 9.3
version
mbian Anna),
10.1 (Nokia
Belle)

Touch input
Yes Yes Yes No No
support

Multi touch
Yes No No No
input support

External Multi
MicroSD, up to MicroSD,
Storage Card MicroSD MicroSD Media
32GB MiniSD
Support Card

CPU
architecture ARM SH-Mobile ARM ARM ARM
support

Programmed
C++, Qt C++, Qt C++, Qt
in

Non English
languages Yes mainly Japanese Yes Yes Yes
support

Underlining
Yes Yes[67] Yes Yes
spell checker

• Features

o User interface

Symbian has had a native graphics toolkit since its inception, known as AVKON (formerly known as
Series 60). S60 was designed to be manipulated by a keyboard-like interface metaphor, such as the
~15-key augmented telephone keypad, or the mini-QWERTY keyboards. AVKON-based software is
binary-compatible with Symbian versions up to and including Symbian^3.

o Browser

Symbian^3 and earlier have a built-in WebKit based browser. Symbian was the first mobile platform
to make use of WebKit (in June 2005).[40] Some older Symbian models have Opera Mobile as their
default browser.
o Multiple language support

Symbian has strong localization support enabling manufacturers and 3rd party application developers
to localize their Symbian based products in order to support global distribution. Current Symbian
release (Symbian Belle) has support for 48 languages, which Nokia makes available on device in
language packs (set of languages which cover the languages commonly spoken in the area where the
device variant is intended to be sold). All language packs have in common English (or a locally
relevant dialect of it).

o Application development

From 2010, Symbian switched to using standard C++ with Qt as the main SDK, which can be used
with either Qt Creator or Carbide.c++. Qt supports the older Symbian/S60 3rd (starting with Feature
Pack 1, a.k.a. S60 3.1) and Symbian/S60 5th Edition (a.k.a. S60 5.01b) releases, as well as the new
Symbian platform. It also supports Maemo and MeeGo, Windows, Linux and Mac OS X.[42][43]

Windows CE

• Features

o Windows CE is optimized for devices that have minimal memory

o Windows CE kernel may run with one megabyte of memory.

o Devices are often configured without disk storage, and may be configured as a "closed"
system that does not allow for end-user extension (for instance, it can be burned into
ROM).

o Windows CE conforms to the definition of a real-time operating system, with a


deterministic interrupt latency. From Version 3 and onward, the system supports
256 priority levels and uses priority inheritance for dealing with priority inversion.

o The fundamental unit of execution is the thread. This helps to simplify the interface and
improve execution time.

o The first version – known during development under the code name "Pegasus" –
featured a Windows-like GUI and a number of Microsoft's popular apps, all trimmed
down for smaller storage, memory, and speed of the palmtops of the day.

o Many platforms have been based on the core Windows CE operating system, including
Microsoft's AutoPC, Pocket PC 2000, Pocket PC 2002, Windows Mobile 2003,
Windows Mobile 2003 SE, Windows Mobile 5, Windows Mobile 6, etc.
o A distinctive feature of Windows CE compared to other Microsoft operating systems is
that large parts of it are offered in source code form.

Version Changes

Released November 16, 1996.Codename "Pegasus".

• Devices named "handheld PC" (H/PC)[17]


1.0
• 4 MB ROM minimum

• 2 MB RAM minimum

Released September 29, 1997. Codename "Birch"

• Devices named "Palm-sized PC"

• Real-time deterministic task scheduling

• Architectures: ARM, MIPS, PowerPC, StrongARM, SuperH and x86


2.0
• 32-bit color screens

• SSL 2.0 and SSL 3.0

• Unsupported as of September 30, 2002 for Windows CE 2.11 and September 30,
2005 for Windows CE 2.12.

Released June 15, 2000. Codename "Cedar" and "Galileo".

• Major recode that made CE hard real time down to the microsecond level

• Base for the Pocket PC 2000, Handheld PC 2000, Pocket PC 2002 and Smartphone
3.0 2002

• Priority levels were increased from 8 to 256

• Restricted access to critical APIs or restricting write access to parts of the registry

• Unsupported as of October 9, 2007.

Released January 7, 2002. Codename "Talisker/Jameson/McKendric".

• Integrated with .NET Compact Framework

4.x • Driver structure changed greatly, new features added

• Base for "Pocket PC 2003"

• Flash memory and Bluetooth support


• HID devices and standardized keyboards support

• Pocket Office was reduced to Wordpad

• Separation to two editions – Core (only shell) and Professional (with Microsoft
Accessories)

• In addition to the older PocketIE browser, Internet Explorer Mobile was available
with near 100% page compatibility to its IE 5.5 desktop cousin.

Released in August 2004. Adds many new features. Codename "Macallan"

• Added automatic reporting for manufacturers

• Direct3D Mobile, a COM-based version of Windows XP's DirectX multimedia API

• DirectDraw for 2D graphics and DirectShow for camera and video digitisation
support
5.x
• Remote Desktop Protocol (RDP) support

• In this version Wordpad has been eliminated too

• The "Pro" version contains the Internet Explorer browser and Windows Media Player
9

• Support ended on October 14, 2014.

Released in September 2006. Codename "Yamazaki".

• Process address space is increased from 32 MB to 2 GB

6.0 • Number of processes has been increased from 32 to 32,768

• User mode and kernel mode device drivers are possible

• 512 MB physically managed memory

Released in March 2011.

• Multi-core CPU support (SMP)

• Wi-Fi Positioning System


7.0
• Bluetooth 3.0 + HS support

• DLNA (Digital Living Network Alliance)

• DRM technology
• Media Transfer Protocol

• Advanced touch and gesture input

• Kernel support for 3 GB physical RAM and supports ARMv7 assembly (has support
for "x86, SH (automotive only) and ARM.")

• Supported until April 13, 2021.

• Released in June 2013

• DHCPv6 client with stateful/stateless address configuration.


2013
• Supported until October 10, 2023.

• HTML help viewer added.

Comparison Linux Unix

It is an open-source operating
It is an operating system which can be only used
Definition system which is freely available to
by its copyrighters.
everyone.

It has different distributions like


Examples IBM AIX, HP-UX and Sun Solaris.
Ubuntu, Redhat, Fedora, etc

As it is open source, it is developed Unix was developed by AT&T Labs, various


Development by sharing and collaboration of commercial vendors and non-profit
codes by world-wide developers. organizations.

Linux kernel is developed by the


community of developers from Unix has three distributions IBM AIX, HP-UX
Manufacturer different parts of the world. and Sun Solaris. Apple also uses Unix to make
Although the father of Linux, Linus OSX operating system.
Torvalds oversees things.

Nowadays, Linux is in great


demand. Anyone can use Linux It was developed mainly for servers, workstations
Users
whether a home user, developer or a and mainframes.
student.

Linux is freely distributed,


Cost Unix copyright vendors decide different costs for
downloaded, and distributed
through magazines also. And priced their respective Unix Operating systems.
distributions of Linux are also
cheaper than Windows.

Linux is command based but some


Initially it was command based OS, but later
distros provide GUI based Linux.
GUI Common Desktop Environment was created.
Gnome and KDE are mostly used
Most Unix distributions use Gnome.
GUI.

The default interface is BASH


(Bourne Again SHell). But some It originally used Bourne shell. But is also
Interface
distros have developed their own compatible with other GUIs.
interfaces.

File system Linux supports more file system


It also supports file system but lesser than Linux.
support than Unix. E.g. ext,ext2

Linux is a Unix clone, behaves like Unix contains a completely different coding
Coding
Unix but doesn't contain its code. developed by AT&T Labs.

Operating
Linux is just the kernel. Unix is a complete package of Operating system.
system

Process Scheduling in Linux:

Linux has two separate process-scheduling algorithms.

• One is a time-sharing algorithm for fair, preemptive scheduling among multiple processes
• The other is designed for real-time tasks, where absolute priorities are more important than
fairness.

The Linux scheduler is a preemptive, priority-based algorithm with two separate priority ranges

• a real-time range from 0 to 99


• and a nice value ranging from 100 to 140.

These two ranges map into a global priority scheme whereby numerically lower values indicate higher
priorities. Unlike schedulers for many other systems, Linux assigns higher-priority tasks longer time
quanta and vice-versa.
A runnable task is considered eligible for execution on the CPU so long as it has time remaining in its
time slice. When a task has exhausted its time slice, it is considered expired and is not eligible for
execution again until all other tasks have also exhausted their time quanta. The kernel maintains a list
of all runnable tasks in a runqueue data structure. Because of its support for SMP, each processor
maintains its own runqueue and schedules itself independently.

Each runqueue contains two priority arrays—active and expired. The active array contains all tasks
with time remaining in their time slices, and the expired array contains all expired tasks. Each of these
priority arrays includes a list of tasks indexed according to priority. The scheduler chooses the task
with the highest priority from the active array for execution on the CPU. On multiprocessor machines,
this means that each processor is scheduling the highest-priority task from its own runqueue structure.

When all tasks have exhausted their time slices (that is, the active array is empty), the two priority
arrays are exchanged as the expired array becomes the active array and vice-versa.

Buddy System:

Memory management is a fundamental issue in operating systems. A fixed partitioning scheme limits
the number of active processes and may use space inefficiently if there is a poor match between
available partition sizes and process sizes. A dynamic partitioning scheme is more complex to
maintain and includes the overhead of compaction.

A compromise is a buddy system, where the entire memory space available for allocation is initially
treated as a single block whose size is a power of 2. When the first request is made, if its size is greater
than half of the initial block then the entire block is allocated. Otherwise, the block is split in two equal
companion buddies. If the size of the request is greater than half of one of the buddies, then allocate
one to it. Otherwise, one of the buddies is split in half again. This method continues until the smallest
block greater than or equal to the size of the request is found and allocated to it.

• Suppose we have 16K to manage. It starts as one large block


• Now, we have a request A for a block of 3.6k
• Next, handle request B for 1.5K
• Now service allocations of 1.2K (C), 1.9K (D) and 2.7K (E)
• Suppose the C allocation is freed
• Then, if B is also freed
• Suppose we process two more allocations, for 1.5K (F) and 1.6K (G)
• Then D is freed

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy