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.

Demand response for aggregated residential consumers with energy storage sharing

Abstract: A novel distributed algorithm is proposed in this paper for a network of consumers coupled by energy resource sharing constraints, which aims at minimizing the aggregated electricity costs. Each consumers is equipped with an energy management system that schedules the shiftable loads accounting for user preferences, while an aggregator entity coordinates the consumers demand and manages the interaction with the grid and the shared energy storage system (ESS) via a distributed strategy. The proposed distributed coordination algorithm requires the computation of Mixed Integer Linear Programs (MILPs) at each iteration. The proposed approach guarantees constraints satisfaction, cooperation among consumers, and fairness in the use of the shared resources among consumers. The strategy requires limited message exchange between each consumer and the aggregator, and no messaging among the consumers, which protects consumers privacy. Performance of the proposed distributed algorithm in comparison with a centralized one is illustrated using numerical experiments.

Method for controlling a computer system including a plurality of computers and a network processed as a user resource

Abstract: In a computer system including a plurality of computers interconnected through a network, a specific computer A in the computer system manages the computer resource information and the operating condition information such as for a CPU, a file and a memory and the user resource information such as file data and a program of each computer of the computer system. When a user issues a request from a computer C to log in to the computer system, the request is reported to the computer A, and the information related to the user is returned to the computer C with reference to the user resource information held by the computer A. Then, the computer C acquires the file and the usable program held by the user in the computer system and executes a process, whereby the whole system can be used as resources of each user.

Merlin: Application- and Platform-aware Resource Allocation in Consolidated Server Systems

Abstract: Workload consolidation, whether via use of virtualization or with lightweight, container-based methods, is critically important for current and future datacenter and cloud computing systems. Yet such consolidation challenges the ability of current systems to meet application resource needs and isolate their resource shares, particularly for high core count or 'scaleup' servers. This paper presents the 'Merlin' approach to managing the resources of multicore platforms, which satisfies an application's resource requirements efficiently -- using low cost allocations -- and improves isolation -- measured as increased predictability of application execution. Merlin (i) creates a virtual platform (VP) as a system-level resource commitment to an application's resource shares, (ii) enforces its isolation, and (iii) operates with low runtime overhead. Further, Merlin's resource (re)-allocation and isolation methods operate by constructing online models that capture the resource 'sensitivities' of the currently running applications along all of their resource dimensions. Elevating isolation into a first-class management principle, these sensitivity- and cost-based allocation and sharing methods lead to efficient methods for shared resource use on scaleup server systems. Experimental evaluations on a large core-count machine demonstrate improved performance with reduced performance variation and increased system throughput and efficiency, for a wide range of popular datacenter workloads, compared with the methods used in prior work and with the state-of-art Xen hypervisor.

AdHocFS: sharing files in WLANs

Abstract: This paper presents the ADHOCFS file system for mobile users, which realizes transparent, adaptive file access according to the users' specific situations (e.g., device in use, network connectivity, etc). The paper concentrates more specifically on the support of ADHOCFS for collaborative file sharing within ad hoc groups of trusted nodes that are in the local communication of each other using the underlying ad hoc network, which has not been addressed in the past.

Automating topology aware mapping for supercomputers

Abstract: Petascale machines with hundreds of thousands of cores are being built. These machines have varying interconnect topologies and large network diameters. Computation is cheap and communication on the network is becoming the bottleneck for scaling of parallel applications. Network contention, specifically, is becoming an increasingly important factor affecting overall performance. The broad goal of this dissertation is performance optimization of parallel applications through reduction of network contention. Most parallel applications have a certain communication topology. Mapping of tasks in a parallel application based on their communication graph, to the physical processors on a machine can potentially lead to performance improvements. Mapping of the communication graph for an application on to the interconnect topology of a machine while trying to localize communication is the research problem under consideration. The farther different messages travel on the network, greater is the chance of resource sharing between messages. This can create contention on the network for networks commonly used today. Evaluative studies in this dissertation show that on IBM Blue Gene and Cray XT machines, message latencies can be severely affected under contention. Realizing this fact, application developers have started paying attention to the mapping of tasks to physical processors to minimize contention. Placement of communicating tasks on nearby physical processors can minimize the distance traveled by messages and reduce the chances of contention. Performance improvements through topology aware placement for applications such as NAMD and OpenAtom are used to motivate this work. Building on these ideas, the dissertation proposes algorithms and techniques for automatic mapping of parallel applications to relieve the application developers of this burden. The effect of contention on message latencies is studied in depth to guide the design of mapping algorithms. The hop-bytes metric is proposed for the evaluation of mapping algorithms as a better metric than the previously used maximum dilation metric. The main focus of this dissertation is on developing topology aware mapping algorithms for parallel applications with regular and irregular communication patterns. The automatic mapping framework is a suite of such algorithms with capabilities to choose the best mapping for a problem with a given communication graph. The dissertation also briefly discusses completely distributed mapping techniques which will be imperative for machines of the future.