Distributed processing

Distributed processing

definition – Collection of hardware, software, and communication devices among which tasks are spread.

May be very coordinated (multiprocessor computer) or very open (Internet)

All networks are distributed systems, but not all distributed systems are networks.

Network architecture

Draw and recognize bus, ring, star, hierarchy, network (fully-distributed and irregular) and hybrid

Give strong and weak points of each

Privacy

Security

External

Internal

Cost

Reliability

Network protocols

Reason for layer architectures

OSI

Names of layers

Basic jobs of each

Internet 4-layer model

Names of layers

Task of each in communication at source, destination, and final nodes

TCP/IP (including UDP)

IP addresses

Symbolic domain names

URL’s – identify all parts

Token ring

CSMA/CD

Search engines

Two types, keyword and concept-based (thematic)

Use of metatags to guide search engine robots

Web basics

Location and protection of Web documents in your H: drive

Basic tags

<HTML>

<HEAD>

<BODY> bgcolor, background, text, link, vlink attributes

<TITLE>

<BR>

<P>

<UL>

<OL>

<LI>

<IMG> src, border attributes

<A>

<FONT> color attribute

Color codes

Be able to interpret codes; predict colors in simple cases (black, white, red, green, blue, purple) and be able to tell which of two colors is darker.

XML

What is XML for?

Be able to describe the basic (tree) structure of an XML document

Be able to describe the relationship between an XML document and the XSL stylesheet – what is the basic task of each part

Given an XML document and an XSL stylesheet, be able to sketch what the rendered page would look like

Resource conflicts

Deadlock

Be able to define deadlock

Given the steps of two algorithms, be able to show (if it exists) some sequence of those steps which will result in deadlock

Be able to list the three necessary conditions for deadlock to be possible.

Be able to tell if it is possible to absolutely prevent deadlock, and at what cost.

Lost update

Be able to define the lost update problem

Given the steps of two algorithms, be able to show (if it exists) some sequence of those steps which will result in a lost update