Umbrella  distributed  computing  project  E-governance.

The paper deals with desktop grid systems based on the BOINC platform. Various ways of increasing the efficiency of computations on grid systems are discussed. The umbrella distributed computing project is considered as a convenient tool for conducting various computational experiments. The advantages of the umbrella project ofdistributed computing and the measures for improving the functioning of the umbrella project are described. The test experiments conducted on the E-governance project are listed.

Download Full-text

Agent-Based Autonomous Scheduling Mechanism Using Availability in Desktop Grid Systems

2006 15th International Conference on Computing ◽

10.1109/cic.2006.20 ◽

2006 ◽

Cited By ~ 1

Author(s):

Hongsoo Kim ◽

Seockin Kim ◽

Eunjoung Byun ◽

Chongsun Hwang ◽

Jangwon Choi

Keyword(s):

Grid Systems ◽

Agent Based ◽

Desktop Grid

Download Full-text

An Integrated Approach for Managing Peer-to-Peer Desktop Grid Systems

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) ◽

10.1109/ccgrid.2007.21 ◽

2007 ◽

Cited By ~ 4

Author(s):

Sven Schulz ◽

Wolfgang Blochinger

Keyword(s):

Integrated Approach ◽

Peer To Peer ◽

Grid Systems ◽

Desktop Grid

Download Full-text

Multi-Agent Modeling in Schedule Problems

Modelling and Data Analysis ◽

10.17759/mda.2019090408 ◽

2019 ◽

Vol 09 (4) ◽

pp. 100-111

Author(s):

T.V. Sivakova ◽

V.A. Sudakov

Keyword(s):

Distributed Computing ◽

Optimization Problems ◽

Computational Experiments ◽

Multi Agent Systems ◽

Computing Environment ◽

Agent Modeling ◽

Agent Systems ◽

Multi Agent

The article explores the use of multi-agent technologies for solving optimization problems. It is shown how multi-agent systems allow working with restrictions in a distributed computing environment. The task of scheduling is formalized. Software was developed and computational experiments were carried out, which showed the effectiveness of the proposed approach.

Download Full-text

Decentralized Scheduling Algorithm for DAG Based Tasks on P2P Grid

Journal of Engineering ◽

10.1155/2014/202843 ◽

2014 ◽

Vol 2014 ◽

pp. 1-14 ◽

Cited By ~ 2

Author(s):

Piyush Chauhan ◽

Nitin

Keyword(s):

Distributed Computing ◽

Scheduling Algorithm ◽

Scheduling Algorithms ◽

Communication Cost ◽

Computation Cost ◽

Grid Systems ◽

Acyclic Graph ◽

Computational Resources ◽

Decentralized Scheduling ◽

Grid Resources

Complex problems consisting of interdependent subtasks are represented by a direct acyclic graph (DAG). Subtasks of this DAG are scheduled by the scheduler on various grid resources. Scheduling algorithms for grid strive to optimize the schedule. Nowadays a lot of grid resources are attached by P2P approach. Grid systems and P2P model both are newfangled distributed computing approaches. Combining P2P model and grid systems we get P2P grid systems. P2P grid systems require fully decentralized scheduling algorithm, which can schedule interreliant subtasks among nonuniform computational resources. Absence of central scheduler caused the need for decentralized scheduling algorithm. In this paper we have proposed scheduling algorithm which not only is fruitful in optimizing schedule but also does so in fully decentralized fashion. Hence, this unconventional approach suits well for P2P grid systems. Moreover, this algorithm takes accurate scheduling decisions depending on both computation cost and communication cost associated with DAG’s subtasks.

Download Full-text

Using Trust to reduce wasteful computation in open Desktop Grid Systems

2012 Tenth Annual International Conference on Privacy, Security and Trust ◽

10.1109/pst.2012.6297954 ◽

2012 ◽

Author(s):

Lukas Klejnowski ◽

Yvonne Bernard ◽

Christian Muller-Schloer ◽

Jorg Hahner

Keyword(s):

Grid Systems ◽

Desktop Grid

Download Full-text

Towards Trust in Desktop Grid Systems

2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing ◽

10.1109/ccgrid.2010.73 ◽

2010 ◽

Cited By ~ 24

Author(s):

Yvonne Bernard ◽

Lukas Klejnowski ◽

Jörg Hähner ◽

Christian Müller-Schloer

Keyword(s):

Grid Systems ◽

Desktop Grid

Download Full-text

Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

Open Engineering ◽

10.1515/eng-2018-0004 ◽

2018 ◽

Vol 8 (1) ◽

pp. 17-31 ◽

Cited By ~ 3

Author(s):

Srinivas R. Chakravarthy ◽

Alexander Rumyantsev

Keyword(s):

Cloud Computing ◽

Computing System ◽

Desktop Grids ◽

Grid Systems ◽

Desktop Grid ◽

Phase Type Distributions ◽

Enterprise Community ◽

Computer Resources ◽

Multi Server ◽

Crucial Parameter

Abstract Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop grids is the level of redundancy (replication) for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.

Download Full-text