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
Patent
15 Feb 2013
TL;DR: In this article, the file sharing device includes a shared folder, a file sharing table, and a file synchronizing section to send file information of a file sent by a terminal, to other terminals in the same conference, if the file sent from the terminal is stored in the shared folder.
Abstract: A communication system having a repeating device to relay contents data to multiple terminals in a conference, and a file sharing device to provide a file to the terminals, includes a section to generate location information of a shared folder accessed commonly by the terminals, which is indicated to the multiple terminals, and a table of participating terminals. The file sharing device includes a shared folder, a file sharing table, and a first file synchronizing section to send file information of a file sent by a terminal, to other terminals in the same conference, if the file sent from the terminal is stored in the shared folder. Each of the terminals includes a folder mounting section to mount the shared folder on the requesting terminal, and a second file synchronizing section to send a file to be shared to the shared folder.

33 citations

Journal ArticleDOI
TL;DR: Given the logical topology of the network, a cross- layer fair bandwidth sharing problem as a non-linear mixed- integer network utility maximization problem is mathematically formulated and an optimal joint design is proposed which leads to a global maximum.
Abstract: In a wireless mesh network (WMN) with a number of stationary wireless routers, the aggregate capacity can be increased when each router is equipped with multiple network interface cards (NICs) and each NIC is assigned to a distinct orthogonal frequency channel. In this paper, given the logical topology of the network, we mathematically formulate a cross- layer fair bandwidth sharing problem as a non-linear mixed- integer network utility maximization problem. An optimal joint design, based on exact binary linearization techniques, is proposed which leads to a global maximum. A near-optimal joint design, based on approximate dual decomposition techniques, is also proposed which is practical for deployment. Performance is assessed through several numerical examples in terms of network utility, aggregate network throughput, and fairness index. Results show that our proposed designs can lead to multi-channel WMNs which are more efficient and fair compared to their single- channel counterparts. The performance gain on both efficiency and fairness increase as the number of available NICs per router or the number of available frequency channels increases.

33 citations

Proceedings ArticleDOI
05 Jun 2016
TL;DR: This paper provides a pseudo-polynomial-time schedulability test and response-time analysis for constrained-deadline sporadic task systems, and proposes a task partitioning algorithm that achieves a speedup factor of 7, compared to the optimal schedule.
Abstract: The emergence of multicore and manycore platforms poses a big challenge for the design of real-time embedded systems, especially for timing analysis. We observe in this paper that response-time analysis for multicore platforms with shared resources can be symmetrically approached from two perspectives: a core-centric and a shared-resource-centric perspective. The common "core-centric" perspective is that a task executes on a core until it suspends the execution due to shared resource accesses. The potentially less intuitive "shared-resource-centric" perspective is that a task performs requests on shared resources until suspending itself back to perform computation on its respective core. Based on the above observation, we provide a pseudo-polynomial-time schedulability test and response-time analysis for constrained-deadline sporadic task systems. In addition, we propose a task partitioning algorithm that achieves a speedup factor of 7, compared to the optimal schedule. This constitutes the first result in this research line with a speedup factor guarantee. The experimental evaluation demonstrates that our approach can yield high acceptance ratios if the tasks have only a few resource access segments.

33 citations

Patent
04 Apr 2011
TL;DR: In this article, the authors describe methods and systems for managing resources, for example in connection with call admission control or other communications or transactions in a system, where a plurality of resource pools are established.
Abstract: The present disclosure describes methods and systems for managing resources, for example in connection with call admission control or other communications or transactions in a system. In particular, a plurality of resource pools are established. At least a first or priority resource is associated with a minimum resource amount, while at least a second or normal resource pool is associated with a maximum resource amount. From the system resource pools, allocations are made to each of a plurality of system servers. If a server receives a request for priority resources that cannot be satisfied from the allocation of priority resources made to that server, that server may borrow from an allocation of normal resources. Resources can also be shared between servers. Accordingly, if required resources are not available from an allocation made to a server receiving the request for resources, that server can request resources from another server. In responding to a request to share resources, a server can attempt to fill the request as if the request had originally been made to that server.

33 citations

Patent
08 Sep 2009
TL;DR: A peer-to-peer collaborative network (P2PCCN) as mentioned in this paper allows for the existence of a number of collaborative networks, where users can interact in ways such as messaging, file sharing, resource sharing, and the like.
Abstract: A peer-to-peer collaborative network system is described. The peer-to-peer collaborative network system allows for the existence of a number of collaborative networks. Within the collaborative networks, users can interact in ways such as messaging, file sharing, resource sharing, and the like. The user will query other users on the network to determine which collaborative networks are active. The user can then select an active collaborative network without having to be invited there.

33 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