Sökning: "linearly separable distributed computing"

Hittade 1 uppsats innehållade orden linearly separable distributed computing.

  1. 1. Minimum Cost Distributed Computing using Sparse Matrix Factorization

    Master-uppsats, KTH/Optimeringslära och systemteori

    Författare :Seif Hussein; [2023]
    Nyckelord :Applied mathematics; optimization; convex optimization; matrix factorization; sparse matrix factorization; distributed computing; linearly separable distributed computing; ADMM; alternating direction method of multipliers; tillämpad matematik; optimering; konvex optimering; matrisfaktorisering; gles matrisfaktorisering; distribuerade beräkningar; admm; alternating direction method of multipliers;

    Sammanfattning : Distributed computing is an approach where computationally heavy problems are broken down into more manageable sub-tasks, which can then be distributed across a number of different computers or servers, allowing for increased efficiency through parallelization. This thesis explores an established distributed computing setting, in which the computationally heavy task involves a number of users requesting a linearly separable function to be computed across several servers. LÄS MER