Scheduling and automatic parallelization

The outer archives are busy

by Alain Darte, Yves. Robert, Frederic Vivien

About this book

Consider the following algorithm to solve the linear system Ax = b, where A is an n x n nonsingular lower triangular matrix and b is a vector with n components: DO i=1, n Task Ti,i: x(i) = b(i) / a(i,i) DO j = i+1, n Task Ti,j: b(j) = b(j) - a(j,i) * x(i) ENDDO ENDDO

Match Score

Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.

Create free account

Marks of the Realm

Marks left by readers of this tome

No community marks yet — be the first to inscribe this tome.

Pacing

—out of 5

Horror / Dark Elements

—out of 5

Romance

—out of 5

Spice Level

—out of 5

LGBTQ+ Representation

—out of 5

Social & Political Themes in Stories

—out of 5

Inscribe Your Rating

Mark this tome across each content category