Operations on data become more expensive when the data item is located higher in the memory hierarchy. An operation on data in CPU registers is roughly a million times faster than an operation on a data item that is located in external memory that needs to be fetched first. These data fetches are also called I/O operations and need to be taken into account during the design of an algorithm. The goal of this course is to become familiar with important algorithmic concepts and techniques needed to effectively deal with such problems. We will work with a simplified memory hierarchy, but the notions extend naturally to more realistic models.
I/O-efficient algorithmsEIT Digital
About this Course
Syllabus - What you will learn from this course
Designing cache-aware and cache-oblivious algorithms
- 5 stars68.42%
- 4 stars24.56%
- 3 stars5.26%
- 2 stars1.75%
TOP REVIEWS FROM I/O-EFFICIENT ALGORITHMS
Everything was clearly explained and the questions were quite intuitive and checking my knowledge. More examples for different scenarios too would help us a lot to learn more.
Really like the course. Though it's difficult and challenging, I managed to understand the concept. I will keep practicing.
The course is really good and the course material is also amazing. I highly reccomend it provided you have an interest in this specialization.
The excercises and assignments helped in undertanding the concepts much better. Also as this course content can't be found easily at one place this really helped. Thank you
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I purchase the Certificate?
Is financial aid available?
More questions? Visit the Learner Help Center.