Shared resource

About: Shared resource is a research topic. Over the lifetime, 7536 publications have been published within this topic receiving 123491 citations. The topic is also known as: network share.

A distributed algorithm for performance improvement through file replication, file migration, and process migration

Abstract: The author presents a distributed algorithm that considers the number of read and write accesses to files for every process type, the number of processes and their demands on system resources, the utilization of bottlenecks on all machines, and file sizes. Performance improvement obtained with the algorithm is discussed and proved. A number of experiments executed in a distributed system in order to predict the impact on performance of various algorithm strategies are examined. The experiments show changes in system performance due to file and process placement, file replication, and file and process migration. >

Relay server and client terminal

Abstract: A relay server is connected to a LAN and communicable with a relay server of another LAN. The relay server includes an account information registering unit arranged to store account information including information of a client terminal connected to the same LAN; a relay group information registering unit arranged to store relay group information including information of a group of relay servers permitting connection with one another; a shared resource information registering unit arranged to store shared resource information including information of a resource and information of the client terminals sharing the resource; a relay processing unit arranged to, when accepting from the client terminal stored in the account information registering unit operation instruction on a resource operable by a client terminal connected to another LAN based on the shared resource information, relay the operation of the resource based on the relay group information; and a resource information providing unit arranged to, when accepting an access based on a predetermined protocol from an external client terminal, convert the shared resource information to a format of the predetermined protocol and providing the information to the external client terminal, the external client terminal other than the client terminal stored in the account information registering unit being registerable in the shared resource information registering unit.

Atomic resource sharing in noncooperative networks

Abstract: In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case of atomic resource sharing, in which traffic bifurcation is not implemented, hence each user allocates its whole traffic to one of the network resources. We analyze topologies of parallel resources within a game-theoretic framework and establish several fundamental properties. We prove the existence of and convergence to a Nash equilibrium. For a broad class of residual capacity performance functions, an upper bound on the number of iterations till convergence is derived. An algorithm is presented for testing the uniqueness of the equilibrium. Sufficient conditions for achieving a feasible equilibrium are obtained. We consider extensions to general network topologies. In particular, we show that, for a class of throughput-oriented cost functions, existence of and convergence to a Nash equilibrium is guaranteed in all topologies. With these structural results at hand, we establish the foundations of a design and management methodology, that enables one to operate such networks efficiently, in spite of the lack of cooperation among users and the restrictions imposed by atomic resource sharing.

Self-Organizing Agents for Grid Load Balancing

Abstract: A computational grid is a wide-area computing environment for cross-domain resource sharing and service integration. Resource management and load balancing are key concerns when implementing grid middleware and improving resource utilization. Grid resource management can be implemented as a multi-agent system with resource advertisement and discovery capabilities if job requests from users are associated with explicit QoS requirements. In this work agent-based self-organization is proposed to perform complementary load balancing for batch jobs with no explicit execution deadlines. In particular, an ant-like self-organizing mechanism is introduced and proved to be powerful to achieve overall grid load balancing through a collection of very simple local interactions. A modeling and simulation environment is developed to enable performance of the ant algorithm to be investigated quantitatively. Simulation results included in this work illustrate the impact of different performance optimization strategies on the overall system load balancing level, speed and efficiency.