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.

Resource-Oriented Partitioned Scheduling in Multiprocessor Systems: How to Partition and How to Share?

Abstract: When concurrent real-time tasks have to access shared resources, to prevent race conditions, the synchronization and resource access must ensure mutual exclusion, e.g., by using semaphores. That is, no two concurrent accesses to one shared resource are in their critical sections at the same time. For uniprocessor systems, the priority ceiling protocol (PCP) has been widely accepted and supported in real-time operating systems. However, it is still arguable whether there exists a preferable approach for resource sharing in multiprocessor systems. In this paper, we show that the proposed resource-oriented partitioned scheduling using PCP combined with a reasonable allocation algorithm can achieve a non-trivial speedup factor guarantee. Specifically, we prove that our task mapping and resource allocation algorithm has a speedup factor 11-6/(m+1) on a platform comprising m processors, where a task may request at most one shared resource and the number of requests on any resource by any single job is at most one. Our empirical investigations show that the proposed algorithm is highly effective in terms of task sets deemed schedulable.

On demand platform for online games

Abstract: A shared infrastructure, based on emerging on demand computing models, that supports multiple games offers an attractive option for large-scale multiplayer online game providers who want to avoid the risk of investing in dedicated resources In this paper, we describe a prototype implementation of a service platform for online games The platform design follows the on demand computing paradigm It offers integration using open standards and off-the-shelf software and embraces virtualization and simplification to enable sharing resources across games We describe our experience with identifying appropriate performance metrics for provisioning game servers and with implementing reusable platform components that provide useful functionality for a variety of games

Methods, systems and computer program products for preemptive avoidance of constraints for shared resources

Abstract: Methods, systems (apparatus) and computer program products are provided which control access to a shared resource in a data processing system by predicting utilization of the shared resource based upon historical utilization of the shared resource. Users of the shared resource are then notified of a potential shortage of the shared resource if the prediction predicts that the shared resource will be over-utilized. The prediction may utilize a linear extrapolation to predict future utilization of the share resource. Furthermore, the interval between predictions of the future utilization may be based on time, number of utilization events or a combination of the two.

Concurrent access of shared resources

Abstract: An apparatus, program product and method to manage access to a shared resource by a plurality of processes in a multithreaded computer via a collection of atomic operations that track both the order in which requests that use a shared resource are received, and the order in which processing of such requests are completed after they are received. Dispatching of requests is effectively deferred until processing of all non-dispatched requests that were received earlier than a most recently completed request has been completed. In many instances, completion of processing of requests can be performed non-atomically, thus reducing contention issues with respect to the shared resource. Furthermore, dispatching of requests may be batched to reduce the overhead associated with individual dispatch operations.