Till KTH:s startsida Till KTH:s startsida

Visa version

Version skapad av Sebastian Porling 2019-11-05 10:27

Visa < föregående | nästa >
Jämför < föregående | nästa >

Assignments

Here are a set of experiments that you should complete during the course. They will help you to understand the concepts that we discuss during the lectures. You do not need to hand in a report but you're encouraged to write a small four page summary of your findings. The exam will have questions related to these assignments; questions that will be quite easy to understand if you have done the experiments but rather hard to solve if you have not done them.

All experiments are done programming in C, using gcc,  on a 64 bit  Linux system. You can more or less easily  adapt them to OSX, Windows or some other operating system or compiler but it is encouraged to instead install a virtual machine and boot it up with a Linux system. You should after the course be able to use a regular shell and some of the most basic operations. The best way to learn this is to actually use them so open up a shell and start practicing.

There will be one TA led session for each of the exercises. Before going to these sessions it is strongly advised to have read through the assignment and started programming. The time during these sessions is more valuable if you know what you're doing and where you're stuck.

Geting started

To be able to complete the assignments you need to be up and running working with the shell. The first thing you should do is to create an environment where you can edit, compile and run small C programs in a Linux environment (if you choose to run under MacOS you will have some issues).

Processes

Experiment related to processes, what they look like and how they are created. These are best done in conjunction with lectures 3 and 4. The assignments, or tutorials, will give you a much better understanding of the process and how it is related to the kernel.

Virtual memory

Memory visualization is covered in lectures 5 through 8. These experiments with the algorithms used for memory management and see how important it is with some hardware support.

Concurrency

Concurrency is covered in lecture 9 and 10.

File systems

Files systems and persistent storage is covered in lectures 11 through 13. You will here explore both the performance of secondary storage and how the file system is constructed.

Presentations 2019

  • Why and how to implement locking
  • Process communication
  • Secondary storage
  • File operations

Presentations given by TA:s in previous years