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.

Efficient Resource Allocation and Power Control for LTE-A D2D Communication With Pure D2D Model

Abstract: To support the rising number of user equipments (UEs), LTE-A allows some UEs directly talking with each other to facilitate spectrum reuse, which is known as device-to-device (D2D) communication . Since D2D UEs (DUEs) consume resources and bring out interference, how to allocate resources and power is important. Existing studies seek to make more DUEs reuse resources of cellular UEs (CUEs, which are the UEs talking with the eNB) to increase throughput. However, it is inefficient for some CUEs (e.g., those near cell edge) to share resources with others due to high interference. Thus, a new sharing paradigm, called the pure D2D model , is proposed to allow DUEs sharing resources without involving CUEs for flexibility. This new model is helpful to IoT (Internet of Things) applications, where the overwhelming majority of devices are usually DUEs. The paper defines an optimization problem to maximize links supported in the network, and proposes a D2D resource allocation and power control (DRAPC) framework. By vertex coloring, DRAPC gives a preliminary grouping of UEs for resource allocation. Then, each group is carefully reformed by exchanging members and adding new ones, so as to increase signal quality and degree of resource sharing. Simulation results show that DRAPC not only improves network performance but also guarantees fairness among links.

Method and system for locking resources in a computer system

Abstract: Methods and systems are provided for providing locking in a system. The resource objects of the system can be persistent, and thus provide finer granularity locking by allowing shared resource objects to be dynamically allocated and de-allocated. The persistent nature of the resource objects allows for the dynamic allocation and de-allocation of the resource objects, while guarding against the abnormal release of resource locks that result in the possibility of inconsistent data. If abnormal release occurs, the affected resource object(s) are marked to indicate that they are in a "dubious" state. The dubious resource objects are not dynamically de-allocated, but are instead allowed to persist until corrective or validation actions are taken. If the locks are validly released, then the resource objects can be safely de-allocated. In this manner, fine granularity locks can be created to cover minute portions of the shared system resources for some duration, without excessively incurring system overhead and memory.

A prediction-based real-time scheduling advisor

Abstract: The real-time scheduling advisor (RTSA) is an entirely user-level system that an application running on a typical shared, unreserved distributed computing environment can turn to for advice on how to schedule its compute-bound soft real-time tasks. Given a list of hosts, a description of the CPU demands of the task, the deadline, and a confidence level, the RTSA will recommend one of the hosts and predict, as a confidence interval, the running time of the task on that host. The RTSA is based on a scalable and extensible shared resource prediction system based on statistical time series analysis. The author first describes how the RTSA builds on this underlying system to provide its service, and then he evaluates its performance using a randomized methodology based on real background workloads, determining the effect of different factors. He also compares it with a random approach and a measurement-based approach.

A Universal File Server

Abstract: A file server is a utility provided in a computer connected via a local communications network to a number of other computer. File servers exist to preserve material for the benefit of client machines or systems. It is desirable for a file server to be able to support multiple file directory and access management systems, so that the designer of a client system retains the freedom to design the system that best suits him. For example, he may wish to use the rile server to support a predefimed directory structure or as a swapping disk. The paper explores the dedgn issues associated with such a file server and proposes some solutions.