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.

Private virtual cluster: infrastructure and protocol for instant grids

Abstract: Given current complexity of Grid technologies, the lack of security of P2P systems and the rigidity of VPN technologies make sharing resources belonging to different institutions still technically difficult. We propose a new approach called ”Instant Grid” (IG), which combines various Grid, P2P and VPN approaches, allowing simple deployment of applications over different administration domains. Three main requirements should be fulfilled to make Instant Grids realistic: 1) simple networking configuration (Firewall and NAT), 2) no degradation of resource security and 3) no need to re-implement existing distributed applications. In this paper, we present Private Virtual Cluster, a low-level middleware that meets these three requirements. To demonstrate its properties, we have connected with PVC a set of firewall-protected PCs and conducted experiments to evaluate the networking performance and the capability to execute unmodified MPI applications.

Computer network system and portable computer

Abstract: A computer network system in which an IP address is assigned not only automatically at a destination of a notebook size PC (portable personal computer) 4 , but also information relating to shared resources on the network is obtained at the site from a server 1 through a LAN circuit 2 , so that the notebook size PC 4 can be used by connecting to the network even in the absence of the administrator. Henceforth, when the user moves within the same building as his own office, it seems that the occasion of using the portable personal computer by connecting to the network such as the Internet and intranet increases. In such a case, connection and disconnection of the network may be repeated frequently, and setting for such operation is facilitated.

Distributed energy efficiency in future home environments

Abstract: In this paper, a new architecture for sharing resources among home environments is proposed. Our approach goes far beyond traditional systems for distributed virtualization, like PlanetLab or grid computing, as it relies on complete decentralization in a peer-to-peer (P2P) like manner and, above all, aims at energy efficiency. Energy metrics are defined, which have to be optimized by the system. The system itself uses virtualization to transparently move tasks from one home to another to optimally utilize the existing computing power. We present an overview of our proposed architecture, consisting of a middleware interconnecting computers and routers in possibly millions of homes using P2P techniques. For demonstrating the potential energy saving of distributed applications, we present an analytical model for sharing downloads, which is verified by discrete event simulation. The model represents an optimistic case without P2P overhead and fairness. The model allows to assess the upper limit of the saving potential. An enhanced version of the simulation model also shows the effect of fairness. The fairer the system gets, the less efficient it is.

Mitigating timing based information leakage in shared schedulers

Abstract: In this work, we study information leakage in timing side channels that arise in the context of shared event schedulers. Consider two processes, one of them an innocuous process (referred to as Alice) and the other a malicious one (referred to as Bob), using a common scheduler to process their jobs. Based on when his jobs get processed, Bob wishes to learn about the pattern (size and timing) of jobs of Alice. Depending on the context, knowledge of this pattern could have serious implications on Alice's privacy and security. For instance, shared routers can reveal traffic patterns, shared memory access can reveal cloud usage patterns, and suchlike. We present a formal framework to study the information leakage in shared resource schedulers using the pattern estimation error as a performance metric. In this framework, a uniform upper bound is derived to benchmark different scheduling policies. The first-come-first-serve scheduling policy is analyzed, and shown to leak significant information when the scheduler is loaded heavily. To mitigate the timing information leakage, we propose an “Accumulate-and-Serve” policy which trades in privacy for a higher delay. The policy is analyzed under the proposed framework and is shown to leak minimum information to the attacker, and is shown to have comparatively lower delay than a fixed scheduler that preemptively assigns service times irrespective of traffic patterns.