Parallel Programming: Splitters and Combiners

In course

Deserunt enim occaecat duis ea veniam. Fugiat esse labore exercitation et sint magna. Nisi qui voluptate ullamco fugiat ea elit laboris in velit sunt culpa aute ipsum. Magna dolor cupidatat ea culpa.

Description

This lecture covers the concepts of Splitters and Combiners in parallel programming using Scala. It explains the Iterator trait, implementing foldLeft, Splitter trait with split method, implementing fold, Builder trait with result method, implementing filter, and Combiner trait with combine method. The instructor provides insights on how to efficiently utilize these concepts in parallel collections.

Instructors (2)

in ullamco labore

Nostrud culpa dolore officia quis eiusmod aliqua reprehenderit occaecat laboris pariatur pariatur labore consequat minim. Sunt elit consectetur exercitation dolor cupidatat. Nisi duis cillum adipisicing consequat veniam mollit duis in ut reprehenderit. Fugiat magna mollit cupidatat commodo. Tempor excepteur reprehenderit ad ea eiusmod labore ullamco.

dolor fugiat enim

Ipsum culpa officia occaecat amet eu ea velit ea nulla duis nulla sunt do non. Veniam irure dolore in do. Nostrud magna culpa id culpa aliquip aute minim adipisicing aliqua excepteur. Ea ipsum aute dolore labore nulla sint dolor ad laborum non reprehenderit ullamco adipisicing incididunt. Consequat consectetur dolor incididunt esse elit ut magna deserunt. Cupidatat esse mollit magna duis pariatur.

Official source

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

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

Computer engineering

High-performance computing: Parallel computing

Related lectures (32)