English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Volunteer Grids present very interesting and attractive infrastructures that reduce, drastically, the response time of several greedy algorithms and applications such as the Arabic OCR (Optical Character Recognition) based on the Dynamic time Warping (DTW) algorithm. Intensive experiments performed on such infrastructures confirm their ability to provide enough computing and storage powers which can be exploited and used to substantially speed up the execution time of the Arabic OCR based on the DTW algorithm. Amongst the advantages of such infrastructures we can mention first their cost which is almost zero, since they are, commonly, obtained by federating, through the Internet, several computers which are geographically dispersed. Second, their flexibility since they can be simultaneously used by different distributed applications. As a consequence, these infrastructures drain, today, more and more researchers to discover what they can do with in order to respond better to the ever increasing user needs in terms of computing and storage powers. Unfortunately, and to the best of our knowledge, there is no previous research work which attempted to solve the problem of the optimal utilization of the computing power provided by such infrastructures. This is due, surely, to the complex structure of such infrastructures where the federated resources are highly volatile as we will explain next. Consequently, we present in this paper a new approach followed by a comparative study of three heuristics which attempt to reach an optimal utilization of any provided computing power by any given volunteer grid. This approach exploits and uses volunteer grids during, rather, some predefined timeslots where tasks are assigned optimally or pseudo optimally over the corresponding available computers. Our proposal supposes, indeed, that we have, already, the forecast state of the volunteer grid to be used in the form of timeslots obtained by a reliable statistical study done, previously, on this grid.

Towards an optimal utilization of volunteer grid computing: a comparative study of three heuristics