Topic
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.
Papers published on a yearly basis
Papers
More filters
•
26 Feb 2010TL;DR: In this paper, a particular method receives a resource access identifier associated with a shared computing resource and embeds the access identifier into a link to the shared resource, which is inserted into an information element, and an access control scheme is associated with the information element to generate a protected information element.
Abstract: Methods, systems, and computer-readable media are disclosed for access control. A particular method receives a resource access identifier associated with a shared computing resource and embeds the resource access identifier into a link to the shared resource. The link to the shared resource is inserted into an information element. An access control scheme is associated with the information element to generate a protected information element, and the protected information element is sent to a destination computing device.
50 citations
••
TL;DR: The mechanism and policies are effective in redirecting requests thus improving the applications' average weighted response time and the policies take into account the local load of resource providers, imprecise availability information and the compensation of providers for the resources offered to the Grid.
Abstract: Several Grids have been established and used for varying science applications during the last years. Most of these Grids, however, work in isolation and with different utilisation levels. Previous work has introduced an architecture and a mechanism to enable resource sharing amongst Grids. It has demonstrated that there can be benefits for a Grid to offload requests or provide spare resources to another Grid. In this work, we address the problem of resource provisioning to Grid applications in multiple-Grid environments. The provisioning is carried out based on availability information obtained from queueing-based resource management systems deployed at the provider sites which are the participants of the Grids. We evaluate the performance of different allocation policies. In contrast to existing work on load sharing across Grids, the policies described here take into account the local load of resource providers, imprecise availability information and the compensation of providers for the resources offered to the Grid. In addition, we evaluate these policies along with a mechanism that allows resource sharing amongst Grids. Experimental results obtained through simulation show that the mechanism and policies are effective in redirecting requests thus improving the applications' average weighted response time.
50 citations
•
29 Nov 1999TL;DR: The uniform API as discussed by the authors is based on a hierarchical file system which associates resource reservations with references to shared objects, rather than with the objects themselves and allows the use of a variety of different proportional share schedulers for controlling access to physical resources, e.g., CPU, memory, disk, network interfaces, etc.
Abstract: A uniform application programming interface (API) provides efficient generation and control of resource reservations so as to ensure a desired quality of service (QoS) for applications running on an operating system of a computer system. The uniform API is based on a hierarchical file system which associates resource reservations with references to shared objects, rather than with the objects themselves. The uniform API permits the use of a variety of different proportional share schedulers for controlling access to physical resources, e.g., CPU, memory, disk, network interfaces, etc. of the computer system. The hierarchical file system includes a separate directory for each independently-scheduled physical resource of the computer system. A parent of the resource reservation in the hierarchical file system is either a root node of the file system or another reservation for the same resource. The resource reservation represents either an internal reservation, corresponding to a directory in the file system which is permitted to have child nodes associated therewith in the file system, or a queue, corresponding to a directory which is not permitted to have child nodes associated therewith. A given request for a resource reservation is processed by a proportional share scheduler associated with the resource, and identifies a queue having a predetermined portion of the resource allocated thereto. The invention also provides mechanisms for request tagging by the operating system, parental limitation of resources used by a child process, and “garbage collection” of resource reservations that are no longer needed.
50 citations
••
TL;DR: This paper presents the design and implementation of a scheme for augmenting the UNIX® operating system with the location independent remote execution capability, which allows processes to be offloaded to the compute servers and preserves the execution environment of these processes as if they were still executing locally at the originating machine.
Abstract: We consider a computing environment consisting of a network of autonomous, yet cooperating personal computer workstations and shared servers. Computing cycles in such an environment can be shared by creating a pool of compute servers in the network that may be used by the workstations to supplement their computing needs. Some processors may be permanently designated to be the compute servers. In addition, through an advertisement mechanism, any workstation may make itself temporarily available for a specific duration of time to be used as a compute server. In this paper, we present the design and implementation of a scheme for augmenting the UNIX® operating system with the location independent remote execution capability. This capability allows processes to be offloaded to the compute servers and preserves the execution environment of these processes as if they were still executing locally at the originating machine. Our model provides execution location independence of processes by preserving the process view of the file system, parent-child relationships, process groups, and process signaling across machine boundaries in a transparent way. We also present our scheme that allows processors to advertise themselves as available to some or all nodes in the network and withdraw as a compute server in a distributed manner. The scheme is robust in presence of node failures.
50 citations
••
IBM1
TL;DR: Preliminary performance results indicate that the linear programming based approach for resource matching is efficient in speed and accuracy and can keep up with high job arrival rates of an important criterion for online resource matching systems.
Abstract: In this paper, we first present a linear programming based approach for modeling and solving the resource matching problem in grid environments with heterogeneous resources. The resource matching problem described takes into account resource sharing, job priorities, dependencies on multiple resource types, and resource specific policies. We then propose Web service style architecture for online matching of independent jobs with resources in a grid environment and describe a prototype implementation. Our preliminary performance results indicate that the linear programming based approach for resource matching is efficient in speed and accuracy and can keep up with high job arrival rates of an important criterion for online resource matching systems. Also, the Web service style architecture makes the system scalable and extendable. It can also be integrated with other existing grid services in a straightforward manner.
50 citations