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
TL;DR: A virtualization design advisor is introduced that uses information about the anticipated workloads of each of the database systems to recommend workload-specific configurations offline and runtime information collected after the deployment of the recommended configurations can be used to refine the recommendation and to handle changes in the workload.
Abstract: Virtual machine monitors are becoming popular tools for the deployment of database management systems and other enterprise software. In this article, we consider a common resource consolidation scenario in which several database management system instances, each running in a separate virtual machine, are sharing a common pool of physical computing resources. We address the problem of optimizing the performance of these database management systems by controlling the configurations of the virtual machines in which they run. These virtual machine configurations determine how the shared physical resources will be allocated to the different database system instances. We introduce a virtualization design advisor that uses information about the anticipated workloads of each of the database systems to recommend workload-specific configurations offline. Furthermore, runtime information collected after the deployment of the recommended configurations can be used to refine the recommendation and to handle changes in the workload. To estimate the effect of a particular resource allocation on workload performance, we use the query optimizer in a new what-if mode. We have implemented our approach using both PostgreSQL and DB2, and we have experimentally evaluated its effectiveness using DSS and OLTP workloads.
165 citations
TL;DR: It is demonstrated how the proposed service-oriented integration architecture can be used to establish a collaborative environment that provides dynamic resource scheduling services.
Abstract: The rapidly changing needs and opportunities of today's global market require unprecedented levels of interoperability to integrate diverse information systems to share knowledge and collaborate among organizations. The combination of Web services and software agents provides a promising computing paradigm for efficient service selection and integration of inter-organizational business processes. This paper proposes an agent-based service-oriented integration architecture to leverage manufacturing scheduling services on a network of virtual enterprises. A unique property of this approach is that the scheduling process of an order is orchestrated on the Internet through the negotiation among agent-based Web services. A software prototype system has been implemented for inter-enterprise manufacturing resource sharing. It demonstrates how the proposed service-oriented integration architecture can be used to establish a collaborative environment that provides dynamic resource scheduling services.
164 citations
21 Feb 2003
TL;DR: It is shown how requiring nodes to publish auditable records of their usage can give nodes economic incentives to report their usage truthfully, and simulation results are presented that show the communication overhead of auditing is small and scales well to large networks.
Abstract: Cooperative peer-to-peer applications are designed to share the resources of each computer in an overlay network for the common good of everyone. However, users do not necessarily have an incentive to donate resources to the system if they can get the system’s resources for free. This paper presents architectures for fair sharing of storage resources that are robust against collusions among nodes. We show how requiring nodes to publish auditable records of their usage can give nodes economic incentives to report their usage truthfully, and we present simulation results that show the communication overhead of auditing is small and scales well to large networks.
164 citations
01 Apr 1999
TL;DR: YESSIR as discussed by the authors is a reservation mechanism that simplifies the process of establishing reserved flows while preserving many unique features introduced by RSVP, such as robustness, advertising network service availability and resource sharing among multiple senders.
Abstract: RSVP has been designed to support resource reservation in the Internet. However, it has two major problems: complexity and scalability. The former results in large message processing overhead at end systems and routers, and inefficient firewall processing at the edge of the network. The latter implies that in a backbone environment, the amount of bandwidth consumed by refresh messages and the storage space that is needed to support a large number of flows at a router are too large. We have developed a new reservation mechanism that simplifies the process of establishing reserved flows while preserving many unique features introduced by RSVP. Simplicity is measured in terms of control message processing, data packet processing, and user-level flexibility. Features such as robustness, advertising network service availability and resource sharing among multiple senders are also supported in the proposal.The proposed mechanism, YESSIR (YEt another Sender Session Internet Reservations) generates reservation requests by senders to reduce the processing overhead, builds on top of RTCP, uses soft state to maintain reservation states, supports shared reservation and associated flow merging and is compatible with the IETF Integrated Services models.YESSIR extends the all-or-nothing reservation model to support partial reservations that improve over the duration of the session.To address the scalability issue, we investigate the possibility of using YESSIR for per-stream reservation and RSVP for aggregate reservation.
163 citations
TL;DR: A multitude of new and exciting work is surveyed that explores the diverse new roles the OS scheduler can successfully take on, including those that exclusively make use of OS thread-level scheduling to achieve their goals.
Abstract: Chip multicore processors (CMPs) have emerged as the dominant architecture choice for modern computing platforms and will most likely continue to be dominant well into the foreseeable future. As with any system, CMPs offer a unique set of challenges. Chief among them is the shared resource contention that results because CMP cores are not independent processors but rather share common resources among cores such as the last level cache (LLC). Shared resource contention can lead to severe and unpredictable performance impact on the threads running on the CMP. Conversely, CMPs offer tremendous opportunities for mulithreaded applications, which can take advantage of simultaneous thread execution as well as fast inter thread data sharing. Many solutions have been proposed to deal with the negative aspects of CMPs and take advantage of the positive. This survey focuses on the subset of these solutions that exclusively make use of OS thread-level scheduling to achieve their goals. These solutions are particularly attractive as they require no changes to hardware and minimal or no changes to the OS. The OS scheduler has expanded well beyond its original role of time-multiplexing threads on a single core into a complex and effective resource manager. This article surveys a multitude of new and exciting work that explores the diverse new roles the OS scheduler can successfully take on.
161 citations