Undergraduate Course: Performance Modelling (INFD11008)
|School||School of Informatics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 11 (Year 4 Undergraduate)
|Course type||Online Distance Learning
||Availability||Not available to visiting students
|Summary||*This course replaces the course 'Performance Modelling INFR11154 from 2019/20*
Distance Learning version of 'Performance Modelling' (INFR11082).
This course teaches various aspects of computer-aided modelling for performance evaluation of (stochastic) dynamic systems. The main focus is on stochastic modelling of computer systems and communication networks to assess performance characteristics such as throughput, response time etc.; however other dynamic systems such as manufacturing systems may also be considered. The central concept of the course will be that a model is as an abstract representation of a system which can be used as a tool to derive information about dynamic behaviour of the system. The more detail we invest in the model, the more sophisticated the information we can extract from it. As the course progresses the model will become increasingly detailed; the corresponding solution techniques will similarly become more complex, relying on increasing levels of computer assistance.
*Modelling and performance evaluation: models as tools; equilibrium and transient behaviour; analytic vs. algorithmic models. Revision of basic probability concepts.
*Making use of models: deriving performance measures from an equilibrium distribution; choosing the parameters for a model; measurement and workload modelling; experimentation.
*Representing systems directly as analytic models: operational laws such as Little's Law, simple queues and Markov processes; solving equations to find equilibrium behaviour.
* Representing systems as algorithmic models: process-oriented and event-oriented simulation, variance reduction and stopping conditions.
*High-level modelling languages: the stochastic process algebra PEPA, stochastic Petri nets and networks of queues.
Relevant QAA Computing Curriculum Sections: Simulation and Modelling
Entry Requirements (not applicable to Visiting Students)
||Other requirements|| This course is open to all Informatics students including those on joint degrees. For external students where this course is not listed in your DPT, please seek special permission from the course organiser.
- A solid background in mathematical thinking is required.
- Probability theory will be used extensively: Random variables, expectation, Markov chains, exponential distributions, joint and conditional probabilities.
- Basic linear algebra.
- A basic level of understanding of the architecture and operation of computer systems and networks.
Course Delivery Information
|Academic year 2019/20, Not available to visiting students (SS1)
|Course Start Date
|Learning and Teaching activities (Further Info)
Lecture Hours 20,
Summative Assessment Hours 2,
Programme Level Learning and Teaching Hours 2,
Directed Learning and Independent Learning Hours
|Assessment (Further Info)
|Additional Information (Assessment)
||Written Exam 75%«br /»
||Hours & Minutes
|Main Exam Diet S1 (December)||2:00|
On completion of this course, the student will be able to:
- Students will understand the key ideas of performance modelling and the trade-offs between timeliness and efficient use of resources. They will be able to demonstrate this by an ability to give an account of these ideas and explain why the trade-off occurs. Students will know the operational laws and be able to apply them to any system which satisfies the appropriate conditions to derive further information about the system. Furthermore they will be able to assess from a system description whether the conditions are met
- They will have the ability to design, construct and solve a simple performance model based on a Markov process in various high-level modelling formalisms as well as directly at the state transition level. Moreover they will be able to give an account of the underlying mathematics and concepts of steady state and transient analysis. The students should understand, and be able to give an account of, the assumptions which must be made about a system in order to model it as a Markov process
- Students will develop a basic understanding of simulation and the difference between algorithmic and analytic modelling. They will appreciate the components of the simulation engine and the importance that they are implemented efficiently
- Students will develop judgement with respect to choosing an appropriate modelling technique for a given scenario, so that when given a description of a problem, and the resources and skills available, they are able to recommend the best-suited modelling formalism and solution technique. Students will also learn to abstract from extraneous detail and focus on the important aspects of a problem, and understand the importance of matching the model to the question to be answered
- Students will develop the ability to assimilate knowledge about different formalisms and tools and put them to practical use. They will also develop skills in analysing and interpreting presented data
|* M. Ajmone Marsan, et al, 'Modelling with Generalized Stochastic Petri Nets', Wiley, 1995.|
* R. Jain, 'The Art of Computer Systems Performance Analysis', Wiley, 1991.
* W.J. Stewart, 'Numerical Solutions of Markov Chains', Princeton University Press, 1995.
* I. Mitrani, 'Probabilistic Modelling', Cambridge University Press, 1998.
* C. Lindemann, 'Performance Modelling with Deterministic and Stochastic Petri Nets', Wiley 1998.
|Graduate Attributes and Skills
|Course organiser||Prof Jane Hillston
Tel: (0131 6)50 5199
|Course secretary||Miss Clara Fraser
Tel: (0131 6)51 4164