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 algorithms
EIT 디지털이 강좌에 대하여
직원에게 수요가 높은 기술을 교육하면 회사가 이점을 얻을 수 있습니까?
비즈니스를 위한 Coursera 경험해 보기직원에게 수요가 높은 기술을 교육하면 회사가 이점을 얻을 수 있습니까?
비즈니스를 위한 Coursera 경험해 보기제공자:
강의 계획표 - 이 강좌에서 배울 내용
Introduction
Designing cache-aware and cache-oblivious algorithms
Replacement Policies
I/O-efficient sorting
검토
- 5 stars68.42%
- 4 stars24.56%
- 3 stars5.26%
- 2 stars1.75%
I/O-EFFICIENT ALGORITHMS의 최상위 리뷰
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
The course is really good and the course material is also amazing. I highly reccomend it provided you have an interest in this specialization.
Really like the course. Though it's difficult and challenging, I managed to understand the concept. I will keep practicing.
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.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
이 수료증을 구매하면 무엇을 이용할 수 있나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.