Sökning: "linearly separable distributed computing"
Hittade 1 uppsats innehållade orden linearly separable distributed computing.
1. Minimum Cost Distributed Computing using Sparse Matrix Factorization
Master-uppsats, KTH/Optimeringslära och systemteoriSammanfattning : 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
Resultatsidor:
1