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.Lee mas.
Este recurso es ofrecido por un socio afiliado. Si paga por la capacitación, podemos ganar una comisión para respaldar este sitio.
Las técnicas y herramientas cubiertas en I/O-efficient algorithms son muy similares a los requisitos que se encuentran en los anuncios de trabajo de Científico de datos.
