Aggregation Operator for Assignment of Resources in Distributed Systems

David Luis La Red Martínez

doi:10.14569/ijacsa.2017.081053

Abstract

In distributed processing systems it is often necessary to coordinate the allocation of shared resources that should be assigned to processes in the modality of mutual exclusion; in such cases, the order in which the shared resources will be assigned to processes that require them must be decided; in this paper we propose an aggregation operator (which could be used by a shared resources manager module) that will decide the order of allocation of the resources to the processes considering the requirements of the processes (shared resources) and the state of the distributed nodes where the processes operate (their computational load).

Highlights

The proliferation of computer systems, many of them distributed in different nodes with multiple processes that cooperate for the achievement of a particular function, require decision models that allow groups of processes to use shared resources that can only be accessed in the modality of mutual exclusion
The traditional solutions for this problem are found in [1] and [2], which describe the main synchronization algorithms in distributed systems; in [3], it presents an efficient and fault tolerant solution for the problem of distributed mutual exclusion; in [4]-[6], which present algorithms to manage the mutual exclusion in computer networks; in [7], which details the main algorithms for distributed process management, distributed global states and distributed mutual exclusion
In [9] a multicast communication protocol is presented for groups of processes in the atomic mode, [10] study technologies, web services and applications of reliable distributed systems; in [11] reliable communication protocols are presented in broadcast mode; in [12] the main communication algorithms in distributed systems are described, [13] describes a network architecture for large-scale virtual environments to support communication between groups of distributed processes, and in [14] the main algorithms of distributed coordination and management of the mutual exclusion

Summary

INTRODUCTION

The proliferation of computer systems, many of them distributed in different nodes with multiple processes that cooperate for the achievement of a particular function, require decision models that allow groups of processes to use shared resources that can only be accessed in the modality of mutual exclusion. The traditional solutions for the allocation of shared resources distributed in the modality of mutual exclusion are concentrated on guaranteeing mutual exclusion, without considering the computational load on the nodes where the processes operate and the impact that will create on the access to the shared resources requested by the processes in the context of such load This allocation of resources in processes should be performed taking into account the priorities of the processes and the current workload of the computational nodes on which the processes are executed. This article, which will present an innovative method for shared resource management in distributed systems, has been structured as follows: Section 2 will explain the data structures to be used by the proposed operator, in Section 3 the aggregation operator is described, Section 4 will show a detailed example of this, the Conclusions and Future Work Lines will be presented, ending with the Acknowledgments and References

DATA STRUCTURES TO BE USED

Calculation of the Current Computational Load of the Nodes

EXAMPLE AND DISCUSSION OF RESULTS

Findings

Conclusions