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.

Shared resource locking apparatus

Abstract: Disclosed is a hardware lock unit for limiting concurrent use of shared resources, such as segments of a memory, by a plurality of devices, such as processors, in a program controlled system. In such a system, devices wishing to use a shared resource make a use request to the lock unit by means of a memory READ command accompanied by an address that is associated in the lock unit with that resource, which each requesting device sends to the lock unit. The requesting devices then wait for an answer, as from a slow memory. The hardware lock unit determines whether the resource is free for access by a device, or whether the resource is busy being accessed by a device. When the resource is busy, the requesting devices are caused to wait. When the resource becomes free, the lock unit hardware selects one of the requesting devices and responds to its request to grant it exclusive use of the resource. When it is finished using the resource, the device notifies the lock unit to free the resource, by means of a memory WRITE command accompanied by the address that is associated in the lock unit with that resource, which the device sends to the lock unit. Additionally, the lock unit may include hardware for preventing a lockable resource from being accessed by a device that is not its current owner, and hardware for preventing the current owner from accessing the resource more than a predetermined number of times.

Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems

Abstract: This paper focuses on resource sharing in hierarchical fixed priority pre-emptive systems where a number of separate applications, each with its own server, reside on a single processor. It defines the Hierarchical Stack Resource Policy, an appropriate global resource access policy that bounds priority inversion and also limits interference due to overruns during resource access. The paper provides detailed response time analysis enabling the schedulability of application servers and tasks to be determined for systems with local and global resource access. This analysis is applicable to real-world systems where server-based applications need mutually exclusive access to shared resources such as communications buffers, peripheral devices, operating system calls and data structures shared with interrupt handlers.

Exploiting Massive D2D Collaboration for Energy-Efficient Mobile Edge Computing

Abstract: In this article we propose a novel D2D Crowd framework for 5G mobile edge computing, where a massive crowd of devices at the network edge leverage network-assisted D2D collaboration for computation and communication resource sharing. A key objective of this framework is to achieve energy-efficient collaborative task executions at the network edge for mobile users. Specifically, we first introduce the D2D Crowd system model in detail, and then formulate the energy-efficient D2D Crowd task assignment problem by taking into account the necessary constraints. We next propose a graph-matching-based optimal task assignment policy, and further evaluate its performance through extensive numerical study, which shows superior performance of more than 50 percent energy consumption reduction over the case of local task executions. Finally, we also discuss the directions of extending the D2D Crowd framework by taking into account a variety of application factors.

QoS-aware resource management for distributed multimedia applications

Abstract: The ability of operating system and network infrastructure to provide end-to-end quality of service (QoS) guarantees in multimedia is a major acceptance factor for various distributed multimedia applications due to the temporal audio-visual and sensory information in these applications. Our constraints on the end-to-end guarantees are (1) QoS should be achieved on a general-purpose platform with a real-time extension support, and (2) QoS should be application-controllable. In order to achieve the users acceptance requirements and to satisfy our constraints on the multimedia systems, we need a QoS-compliant resource management which supports QoS negotiation, admission and reservation mechanisms in an integrated and accessible way. In this paper we present a new resource model and a time-variant QoS management, which are the major components of the QoS-compliant resource management. The resource model incorporates, the resource scheduler, and a new component, the resource broker, which provides negotiation, admission and reservation capabilities for sharing resources such as CPU, network or memory corresponding to requested QoS. The resource brokers are intermediary resource managerss when combined with the resource schedulers, they provide a more predictable and finer granularity control of resources to the applications during the end-to-end multimedia communication than what is available in current general-purpose networked systems. Furthermore, this paper presents the QoS-aware resource management model called QualMan, as a loadable middleware, its design, implementation, results, tradeoffs, and experiences. There are trade-offs when comparing our QualMan QoS-aware resource management in middleware and other QoS-supporting resource management solutions in kernel space. The advantage of QualMan is that it is flexible and scalable on a general-purpose workstation or PC. The disadvantage is the lack of very fine QoS granularity, which is only possible if supports are built inside the kernel. Our overall experience with QualMan design and experiments show that (1) the resource model in QualMan design is very scalable to different types of shared resources and platforms, and it allows a uniform view to embed the QoS inside distributed resource managements (2) the design and implementation of QualMan is easily portables (3) the good results for QoS guarantees such as jitter, synchronization skew, and end-to-end delay, can be achieved for various distributed multimedia applications.

A Score-Based Opportunistic Scheduler for Fading Radio Channels

Abstract: While fading effects have long been combatted in 2G wireless networks, primarly devoted to voice calls, they are now seen as an opportunity to increase the capacity of 3G networks that incorporate data traffic. The packet delay tolerance of data applications, such as file transfers and Web browsing for instance, allows the system flexibility in scheduling a user's packets. Opportunistic scheduling ensures transmission occurs when radio conditions are most favorable. This paper discusses different resource sharing strategies and presents some shortcomings of the classical Proportional Fair opportunistic scheduler. A new algorithm, called the Score-Based scheduler, is presented and shown to overcome these drawbacks.