How to Build an Open Source Render Farm Based on Desktop Grid Computing

Author(s):  
Zeeshan Patoli ◽  
Michael Gkion ◽  
Abdullah Al-Barakati ◽  
Wei Zhang ◽  
Paul Newbury ◽  
...  
2007 ◽  
Vol 23 (7) ◽  
pp. 904-912 ◽  
Author(s):  
Patricio Domingues ◽  
Bruno Sousa ◽  
Luis Moura Silva

2018 ◽  
Vol 9 (4) ◽  
pp. 53-68
Author(s):  
Ilya Aleksandrovich Chernov ◽  
Natalia Nikolaevna Nikitina

We consider parameter identification of a hydride decomposition model by scanning the parameter space in parallel. Such problem is resource demanding, but suits best for Desktop Grid computing. Considering task retrieval as a game, we show that the search process can be improved to produce solutions faster in comparison with random search, with no or minor additional cost.


Author(s):  
Frans Arickx ◽  
Jan Broeckhove ◽  
Peter Hellinckx ◽  
David Dewolfs ◽  
Kurt Vanmechelen

Quantum structure or scattering calculations often belong to a class of computational problems involving the aggregation of a set of matrices representing a linear problem to be solved. The authors discuss a number of approaches based on cluster and grid computing, and discuss the implementations and the respective merits and shortcomings. The authors consider MPI-based cluster computing in a self-scheduling paradigm, CoBRA (a cpu-harvesting desktop grid) in a farmer-worker paradigm, and a batch-computing paradigm on BEGrid (the Belgian research grid facility). It is observed that for all paradigms an efficient implementation is possible, yielding results within a comparable time frame.


2007 ◽  
Vol 23 (4) ◽  
pp. 616-622 ◽  
Author(s):  
EunJoung Byun ◽  
SungJin Choi ◽  
MaengSoon Baik ◽  
JoonMin Gil ◽  
ChanYeol Park ◽  
...  

2017 ◽  
Vol 7 (1) ◽  
pp. 343-351 ◽  
Author(s):  
Ilya Chernov ◽  
Natalia Nikitina ◽  
Evgeny Ivashko

AbstractWe survey the areas of Desktop Grid task scheduling that seem to be insufficiently studied so far and are promising for efficiency, reliability, and quality of Desktop Grid computing. These topics include optimal task grouping, “needle in a haystack” paradigm, game-theoretical scheduling, domain-imposed approaches, special optimization of the final stage of the batch computation, and Enterprise Desktop Grids.


Sign in / Sign up

Export Citation Format

Share Document