Areas of Specialization

1. Scheduling
a. Time-based scheduling
b. Classical results for single processor scheduling algorithms
c. Multiprocessor scheduling
d. Scheduling with energy concerns

The rest of the course coverage will be filled in after a vote of the class. The following are all possibilities.

2. Real-Time Operating Systems – we can look at TinyOS, details of its implementation and some applications.
3. Fault Tolerance Techniques
4. State-Space Control Theory and Real-Time Implementation
5. Specification of Real-Time Systems (examine in detail one framework – UML, Timed Petri Nets, etc.)
6. Individual Student Presentations – allows you to explore and present a topic of your choice.

Techniques for the analysis of large networks that can be modeled in a statistical manner. Single queues, product form networks and mean value analysis. Fluid and diffusion approximations. Simulation techniques, including variance reduction. Hybrid simulation. Current research directions in Stochastic networks.

This course is an introduction to the control of discrete-event systems (DES), asynchronous systems discrete in space and time (e.g. manufacturing systems, communication systems, etc.). The course will provide a solid foundation for research in this area, focusing on architectural issues such as modular, decentralized, and hierarchical control. The course will also discuss timed DES, as well as current topics of interest.

Nowadays, unstructured data such as multimedia data account for around 80% of Internet traffic. Meanwhile, more than 80% of potentially usable business information exists in unstructured formats (e.g., audio/video information, social network relations, users’ purchasing habits, environmental data). Much of the unstructured data remains unused because the algorithms available for analyzing and understanding unstructured data usually do not scale up to handle the amount of data being generated. This course will discuss and explore the computer system design to deal with large scale unstructured data.

Complex data in the real-world can often be represented as a graph of relationships between objects or entities. Such networks are fundamental tools to model technological, biological and social relationships. This course focuses on the computational, algorithmic and modeling challenges related to the analysis of large scale graphs and networks. By studying the underlying graph structure and its features, students will be introduced to machine learning techniques and data mining tools that reveal insights on a variety of graphs and networks. Topics of this course include: graph representation learning, Graph Neural Networks, algorithms for complex networks, reasoning over Knowledge Graphs, influence maximization and social network analysis.

The proportion of older adults (aged 65 and older) worldwide has been increasing steadily over the past 40 years. In Canada, it has been projected that seniors will represent up to 25% of the total population by 2036. Mobility is a crucial indicator of functional status, and a predictor of quality of life and longevity; hence, it is often called the sixth vital sign. Mobility encompasses not only the physical activities of older adults, and the performance of specific maneuvers such as sit-to-stand, walking or climbing stairs, but also participation in society (e.g., the ability to drive, accessibility to public transportation).
This course (MiA II) is the second installment of a two-part 6-unit credit course that spans two terms.
The main goals of MiA II are 1) to put in practices principles and tools learned from MiA I in group design projects, 2) to work in an interdisciplinary team, and 3) to develop a technical solution with real-world impacts.

Introduction to logic gates, computer arithmetic, instruction-set architecture, assembly programming, translation of high-level languages into assembly. Computer system organization: datapath and control, pipelining, memory hierarchies, I/O systems; measures of performance.
Three lectures, one tutorial, (one hour); first term
Prerequisite(s): COMPSCI 1MD3 or ENGINEER 1D04 or IBEHS 1P10
Prerequisite(s) (EFFECTIVE 2021-2022): COMPSCI 1XC3 and 1DM3
Antirequisite(s): COMPENG 3DR4, 4DM4, SFWRENG 2GA3, 3GA3

Data modelling, integrity constraints, principles and design of relational databases, relational algebra, SQL, query processing, transactions, concurrency control, recovery, security and data storage.
Three lectures, one tutorial (one hour); first term
Prerequisite(s): COMPSCI 1FC3 or COMPSCI 2DM3
Antirequisite(s): COMPSCI 4DB3, SFWRENG 3DB3, 3H03, 4M03, 4DB3
Last offered 2021-2022.

Mathematical foundations, the graphics pipeline, geometrical transformations, 3D visualization, clipping, illumination and shading models and the impact of graphics on society.
Three lectures, one tutorial (two hours every other week); one term
Prerequisite(s): MATH 1B03 or 1ZC3, and COMPSCI 2C03
Antirequisite(s): SFWRENG 3GC3
Offered on an irregular basis.

Processes and threads, synchronization and communication; scheduling, memory management; file systems; resource protection; structure of operating systems.
Two lectures, one tutorial, two labs (one hour each); second term
Prerequisite(s): COMPSCI 2SD3 or 3SD3, COMPSCI 2C03, and COMPSCI 2GA3
Antirequisite(s): SFWRENG 3SH3
Effective 2021-2022, this course will be offered in first term.

Advanced topics in database systems technology and design. Topics include: query processing; query optimization; data storage; indexing; crash recovery; physical database design; introductory data mining techniques.
Three lectures, one tutorial; one term
Prerequisite(s): COMPSCI 3DB3
Antirequisite(s): SFWRENG 4AD3
Cross-list(s): SFWRENG 4AD3
Offered on an irregular basis.

Software architecture concepts; architectural styles; design patterns, components, libraries, configurations; modelling languages; software re-engineering.
Three lectures; one term
Prerequisite(s): Credit or registration in COMPSCI 3RA3 or 3SR3
Offered on an irregular basis.

Models of distributed computation, formal reasoning about distributed systems, time and message complexity, distributed agreement under adversarial attacks, distributed coordination and symmetry breaking, peer-to-peer computing, simulation as a tool for building more advanced functionality, actor-model programming.
Three lectures, one tutorial; one term
Prerequisite(s): One of COMPSCI 2C03 or SFWRENG 2C03 or SFWRENG 2MD3, and one of COMPSCI 2SD3 or 3SD3 or SFWRENG 3BB4 or SFWRENG 3SH3
Offered on an irregular basis.

Use of queuing models and simulation to predict computer system performance and find bottlenecks in a system. Types of models, distributions. Markov models. Modelling storage and network behaviour, locks, critical sections, concurrency. Introduction to analytical system reliability.
Three lectures, one tutorial (one hour); first term
Prerequisite(s): One of STATS 2D03, 2MA3, 3N03 or 3Y03
Antirequisite(s): SFWRENG 4E03
Cross-list(s): SFWRENG 4E03

Parallel architectures, design and analysis of parallel algorithms; distributed-memory, shared-memory and GPU computing; communication cost, scalability; MPI, OpenMP and OpenACC; tuning parallel programs for performance.
Three lectures, one tutorial (one hour); one term
Prerequisite(s): COMPSCI 2SD3 or credit or registration in COMPSCI 3SD3. Completion of COMPSCI 3N03 or 4C03 is recommended.
Antirequisite(s): SFWRENG 4F03
Cross-list(s): SFWRENG 4F03
Offered on an irregular basis.

Design of user interfaces. Principles of good interface design. Task-oriented design. User experience design. Inclusive design. Communicating with graphics. Modes and mode awareness problem. Human cognition (memory, perception, motor systems). Help systems. Interface design tools.
Three lectures, one tutorial (one hour); first term
Prerequisite(s): COMPSCI 2C03
Antirequisite(s): SFWRENG 4D03, 4HC3
Cross-list(s): SFWRENG 4HC3

Network protocols underlying the world wide web; client-side programming: markup, styles, scripts, design, mobile/desktop; server-side programming: databases, dynamic languages; web services; cloud technologies; security.
Three lectures; one term
Prerequisite(s): COMPSCI 2ME3 or SFWRENG 2AA4; completion of COMPSCI 2DB3 or 3DB3, 3IS3, or 3N03 or 4C03 is recommended.
Offered on an irregular basis.

Use of queuing models and simulation to predict computer system performance and find bottlenecks in a system. Types of models, distributions. Markov models. Modelling storage and network behaviour, locks, critical sections, concurrency. Introduction to analytical system reliability.

Parallel architectures, design and analysis of parallel algorithms; distributed-memory, shared-memory and GPU computing; communication cost, scalability; MPI, OpenMP and OpenACC; tuning parallel programs for performance.

World wide web as networks: protocols, clients/servers and social issues; programming systems: markups, scripts, styles; platform technologies; WWW services: standard systems, browser-based, security issues, examples.

Interfacing to digital and analog systems, sensors and actuators. Signals and conditioning: data acquisition, active and passive filtering, optical and analog isolation, PWM, de/ multiplexing. Architecture of micro-controllers and DSP. Embedded system design and documentation.

Hard and soft real-time systems. Safety classification. Fail-safe design, hazard analysis. Discrete event systems. Modes. Requirements and design specifications. Tasks and scheduling. Clock synchronization. Data acquisition. Applications in real-time control.

This course introduces several concepts used in systems engineering, predictive control and artificial intelligence. A variety of techniques including prediction and estimation, linear models, basic optimization techniques, Monte Carlo techniques, neural networks, and clustering are introduced. The techniques are applied to predictive and smart systems by the example of model predictive control and intelligent control, classification and decision-making. The course is intended for engineering students with understanding in signals and systems and control.
Three lectures and one tutorial; one term
Prerequisite(s): MECHTRON 3DX4 or SFWRENG 3DX4 or IBEHS 4A03
Offered on an irregular basis.

Memory, binary arithmetic, hierarchical design. Hardware/software co-design and application specific processors. Interfacing to I/O devices.

Instruction-set architecture, computer arithmetic, datapath and control, pipelining, memory hierarchies, I/O systems, multiprocessor systems, graphic processors, measures of performance.

Data modeling, integrity constraints, principles and design of relational databases, relational algebra, SQL, query processing, transactions, concurrency control, recovery, security and data storage.

Mathematical foundations, the graphics pipeline, geometrical transformations, 3D visualization, clipping, illumination and shading models and the impact of graphics on society.

Processes and threads, synchronization and communication; scheduling, memory management; file systems; resource protection; structure of operating systems.

Hard and soft real-time systems. Safety classification. Fail-safe design, hazard analysis. Discrete event systems. Modes. Requirements and design specifications. Tasks and scheduling. Clock synchronization. Data acquisition. Applications in real-time control.

Advanced topics in database systems technology and design. Topics include: query processing; query optimization; data storage; indexing; crash recovery; physical database design; introductory data mining techniques.

Use of queuing models and simulation to predict computer system performance and find bottlenecks in a system. Types of models, distributions. Markov models. Modelling storage and network behaviour, locks, critical sections, concurrency. Introduction to analytical system reliability.

Parallel architectures, design and analysis of parallel algorithms; distributed-memory, shared-memory and GPU computing; communication cost, scalability; MPI, OpenMP and OpenACC; tuning parallel programs for performance.

Design of user interfaces. Principles of good interface design. Human input. Displaying complex data using graphics and virtual reality. Modes and mode awareness problem. Health issues, information overload. Special purpose graphics hardware. Interface design tools; on-line help systems.

Fundamental communications concepts: information, entropy, channel capacity, codes, data compression, adaptive channel equalizers, modulation/demodulation of signals, tracking, Kalman filtering, use of specialized signal processing hardware. Software in communication systems.

Hard and soft real-time systems. Safety classification. Fail-safe design, hazard analysis. Discrete event systems. Modes. Requirements and design specifications. Tasks and scheduling. Clock synchronization. Date acquisition. Applications in real-time networking, quality of service and multimedia.

Human sensory perception, learning and cognition. Game aesthetics. Precise control and feedback mechanisms. Use of music and sounds. Critical analysis of existing interfaces. Alternate input devices.

A study of the principles of good interface design. Information overload problems and accommodating user mental models. Human input and technology insertion methods. Information and data visualization techniques. Modes and the mode awareness problem. Human factors and health issues, ergonomics. Interface design tools and Performance Support Systems.