Jackson System Development

Jackson System Development

Jackson System Development (JSD) is a linear software development methodology developed by Michael A. Jackson and John Cameron in the 1980s.

Contents

History

JSD was first presented by Jackson in 1982, in a paper called "A System Development Method".[1] and in 1983 in System Development[2].

JSD continued to evolve, and a few new features were introduced into the method. These are described in a 1989 collection of papers by John Cameron, JSP and JSD[3], and in the 1992 version (version 2) of the LBMS JSD manual[4].

Development of the JSD method came to an end in the early 1990's as Jackson's thinking evolved into the Problem Frames Approach with the publication of Software Requirements and Specifications (1995) and Problem Frames: Analyzing and Structuring Software Development Problems (2000).

Principles of operation

Three basic principles of operation of JSD is that:

  • Development must start with describing and modelling the real world, rather than specifying or structuring the function performed by the system. A system made using JSD method performs the simulation of the real world before any direct attention is paid to function or purpose of the system.
  • An adequate model of a time-ordered world must itself be time-ordered. Main aim is to map progress in the real world on progress in the system that models it.
  • The way of implementing the system is based on transformation of specification into efficient set of processes. These processes should be designed in such a manner that it would be possible to run them on available software and hardware.

JSD steps

When it was originally presented by Jackson in 1982[5] , the method consisted of six steps

  1. Entity/Action Step
  2. Initial Model Step
  3. Interactive Function Step
  4. Information Function Step
  5. System Timing Step
  6. System Implementation Step

Later, some steps were combined to create a method with only three steps.[6]

  1. Modelling Stage (Analysis): with the Entity/Action Step and Entity Structures Step.
  2. Network Stage (Design) : with the Initial Model Step, Function Step, and System Timing Step.
  3. Implementation Stage (Realisation) : The implementation Step.

Modeling Stage

In the modelling stage the designer creates a collection of entity structure diagrams and identifies the entities in the system, the actions they perform, the time-ordering of the actions in the life of the entities, and the attributes of the actions and entities. Entity structure diagrams use the diagramming notation of Jackson Structured Programming structure diagrams. Purpose of these diagrams is to create a full description of the aspects of the system and the organisation. Developers have to decide which things are important and which are not. Good communication between developers and users of the new system is very important.

This stage is the combination of the former Entity/Action Step and the Entity Structures Step.

Network Stage

In the network stage a model of the system as a whole is developed and represented as a system specification diagram (SSD) (also known as a network diagram). Network diagrams show processes (rectangles) and how they communicate with each other, either via state vector connections (diamonds) or via datastream connections (circles). In this stage is the functionality of the system defined. Each entity becomes a process or program in the network diagram. External programs are later added to the network diagrams. The purpose of these programs is to process input, calculate output and to keep the entity processes up-to-date. The whole system is described with these network diagrams and are completed with descriptions about the data and connections between the processes and programs.

The Initial Model Step specifies a simulation of the real world. The Function Step adds to this simulation the further executable operations and processes needed to produce output of the system. System Timing Step provides synchronisation among processes, introduces constraints. This stage is the combination of the former ‘Initial model’ step, the ‘Function’ step and the ‘System Timing’ step.

Implementation Stage

In the implementation stage the abstract network model of the solution is converted into a physical system, represented as a system implementation diagram (SID). The SID shows the system as a scheduler process that calls modules that implement the processes. Datastreams are represented as calls to inverted processes. Database symbols represent collections of entity state-vectors, and there are special symbols for file buffers (which must be implemented when processes are scheduled to run at different time intervals).

The central concern of Implementation Step is optimization of system. It is necessary to reduce the number of processes because it is impossible to provide each process that is contained in specification with its own virtual processor. By means of transformation, processes are combined in order to limits their number to the number of processors.

Designing the diagrams

Entity structure diagram (ESD)

The diagram shows how the action entities cooperate with the system. Entity structure diagram (ESD) notations:

  • Entity: An entity is an object that is used on the system and by the system.
  • Action: The actions that are carried out by entities and the actions that affect other entities.
  • Construct-Sequence: The JSD construct is identical to the SSADM Entity Life History construct. Use a SequenceConstruct to illustrate actions that are applied from left to right.
  • Construct-Selection: To reflect a choice between two or more actions. Mark the options in the topright corner with a "o" (option).
  • Construct-Recurrence: When an action repeats, place a small asterisk (*) in the topright corner.

Normally there would be only one action underneath a RecurringConstruct.

  • Null component: A Null component can make sure nothing happens in an IF-ELSE statement.
Network Diagram (ND)

Network diagrams show the interaction between the processes. Sometimes they are referred to as System Specification Diagrams (SSD's). Network Diagram (ND) notations:

  • Process: Processes represent system functions. A process model represents the primary system functions. It generally has a relation with an outside entity through the datastream.
  • Datastream Connection: In a datastream connection, process A (the entity that writes the datastream) actively sends information to another process B.
  • State vector inspection: In a state vector connection, process B (the entity that reads the state vector information) reads the state vector information of another entity A.

The difference between a state vector connection and a data stream connection lies in which process is active. In a datastream connection, the process with the information, A, is the active process; it actively sends a message to the datastream reader B at a time that it (A, the sender) chooses. In a state vector inspection, the process with the information,A, is passive; it does nothing but let the reader process B inspect its (A's) state vector. B, the process doing the inspection, is the active process; it decides when it will read information from A. Roughly speaking, datastream connection is an abstraction of message passing, while state vector inspection is an abstraction for polling (and for database retrieval).

See also

References

  1. ^ "A System development method" by M. A. Jackson, published in Tools and notions for program construction: An advanced course, Cambridge University Press, 1982
  2. ^ System Development, M. A. Jackson, Prentice Hall, 1983
  3. ^ JSP and JSD: The Jackson Approach to Software Development, ed. John R. Cameron (IEEE Computer Society Press, ISBN 0-8186-8858-0, 1989)
  4. ^ LBMS Jackson system development, Version 2.0 Method manual by LBMS (Learmonth, Burchett Management Systems), John Wiley & Sons, ISBN 0-471-93565-4; 1992
  5. ^ "A System development method" by M. A. Jackson, published in Tools and notions for program construction: An advanced course, Cambridge University Press, 1982
  6. ^ Decision systems Inc. (2002), Jackson System Development. Accessed 24 Nov 2008.

Further reading

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Jackson System Development (JSD) — 1. Begriff: Methode für den ⇡ Softwareentwurf im Großen, die von M. Jackson und J. Cameron entwickelt wurde. 2. Vorgehensweise: Der Softwareentwurf läuft in den drei Phasen Modellbildung, Funktionsentwurf und Implementierung ab. Die… …   Lexikon der Economics

  • Jackson Structured Programming — Example of a JSP diagram. Jackson Structured Programming or JSP is a method for structured programming based on correspondences between data stream structure and program structure. JSP structures programs and data in terms of sequences,… …   Wikipedia

  • Michael A. Jackson — For other people named Michael Jackson, see Michael Jackson (disambiguation). Michael Anthony Jackson (born 1936) is a British computer scientist, and independent computing consultant in London, England. He is also part time researcher at AT T… …   Wikipedia

  • Michael Anthony Jackson — (* 1936) ist ein britischer Informatiker und arbeitet als unabhängiger Berater in London, England und bei AT T Research, Florham Park, NJ, USA. Er ist Gastprofessor an der Open University in Großbritannien. Jackson studierte an der Oxford… …   Deutsch Wikipedia

  • Michael A. Jackson — Michael Anthony Jackson (* 1936) ist ein britischer Informatiker und arbeitet als unabhängiger Berater in London, England und bei AT T Research, Florham Park, NJ, USA. Er ist Gastprofessor an der Open University in Großbritannien. Jackson… …   Deutsch Wikipedia

  • Jackson County, Ohio — Location in the state of Ohio …   Wikipedia

  • Jackson Homestead — U.S. National Register of Historic Places …   Wikipedia

  • Daniel Jackson (computer scientist) — Daniel Jackson (born 1963) is a Professor of Computer Science at the Massachusetts Institute of Technology (MIT). He is the principal designer of the Alloy modelling language, and author of the book Software Abstractions: Logic, Language, and… …   Wikipedia

  • Jackson's theorem (queueing theory) — Jackson s theorem is the first significant development in the theory of networks of queues. It assumes an open queueing network of single server queues with the following characteristics:* M = # of queues in the system, not counting queue 0 which …   Wikipedia

  • Jackson Stitt Wilson — (March 19, 1868 August 28, 1942) was a socialist mayor of the city of Berkeley, California from 1911 to 1913.Wilson was born in Canada on March 19, 1868. He emigrated to the U.S. in 1888, settling in Evanston, Illinois and working as a Methodist… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”