I/O-efficient algorithms

Description

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.

Read more.

Career Relevance by Data Role

The techniques and tools covered in I/O-efficient algorithms are most similar to the requirements found in Data Scientist job advertisements.


Similarity Scores (Out of 100)

Subscribe for updates and new courses
Or create a DataKwery.com account
Fast Facts
Techniques
AlgorithmsApplied MathematicsData AnalysisData VisualizationDecision TreesDistributionsFunctionsProbabilityVariables

Similar Opportunities
NP-Complete Problems

edX - University of California, San Diego

Algorithms, Part II

Coursera - Princeton University

Data Structures and Algorithms (I)

Coursera - Tsinghua University

Algorithms and Data Structures Capstone

edX - University of California, San Diego

String Processing and Pattern Matching Algorithms

edX - University of California, San Diego

Graph Algorithms in Genome Sequencing

edX - University of California, San Diego

Data Structures and Algorithms (IV)

Coursera - Tsinghua University