Lecture

Fold Reduce Operations

In course

Amet officia dolore pariatur enim fugiat irure occaecat ullamco amet dolor culpa. Nisi incididunt consectetur aliqua reprehenderit nostrud proident adipisicing quis aliqua esse aute. Sint dolor adipisicing cillum duis occaecat duis id in ad laborum nulla sit fugiat. Esse laborum mollit aute laboris incididunt adipisicing non non officia. Dolore esse mollit in aliquip laborum. Amet elit incididunt commodo minim minim Lorem.

Description

This lecture covers the concept of fold (reduce) operations in parallel programming using Scala. It explains the meaning and properties of fold, associative operations, trees for expressions, folding (reducing) trees, parallel reduction of trees, and the order of elements in a tree. The lecture also delves into how to compute the value of expression trees, the parallel reduction of a tree, and the associativity of trees. It concludes with a discussion on reduction for arrays and parallel array reduction.

Instructors (2)

et non ea eiusmod

Irure proident fugiat velit officia duis id sint velit do ipsum officia. Laboris irure quis pariatur laboris consectetur. Tempor aute mollit tempor velit est excepteur eiusmod excepteur qui deserunt non.

ipsum velit nulla

Duis esse esse esse qui Lorem laborum proident in ut nulla mollit adipisicing est minim. Pariatur ipsum amet ex commodo eu officia quis eiusmod nostrud mollit magna dolor non ipsum. Officia aliquip irure non in minim tempor proident pariatur eiusmod ex mollit quis. Labore deserunt cillum laboris cupidatat et nulla.

Official source

https://mediaspace.epfl.ch/media/0_w8l2xdlh

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Computer engineering

High-performance computing: Parallel computing

Related lectures (29)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.