Lecture

Conc-Trees: Parallel Programming in Scala

In course

Cillum Lorem Lorem veniam laborum adipisicing ea pariatur velit adipisicing eiusmod minim. Incididunt elit ullamco sit occaecat esse cupidatat. Incididunt id consequat ex occaecat commodo elit. Elit excepteur qui enim duis nisi ullamco laborum. Non tempor aliquip Lorem proident reprehenderit anim reprehenderit veniam proident anim cillum consequat. Elit ipsum sunt adipisicing et cupidatat laborum.

Description

This lecture covers the implementation of Conc-Trees in Scala for parallel programming. It starts with the list data type, moves on to trees for parallel computations, introduces the Conc data type, and explains concatenation with Conc-Trees.

Instructors (2)

Sit eiusmod elit ex dolor ut Lorem nostrud quis ullamco qui. Adipisicing irure ex duis anim amet exercitation do dolore incididunt et laborum in. Elit tempor culpa voluptate magna incididunt nisi consectetur eiusmod laboris. Ea eu culpa pariatur do.

Magna Lorem elit labore duis nisi eiusmod dolore sint voluptate exercitation in non consectetur eiusmod. Do sint dolor minim do. Voluptate mollit et aliquip aliquip adipisicing aliquip aute nostrud fugiat mollit culpa pariatur dolore magna.

Official source

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

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

Programming language theory: High-level programming languages

Algorithms and data structures: Data structures

Computer engineering

High-performance computing: Parallel computing

Related lectures (36)