Application Architecture and Modeling: C H A P T E R

SYSTEMS ANALYSIS AND DESIGN METHODS 5th Edition Whitten Bentley Dittman
C H A P T E R
11 APPLICATION
ARCHITECTURE
AND MODELING
Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Chapter 11 Application Architecture & Modeling

• Define an information system’s architecture in terms of data, Processes,
and Interfaces—the building blocks of all information systems. Consistent
with modern trends, these building blocks will be distributed across a
network.
• Differentiate between logical and physical data flow diagrams, and explain
how physical data flow diagrams are used to model an information
system’s architecture.
• Describe both centralized and distributed computing alternatives for
information system design, including various client/server and Internet-
based computing options.
• Describe database and data distribution alternatives for information system
design.
• Describe user and system interface alternatives for information system
design.
• Describe various software development environments for information
system design.
• Describe strategies for developing or determining the architecture of an
information system.
• Draw physical data flow diagrams for an information system’s architecture
and processes.

Chapter Map

Application Architecture
An application architecture specifies the technologies

to be used to implement one or more (and possibly all)
information systems in terms of DATA, PROCESS, and
INTERFACE, and how these components interact across
a network.
It serves as an outline or blueprint for detailed design and

implementation.

Physical Data Flow Diagrams (DFDs)
Physical data flow diagrams (DFDs) model the

technical and human decisions to be implemented as part
of an information system. They communicate technical
choices and other design decisions to those who will
actually construct and implement the system.
– Recall from Chapter 8 that DFDs are a type of

process model.

Sample Physical Data Flow Diagram

Physical Processes
A physical process is either a processor, such as a computer or

person, or a technical implementation of specific work to be
performed, such as a computer program or manual process.
– Logical processes may be assigned to physical processors such
as PCs, servers, mainframes, people, or devices in a network.
A physical DFD would model that network structure.
– Each logical process requires an implementation as one or
more physical processes. Note that a logical process may be
split into multiple physical processes:
• To define those aspects that are performed by people or computers.
• To define those aspects to be implemented by different technologies.
• To show multiple implementations of the same process.
• To add processes for exceptions and internal control (e.g., security).

Physical Process Notation
I D ( o p t i o n a l )
A c t i o n V e r b
+
N o u n o r O b j e c t
P h r a s e
I m p l e m e n t a t i o n

Samples of Physical Processes

Possible Computer Process Implementations
• A purchased application software package

– Also called commercial off-the-shelf (COTS) software
• A system or utility program
• An existing application program

– May require modification
• A program to be written

Sample Physical Process Implementations

Physical Data Flows
A physical data flow represents any of the following:

– The planned implementation of an input to, or output
from a physical process.
– A database command or action such as create, read,
update, or delete.
– The import of data from, or the export of data to
another information system across a network.
– The flow of data between to modules or subroutines
(represented as physical processes) in a program.

Sample Physical Data Flows

Sample Physical Data Flows (continued)

Physical External Agents and Data Stores
Physical external agents are carried over from the logical

DFD models.
– If scope changes, the logical models should be changed
before the physical models are drawn.
A physical data store represents the planned implementation

of one of:
– A database
– A table in a database
– A computer file
– A tape or media backup of anything important
– A temporary file or batch
– Any type of noncomputerized file

Physical Data Store Notation
I D I m p l e m e n t a t i o n M e t h o d :
( o p t ) D a t a S t o r e N a m e
I D D a t a S t o r e N a m e
( o p t( )I m p l e m e n t a t i o n M e t h o d )

Physical Data Store Implementations

Distributed versus Centralized Systems
A distributed system is one in which the DATA,

PROCESS, and INTERFACE components of an
information system are distributed to multiple locations
in a computer network. Accordingly, the processing
workload is distributed across the network.
In centralized systems, a central, multi-user computer

hosts all the DATA, PROCESS, and INTERFACE
components of an information system. Users interact
with the system via terminals (or terminal emulators).

Why Distributed Systems?
• Modern business systems are already decentralized and

distributed.
• Distributed computing moves information and services
closer to the customers and users who need them.
• Distributed computing consolidates the power of
personal computers across the enterprise.
• Distributed computing solutions are more user-friendly
because they utilize the PC as the end user interface.
• Personal computers and network servers are cheaper
than centralized mainframe computers.

Distributed Computing Layers
• Presentation layer—the user interface
• Presentation layer logic—such as input editing
• Application logic layer—the business rules, policies,

and procedures
• Data manipulation layer—to store and retrieve data to

and from the database
• Data layer—the actual business data

Flavors of Distributed Computing

File Server Architecture
A local area network (LAN) is a set of client computers

(PCs) connected to one or more sever computers either
through cable or wireless connections over relatively
short distances.
A file server system is a LAN-based solution in which a
server hosts only the data layers of an information system.
All other layers are implemented on the client computers.
Disadvantages include:
– Frequently excessive network traffic to transport data
between servers and clients.
– Client must be fairly robust (“fat”) because it does most
of the work
– Database integrity can be easily compromised.
File Server Architecture

Client/Server Architecture—The Clients
A client/server system is a solution in which the

presentation, presentation logic, application logic, data
manipulation, and data layers are distributed between
client PCs and one or more servers.
A thin client is a personal A fat client is a personal

computer that does not computer or workstation that
have to be very powerful (or is typically more powerful
expensive) in terms of (and expensive) in terms of
processor speed and processor speed, memory,
memory because it only and storage capacity. Most
presents the user interface PCs are considered to be fat
to the user. clients.

Client/Server Architecture—The Servers
• A database server hosts one or more shared databases but

also executes all data manipulation commands.
• A transaction server hosts services that ultimately ensure
that all database updates for a single transaction succeed or
fail as a whole.
• An application server hosts the application or business
logic and services for an information system.
• A messaging or groupware server hosts services for e-
mail, calendaring, and other work group functionality.
• A web server hosts Internet or intranet web sites and
services, communicating thorugh thin-client interfaces such
as web browsers.

Client/Server—Distributed Presentation
A distributed presentation client/server system is a

solution in which the presentation and presentation logic
layers only are shifted from the server to reside on the
client.
The application logic, data manipulation, and data layers

remain on the server (frequently a mainframe).

Client/Server—Distributed Presentation

Client/Server—Distributed Data
A distributed data client/server system is a solution in

which the data and data manipulation layers are placed
on the server(s), and the application logic, presentation
logic, and presentation layers are placed on the clients.
This is sometimes called two-tiered client/server

computing.

Client/Server—Distributed Data

Client/Server—Distributed Data and Application
A distributed data and application client/server system is a

solution in which: (1) the data and data manipulation layers are
placed on their own server(s), (2) the application logic is
placed on its own server, and (3) the presentation logic and
presentation layers are placed on the clients.
This is sometimes called three- or n-tiered client/server

computing. It requires design partitioning.
Partitioning is the art of determining how to best distribute or

duplicate application components (DATA, PROCESS, and
INTERFACE) across the network.

Client/Server—Distributed Data and Application

Internet- and Intranet-based Architectures
A network computing system is a multi-tiered solution in

which the presentation and presentation logic layers are
implemented in client-side Web browsers using content
downloaded from a Web server. The presentation logic layer
then connects to the application logic layer that runs on the
application server, which subsequently connects to the
database servers on the backside of the system.
The greatest potential of this approach is its applicability to

redesign of traditional information systems to run on an
intranet. An intranet is a secure network, usually corporate,
that uses Internet technology to integrate desktop, work
group, and enterprise computing into a cohesive framework.

Internet- and Intranet-based Architectures

Internet- and Intranet Technologies
• Java
– Mostly for programming server-side application logic
called “servlets”
– Occasionally for programming client-side application
logic called “applets”
• HTML (HyperText Markup Language)
– Mostly for programming the presentation layer
• XML (Extensible Markup Language)
– Mostly for programming data content to be transported
across the web
• SQL (Structured Query Language)
– Universal standard language for database manipulation
• Web Browsers

Data Architectures
A relational database stores data in tabular form. Each file

is implemented as a table. Each field is a column in the
table. Related records between two tables are implemented
by intentionally duplicated columns in the two tables.
A distributed relational database distributes or duplicates

tables to multiple database servers located in
geographically important locations.
A distributed relational database management system is

a software program that controls access to and maintenance
of stored data in the relational format.

Types of Data(base) Distribution
Data partitioning truly distributes rows and columns of

tables to specific database servers with little or no
duplication between servers.
– Vertical partitioning assigns different columns to
different servers.
– Horizontal partitioning assigns different rows to different
servers.
Data replication duplicates some or all tables (or parts of

tables) on more than one database server. Database
technology controls acces to, and manages consistecy of
duplicated data across the servers.

Data Partitioning versus Data Replication
Logical Data Store Physical Data Stores Physical Data Stores

using Partitioning using Replication
Oracle 7: Not applicable. Branch
1 CUSTOMERS 1P.# REGION 1 offices do not need
CUSTOMERS access to data about
customers outside of
Oracle 7:
their own sales region.
1P.# REGION 2
CUSTOMERS
Not applicable. All Oracle 8i:

2 PRODUCTS branch offices need 2M PRODUCTS
access to data for all (Master)
products, regardless of
Oracle 8i:
sales region.
2R PRODUCTS
(Replicated Copy)

Interface Architectures
• Batch inputs and outputs

• On-line inputs and outputs
• Remote batch
• Keyless data entry (and automatic identification)
• Pen input
• Electronic Data Interchange (EDI)
• Middleware

Batch Inputs and Outputs

Logical Data Flow (input) Physical Data Flow Implementation
(as batch input)
KTD Batch: batch

Comma delimited
TIMECARD TIMECARDS file:TIMECARDS
KTD Batch:
TIMECARDS
End of Month
-1 day
Logical Data Flow (output) Physical Data Flow Implementation

(as batch output on preprinted forms)
Preprinted Form
PAYCHECK Batch:
PAYCHECKS

On-Line Inputs and Outputs
Logical Data Flow (input and output) Physical Data Flow Implementation
(as on line input and output;
2 alternatives shown)
Win 2000 Form:

INSURANCE
INSURANCE
CLAIM
CLAIM
HTML Form:
ORDER CONFIRMATION
ORDER
CONFIRMATION
MAPI Email Message:
ORDER CONFIRMATION

Remote Batch
Access Form:
COURSE Update: Access Table: Read:
ASSIGNMENT SCHEDULED SCHEDULED SCHEDULED
COURSES COURSES COURSES
Access Form:
SCHEDULE
CONFLICT
Email, CDF: Read: Batch CDF: Create:

SCHEDULED SCHEDULED batch SCHEDULED SCHEDULED
COURSES COURSES COURSES COURSES
(schedule
finished)

Keyless Data Entry (and Automatic Identification)

(optimal mark form batch input)
Optimal Mark
EXAMINATION Form Batch:
ANSWERS EXAMINATIONS'
ANSWERS

Pen Input
Pen:
Customer
Signature Cellular:
Package Delivery
Pen:
Package
Delivery

Electronic Data Interchange (EDI)
Electronic Data Interchange (EDI) is the standardized

electronic flow of business transactions or data between
businesses. Typically, many businesses must agree to a
common data format to make EDI feasible.

(automatic ID input)
STUDENT EDI:
APTITUDE STUDENT
SCORE APTITUDE
SCORES

Middleware
Middleware is utility software that enables

communication between different processors in a system.
It may be built into the respective operating systems or
added through purchased middleware products.
– Presentation middleware
– Application middleware
– Database middleware

Process Architectures
A software development environment (SDE) is a

programming language and tool kit for constructing
information systems software applications.
– SDEs exist for centralized computing
– SDEs exist for distributed presentation
– SDEs exist for two-tiered client/server
– SDEs exist for multi-tiered client/server
– SDEs exist for Internet and intranet client/server
Many SDEs support clean layering, the requirement that

the presentation, application, and data layers of an
application be physically separated to allow components
of each layer to be replaced or enhanced without
affecting the other layers.
Application Architecture Design Strategies
• The strategic or enterprise-oriented strategy

– Defines approved network, data, interface, and
processing technologies and development tools
– Defines a strategy for co-existence and/or integration of
legacy systems and technologies
– Provides for an on-going process to review and improve
the above
– Provides for a process to research and try emerging
technologies that fall outside of the above
– Provides an approval process for variances from the
above
• The tactical or application-oriented strategy
– Defines architecture for each new system on an
application-by-application basis as needed.
– Requires feasibility analysis for each application
(covered in Chapter 9)
A Method for Application Architecture Design
• Draw a physical DFD to represent the network architecture.

Each physical process symbol will represent a client or
server processor.
• For each physical process on the above network
architecture model, draw a physical DFD that shows the
event processes (from Chapter 8) that are assigned to (or
duplicated on) that physical processor.
• For appropriate processes on the above system DFDs, draw
draw more detailed physical DFDs that factor the event into
design units.
• Draw physical, primitive DFDs for appropriate processes
from step 3.

Design Units
A design unit is a self-contained collection of processes,

data stores, and data flows that share similar design
characteristics.
A design unit serves as a subset of the total system

whose inputs, outputs, files and databases, and programs
can be designed, constructed, and tested as a self-
contained unit.
Ultimately, design units must be integrated into a whole

system.

The Network Architecture DFD
A network architecture is documented as a physical

DFD that allocates processors (clients and servers) and
possibly devices (machines and robots) across a network
and establishes:
– the connectivity between clients and servers
– where users will interface with the processors

SoundStage Data Distribution DFD

Recording a Person/Machine Boundary

A Manual Design Unit DFD

Application Architecture and Modeling: C H A P T E R

Uploaded by

Copyright:

Available Formats

Application Architecture and Modeling: C H A P T E R

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Application Architecture and Modeling: C H A P T E R

Uploaded by

Copyright:

Available Formats

SYSTEMS ANALYSIS AND DESIGN METHODS 5th Edition Whitten Bentley Dittman

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Chapter 11 Application Architecture & Modeling

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

An application architecture specifies the technologies

It serves as an outline or blueprint for detailed design and

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Physical Data Flow Diagrams (DFDs)

Physical data flow diagrams (DFDs) model the

– Recall from Chapter 8 that DFDs are a type of

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Sample Physical Data Flow Diagram

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

A physical process is either a processor, such as a computer or

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Physical Process Notation

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Samples of Physical Processes

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Possible Computer Process Implementations

• A purchased application software package

• A system or utility program

• An existing application program

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Sample Physical Process Implementations

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Physical Data Flows

A physical data flow represents any of the following:

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Sample Physical Data Flows

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Sample Physical Data Flows (continued)

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Physical External Agents and Data Stores

Physical external agents are carried over from the logical

A physical data store represents the planned implementation

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Physical Data Store Notation

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Physical Data Store Implementations

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Distributed versus Centralized Systems

A distributed system is one in which the DATA,

In centralized systems, a central, multi-user computer

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Why Distributed Systems?

• Modern business systems are already decentralized and

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Distributed Computing Layers

• Presentation layer—the user interface

• Presentation layer logic—such as input editing

• Application logic layer—the business rules, policies,

• Data manipulation layer—to store and retrieve data to

• Data layer—the actual business data

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

Flavors of Distributed Computing

Irwin/McGraw-Hill Copyright © 2000 The McGraw-Hill Companies. All Rights res

File Server Architecture