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.

Allocation sequences of two processes sharing a resource

Abstract: We study a Petri net model of a system composed of two processes sharing a resource. Conflicts may occur over the usage of the shared resource, thus making the system nondeterministic. Therefore, in the context of minimax algebra, it cannot be formulated as a linear system in order to compute its performance measures. However, if the sequence by which the resource is allocated to the two processes is known, we can transform the system into a decision-free net. For this system with an imposed constraint on the resource allocation frequencies, we show that the optimal allocation sequence is the most regular integer sequence satisfying that constraint. We also discuss the periodic behavior of this system under no constraints on the resource allocation frequencies. >

Decentralized power management distributed among multiple processor cores

Abstract: A multi-core processor provides a configurable resource shared by two or more cores, wherein configurations of the resource affect the power, speed, or efficiency with which the cores sharing the resource are able to operate. Internal core power state management logic configures each core to participate in a de-centralized inter-core power state discovery process to discover a composite target power state for the shared resource that is a most restrictive or power-conserving state that will not interfere with any of the corresponding target power states of each core sharing the resource. The internal core power state management logic determines whether the core is a master core authorized to configure the resource, and if so, configures that resource in the discovered composite power state. The de-centralized power state discovery process is carried out between the cores on sideband, non-system bus wires, without the assistance of centralized non-core logic.

Self-Organizing Relays: Dimensioning, Self-Optimization, and Learning

Abstract: Relay stations are an important component of heterogeneous networks introduced in the LTE-Advanced technology as a means to provide very high capacity and QoS all over the cell area. This paper develops a self-organizing network (SON) feature to optimally allocate resources between backhaul and station to mobile links. Static and dynamic resource sharing mechanisms are investigated. For stationary ergodic traffic we provide a queuing model to calculate the optimal resource sharing strategy and the maximal capacity of the network analytically. When traffic is not stationary, we propose a load balancing algorithm to adapt both the resource sharing and the zones covered by the relays based on measurements. Convergence to an optimal configuration is proven using stochastic approximation techniques. Self-optimizing dynamic resource allocation is tackled using a Markov Decision Process model. Stability in the infinite buffer case and blocking rate and file transfer time in the finite buffer case are considered. For a scalable solution with a large number of relays, a well-chosen parameterized family of policies is considered, to be used as expert knowledge. Finally, a model-free approach is shown in which the network can derive the optimal parameterized policy, and the convergence to a local optimum is proven.

The effect of client caching on file server workloads

Abstract: A distributed file system provides a file service from one or more shared file servers to a community of client workstations over a network. While the client-server paradigm has many advantages, it also presents new challenges to system designers concerning performance and reliability. As both client workstations and file servers become increasingly well-resourced, a number of system design decision need to be re-examined. This research concerns the caching of disk-blocks in a distributed client-server environment. Some recent research has suggested that various strategies for cache management may not be equally suited to the circumstances at both the client and the server. Since any caching strategy is based on assumptions concerning the characteristics of the demand, the performance of the strategy is only as good as the accuracy of this assumption. The performance of a caching strategy at a file server is strongly influenced by the presence of client caches since these caches alter the characteristics of the stream of requests that reaches the server. This paper presents the results of an investigation of the effect of client caching on the nature of the server workload as a step towards understanding the performance of caching strategies at the server. The results demonstrate that client caches alter workload characteristics in a way that leaves a profound impact on server cache performance, and suggest worthwhile directions for the future development of server caching strategies.