scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: This work presents an architecture for network-authenticated disks that implements distributed file systems without file servers or encryption and provides network clients with direct network access to remote storage.
Abstract: We present an architecture for network-authenticated disks that implements distributed file systems without file servers or encryption. Our system provides network clients with direct network access to remote storage.

82 citations

Patent
25 Jun 2002
TL;DR: In this article, the authors proposed a virtual storage area network (VASN) using policing protocols (311, 321) and mirror engines (317, 327) without a physical shared storage node.
Abstract: Mirroring data to provide a virtual storage area network (340) using policing protocols (311, 321) and mirror engines (317, 327) without a physical shared storage node. The mirror engines (317, 327) are found at each server computer (310, 320) in the network (301) in order to mirror the data between mass storage devices (319, 329) of the servers (310, 320) as the servers receive and execute write operations, which results in each mass storage device containing the same stored data. The policing protocols (311, 321) prevent data corruption by not allowing more than one server (310, 320) at a time write to a file of data. If one server (310, 320) experiences failure and is incapable of providing access to network data, the other server or servers can service all read requests, since all network data is accessible by all servers. Unlike conventional storage area networks, there is no physical shared storage node and, accordingly, the costs of obtaining and operating the virtual storage area network (340) are relatively small.

82 citations

Journal ArticleDOI
TL;DR: An empirical case study of a logistics network in Chongqing suggests that the proposed collaboration mechanism with SST network representation can reduce costs, improve transportation efficiency, and contribute to efficient and sustainable logistics network operations.

82 citations

Proceedings Article
01 Jan 2013
TL;DR: SQLVM as mentioned in this paper is an abstraction for performance isolation which is built on a promise of reservation of key database server resources, such as CPU, I/O and memory, for each tenant.
Abstract: A relational Database-as-a-Service provider, such as Microsoft SQL Azure, can share resources of a single database server among multiple tenants. This multi-tenancy enables cost reduction for the cloud service provider which it can pass on as savings to the tenants. However, resource sharing can adversely affect a tenant’s performance due to resource demands of other tenants’ workloads. Service providers today do not provide any assurances to a tenant in terms of isolating its performance from other co-located tenants. We present SQLVM, an abstraction for performance isolation which is built on a promise of reservation of key database server resources, such as CPU, I/O and memory, for each tenant. The key challenge is in supporting this abstraction within a DBMS without statically allocating resources to tenants, while ensuring low overheads and scaling to large numbers of tenants. Our contributions are in (1) formalizing the above abstraction of SQLVM; (2) designing mechanisms to support the promised resources; and (3) proposing low-overhead techniques to objectively meter resource allocation to establish accountability. We implemented a prototype of SQLVM in Microsoft SQL Azure and our experiments demonstrate that SQLVM results in significantly improved performance isolation from other tenants when compared to the state-of-the-art.

82 citations

Proceedings ArticleDOI
09 Jun 2013
TL;DR: A coalitional game with transferable utility, in which each user intends to maximize its own utility and has the incentive to cooperate with other users to form a strengthened user group that can increase the opportunity to win its preferred spectrum resources.
Abstract: In this paper, we investigate the resource sharing problem to optimize the system performance in device-to-device (D2D) communications underlaying cellular networks from a distributed and cooperative perspective. Specifically, we formulate a coalitional game with transferable utility, in which each user intends to maximize its own utility and has the incentive to cooperate with other users to form a strengthened user group that can increase the opportunity to win its preferred spectrum resources. Furthermore, we propose a distributed merge-and-split based coalition formation algorithm based on a new defined Max-Coalition order to effectively process the resource allocation problem. Simulation results confirm that, with much lower computational complexity, the proposed scheme achieves an approaching performance in terms of network sum-rate compared with the centralized optimal resource allocation scheme obtained via exhaustive search.

81 citations


Network Information
Related Topics (5)
The Internet
213.2K papers, 3.8M citations
84% related
Information system
107.5K papers, 1.8M citations
83% related
Software
130.5K papers, 2M citations
80% related
Network packet
159.7K papers, 2.2M citations
78% related
Wireless network
122.5K papers, 2.1M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202381
2022194
2021223
2020298
2019381
2018373