IV026 Simulation II

Faculty of Informatics
Spring 2003
Extent and Intensity
2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
doc. RNDr. Václav Sedláček, CSc. (lecturer)
Guaranteed by
prof. PhDr. Karel Pala, CSc.
Department of Machine Learning and Data Processing – Faculty of Informatics
Contact Person: doc. RNDr. Václav Sedláček, CSc.
Timetable
Tue 16:00–17:50 B204
Prerequisites (in Czech)
! I026 Simulation II
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
The aim is to get students familiar with further theoretical tools suitable for discrete simulations: Markov chains and Markov processes. Applying them students are able to solve problems from the field of gueuing theory on basic and middle level.
Syllabus
  • The simulation kernel, properties, universality and its implementation methods
  • Markov chains and Markov processes, random processes identification, homogenity, random processes classification, birth/death processes, Chapman-Kolmogorov equations
  • Queuing systems, Kendall classification and the methods of queuing systems analysis
  • Basic queuing theory, systems M/M/1, M/M/n and their modifications, finite queues, resignation and bulking, loss queuing systems, and the relations between them, Erlang formulae
  • Medium and advanced queuing systems
Literature
  • Fishman, George, S. Monte Carlo - Concepts, Algorithms, and Applications, Springer, 1996.
  • Kleinrock Leonard. Queuing Systems ,Volume I, John Wiley, 1976.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2004.
  • Enrolment Statistics (Spring 2003, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2003/IV026