LECTURE 1: COMPUTER SYSTEMS AND PLATFORM - Storage – capable of retrieving and saving instructions

TECHNOLOGIES as well as data.

- Primary storage – memory that is immediately
Computer Hardware available to the CPU (RAM – random access
- Computer – programmable electronic machine – high memory)
speed-mathematical/logical operations that processes - Secondary storage – indirectly available to
information. the CPU (hard disks, tape, etc)
- Basic Structure of a Computer System: - Input/Output (I/O) subsystem – responsible for
- CPU (Central Processing Unit) – arithmetic receiving and sending data to the outside world.
and logical operations - Number systems – everything that the computer
- Input – output devices handles is stored in the form of numbers.
- Memory - Coding text – ASCII – subset of Unicode done to
- Primary – directly accessible by encode international symbols.
CPU - Image – rectangle of dots, each dot is represented by
- Secondary – external memory for color.
storing data - Sound – represented as a sequence of numbers.
- Computer Hardware – physical components; does not
include data or computer programs.
- Ram memory
- Cpu’s processor
- Motherboards
- Hard drives
- Floppy drives
- CD ROM Drives
- Mice
- Keyboards - System components:
- Modems - Cpu/microprocessor
- Video cards - Memory subsystem
- Monitors - i/o subsystem
- Printers - system buses
- Multimedia speakers - address bus
- Sound cards - data bus
- Video camera - control bus
- Backup drive - instruction cycle
- Computer cases - fetch
- Other equipment - decode
- Block diagram – representation of the fundamental - execute
pieces of any computer system. - types of memory
- CPU is protected from heat by heatsink and fan. - static RAM
- USB flash drive – compact device. - dynamic RAM
- Compaq 7000 - ROM
- System – group of interacting, interrelated or - PROM
independent elements forming a complex whole. - EPROM
- Computer system - primary purpose is to perform - EEPROM
calculations. - Von neumann architecture
- CPU is composed of: - Instructions and data mixed
- Control Unit – controls different components - Used in modern computers
of the system; fetch, decode, execute - Harvard architecture
instructions. - Instructions and data separate
- Arithmetic and Logic Unit – performs - Used in low-level cache memory design
arithmetic and logical operations.
1
 - Big endian data organization – most significant byte - Program instructions executed sequentially.
first (100-103 = 01-04) - 3 major units in computer tied by buses
- Little endian data organization – least significant byte - Memory – stores/retrieves instructions and
first (100-103 = 04-01) data
- Input device organization - Processor
Input device - > tri-state buffers - > data bus - Control unit – fetch inst from mem,
- Output device organization decode, execute.
Output device < - register < - data bus - ALU – mathematical/logical
- Bidirectional i/o device organization operations
Input device - > tri-state buffers - > data bus - Input/output units – handles communication
Output device < - register < - data bus with the outside world.
- Flow of information
MODULE 02: THE VONN NEUMANN ARCHITECTURE
- Computer science – study of algorithms including
- Formal/mathematical properties
- Hardware realizations
- Linguistic realizations - Memory – aka RAM; consists of memory cells of fixed
- Applications size.
- Different computers: - Program and data are stored in memory
- Multi-million dollar supercomputers - RAM
- Million dollar mainframes - need to distinguish between address of
- Minicomputers memory cell and content of memory cell.
- Workstations - Memory width – one byte (8 bits)
- Laptops - Address width – bits to represent each
- Less than $100 hand held personal digital address, determines the maximum memory
assistants size = address space
- Stored program computer - Address space = 2^N – address width (N)
- 1943: ENIAC – presper Eckert and - Memory size/speed
john mauchly – first general - Typical memory – 64mb -256mb
electronic computer; hard-wired - Kilobyte – 2^10 = 1 024 bytes
program. - Megabyte – 2^20 = 1 048 576 bytes
- 1944: beginning of EDVAC – - Gigabyte – 2^30 = 1 073 741 824 bytes
includes program stored in memory - Memory access time (Read/write from mem)
- 1945: John Von Neumann – first – 50-75 nanoseconds (1 nsec. =
draft of a report on EDVAC 0.000000001 sec)
- Basic structure of the “voon - Ram is volatile (store when on); relatively
neumann machine” expensive.
- Memory – instructions, - Operations on memory
data - Fetch (address) – copy of content of memory
- Processing unit – cell with specified address; non-destructive,
arithmetic, logical op copies value in memory cell
- Control unit – interpreting - Store (address, value) – store specified value
instructions in memory cell specified by address;
- Vonn Neumann Architecture destructive, overwrites previous value of
- Main sub-systems: memory cell
- Memory - Memory system
- ALU - MAR
- Control unit - MDR
- Input/output subsystem - Fetch/store signal
- Program stored in memory during execution - Structure of memory subsystem
2
- Fetch (address)
- Load add into mar
- Decode add in mar
- Copy content of mem cell with specified
address.
- Store (address, value)
- Loadd add into mar
- Load value into mdr
- Decode address in mar
- Copy content of mdr into mem cell with
specified address
- Structure of the I/O subsystem
- Structure of ALU
- Register – very fast local memory cells; stores
operands of operations and intermediate
results
- CCR (condition code register) – special
purpose register ( <, =, >)
- Bus – data path interconnecting the registers
to the ALU circuitry.
- Machine language instructions
- Operation code – which op to perform
- Address field – telling memory address of the
values on which the operation works.
- Approached
- Reduced instruction set computers
(RISC) – small, simple instructions;
faster – minimized amount of
circuitry.
- Complex instruction set computers –
more instructions, many very
complex; reqs more circuitry.
- Data transfer
- Load x – [X] to R
- Store x – R to [x]
- Move x, y – [x] to [y]
- Arithmetic
- Add x, y, z = [z] = [x] + [y]
- Add x, y = [y] = [x] + [y]
- Add x = r = [x] + R
- Compare
- Compare x, y – if [x] = R, set EQ =0,
GT=0, LT=0
- Branch
- Jump x = load next instruction from
[x]
- Jumpgtx
- Control – halt (stop)
- Structure of control unit
- Pc (program counter) – stores
address of next instruction to fetch
- IR (instruction register) – stores
instructions fetched from memory
- ID (instruction decoder) – decodes
instructions and activates necessary
circuitry.
- Fetch phase
- Pc - > MAR
- Fetch signal (signal mem to fetch val into mdr)
- Mdr - > IR (move val to iR)
- Pc + 1 (increase address in program counter)
- Decode phase
- IR - > instruction decoder (Decode instruction
in IR)
- Instruction decoder generate signals to
activate circuitry to carry out instruction.
- Execute phase
- Differs from one instruction to next
3
 - Jmp
- Cmp – implied subtraction of a source operand from a
destination operand; cmp <destination>,<source>.
- Inc
- Dec
- Mov – copies byte or a word from a specified source to
destination; mov <destination>,<source>
- Flags register
- Sign flag (sf) – result of an arithmetic or logical
operation generates a negative result.
- Zero flag (zf) – generates a result of zero.
- Carry flag – too large to fit into destination.
ASSEMBLY LANGUAGE PROGRAMMING - Overflow flag (of) = too large or small to fit into
destination.
- Machine languages – first gen language; most basic - Auxiliary carry flag (AC) – causes a carry from
type of computer languages. bit 3 to bit 4 in an 8 bit operand.
- Assembly languages – codes resembling English. LDA - Parity flag (pf) – least significant byte in the
– load; STA – store; requires an assembler; each line result contains an even number of 1 bit.
of assembly can be replaced by the equivalent one line - Stack is an important portion of the memory
of object machine code. - system in all microprocessor. It holds data
- Higher-level languages – English like language that - temporarily and store return addresses from
provides for more natural expression of algorithms; - subroutines.
BASIC, Pascal, COBOL and PROLOG
PARAMETERS FOR SELECTING A SUITABLE IoT OS
CLASSIFICATION
- Footprint – since devices are constraint, we expect OS
- High level language to have low memory, power and processing
- Mid level language – combines low level efficiency with requirement.
high level language structure; C and MODULA-2. - Scalability – OS must be scalable for any type of
- Low level language – machine oriented; assembly and device. Familiarity with only one OS for both nodes and
machine language. gateways.
- Portability – OS isolates application from the specifics
- Language translator – aka language processor; software of the hardware. OS is ported to different hardware
that accepts source program coded in high/mid level platforms and interfaces to the board support package
language as input and produces equivalent machine (BSP) in a standard way such as using POSIX calls.
language instruction. - Modularity – OS has a kernel core that’s mandatory.
- Compiler – special program that processes All other functionality can be included as add-ons if so
statements written in a particular required by application.
programming language and turns into - Connectivity – OS supports different connectivity
machine language. protocols such as Ethernet, WiFi, BLE, IEEE 802.15.4
- Interpreter – computer program that directly and more.
executes instructions written in a - Security – OS has add-ons that bring security to the
programming or scripting language. device by way of secure boot, SSL support,
- Assembler – low level. components and drivers for encryption.
- Linker – computer program for high, mid and low levels of - Reliability – essential for mission-critical systems.
programming language; converts object code into Often devices are
executable machine code. - at remote locations and have to work for years without
- Assembly language – low-level language that provides a failure. Reliability also
kind of shorthand notation called mnemonic (memory aid) - implies OS should fulfill certifications for certain
for the actual machine language instruction. applications.
- Program control - transfer instructions change or modify
the flow of program.

4
MULTIMEDIA PLATFORM
- multi – many
- medium – substance regarded as the means of
transmission of a force or effect.
- Multimedia – represented through audio, video, and
animation in addition to traditional media.
- Medium – means for distribution and presentation of
information.
- Time independent (discrete) – text, graphics
- Time dependent (continuous) – audio, video
- Multimedia authoring tools – provide capability for
creating a complete multimedia presentations by
linking together objects.
- Macromedia flash
- Macromedia director
- Authorware
- Interactive multimedia – end user is allowed to control
what and when the elements are delivered.
- Interactive multimedia is Hypermedia – end user is
provided with the structure of linked elements trhough
which she can navigate.
- Multimedia is linear – not interactive – users sit and
watch; movie.
- Multimedia is nonlinear – users are given the
navigational control and can browse.
- Multimedia system – characterized by computer-
controlled, integrated production, etc.
- Data stream – any sequence of individual packets
transmitted in a time dependent fashion.
- Packets – carry information
- Transmission modes
- Asynchronous – packets can reach receiver
as fast as possible; for discrete media.
- Synchronous – defines maximum end to end
delay.
- Isochronous – defines maximum and
minimum end to end delay.
- Social media – collective online communication
channels dedicated to community based input,
interaction, content sharing and collaboration.