Non-sequential Computing

Introduction to the course

Grading policy

A series of theoretical and programming assignments (mini-projects - MP's): Each MP must be passed with at least 50% points.

Final grading: 50% - 59% E, 60% - 69% D, 70% - 79% C, 80% - 89% B, 90% -100% A.

Monographs and web resources
  • ATTIYA, H., WELCH, J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, J. Wiley & Sons, 2004.
  • CORMEN, T.H., LEISERSON, C.A., RIVEST, R.L., STEIN, C. Introduction to Algorithms, 3rd Edition, MIT Press, Cambridge, MA, 2009.
  • GRAHAM, R.L., KNUTH, D.E., PATASHNIK, O.: Concrete mathematics. Addison-Wesley, 1992.
  • JA'JA, J., An Introduction to Parallel Algorithms, Addison-Wesley, Reading, Mass., 1992.
  • Microsoft Docs: Threading (C#) (online)