The Experts below are selected from a list of 222 Experts worldwide ranked by ideXlab platform
Mengchu Zhou - One of the best experts on this subject based on the ideXlab platform.
-
VCG Auction-Based Dynamic Pricing for Multigranularity Service Composition
IEEE Transactions on Automation Science and Engineering, 2018Co-Authors: Quanwang Wu, Mengchu ZhouAbstract:When a single service on its own cannot fulfill a Sophisticated Application, a composition of services is required. Existing methods mostly use a fixed-price scheme for service pricing and determine service allocation for composition based on a first-price auction. However, in a dynamic service market, it is difficult for service providers to determine a fixed price that is profitable while attractive to customers. Meanwhile, this mechanism cannot ensure that the providers who require the least cost to provide services would win the auction, because the pricing strategy of service providers is unpredictable. To address such issues, in this paper, we propose Vickrey-Clarke-Groves auction-based dynamic pricing for a generalized service composition. We consider fine-grained services as candidates for composition as well as coarse-grained ones. In our approach, service providers bid for services of different granularities in the composite service and based on received bids, a user decides a composition that minimizes the social cost while meeting quality constraints. Experimental results at last verify the feasibility and effectiveness of the proposed approach.
Ronny Fehling - One of the best experts on this subject based on the ideXlab platform.
-
ICSNC - Tracing and Managing hazardous material in Sensor Networks
2006 International Conference on Systems and Networks Communications (ICSNC'06), 2006Co-Authors: Ronny FehlingAbstract:This paper will look at a real world project in the field of hazardous material management and how sensor networks can efficiently help to increase safety and security as well as autonomously enable Sophisticated Application integration. We will introduce a Sensor Data Model that is able to handle the avalanche of sensor data by organizing, analyzing and correlating sensor data by using Zones and complex event processing. The model uses state-awareness for a truly event driven architecture.
-
Tracing and Managing hazardous material in Sensor Networks
2006 International Conference on Systems and Networks Communications (ICSNC'06), 2006Co-Authors: Ronny FehlingAbstract:This paper will look at a real world project in the field of hazardous material management and how sensor networks can efficiently help to increase safety and security as well as autonomously enable Sophisticated Application integration. We will introduce a Sensor Data Model that is able to handle the avalanche of sensor data by organizing, analyzing and correlating sensor data by using Zones and complex event processing. The model uses state-awareness for a truly event driven architecture.
David R Cheriton - One of the best experts on this subject based on the ideXlab platform.
-
a caching model of operating system kernel functionality
Operating Systems Review, 1995Co-Authors: David R Cheriton, Kenneth J DudaAbstract:Operating system design has had limited success in providing adequate Application functionality and a poor record in avoiding excessive growth in size and complexity, especially with protected operating systems. Applications require far greater control over memory, I/O and processing resources to meet their requirements. For example, database transaction processing systems include their own "kernel" which can much better manage resources for the Application than can the Application-ignorant general-purpose conventional operating system mechanisms. Large-scale parallel Applications have similar requirements. The same requirements arise with servers implemented outside the operating system kernel.In our research, we have been exploring the approach of making the operating system kernel a cache for active operating systems objects such as processes, address spaces and communication channels, rather than a complete manager of these objects. The resulting system is smaller than recent so-called micro-kernels, and also provides greater flexibility for Applications, including real-time Applications, database management systems and large-scale simulations. As part of this research, we have developed what we call a cache kernel, a new type of micro-kernel that supports operating system configurations across these dimensions.The cache kernel can also be regarded as providing a hardware adaptation layer (HAL) to operating system services rather than trying to just provide a key subset of OS services, as has been the common approach in previous micro-kernel work. However, in contrast to conventional HALs, the cache kernel is fault-tolerant because it is protected from the rest of the operating system (and Applications), it is replicated in large-scale configurations and it includes audit and recovery mechanisms. A cache kernel has been implemented on a scalable shared-memory and networked multi-computer [2] hardware which provides architectural support for the cache kernel approach.Figure 1 illustrates a typical target configuration. There is an instance of the cache kernel per multi-processor module (MPM), each managing the processors, second-level cache and network interface of that MPM. The cache kernel executes out of PROM and local memory of the MPM, making it hardware-independent of the rest of the system except for power. That is, the separate cache kernels and MPMs fail independently. Operating system services are provided by Application kernels, server kernels and conventional operating system emulation kernels in conjunction with privileged MPM resource managers (MRM) that execute on top of the cache kernel. These kernels may be in separate protected address spaces or a shared library within a Sophisticated Application address space. A system bus connects the MPMs to each other and the memory modules. A high-speed network interface per MPM connects this node to file servers and other similarly configured processing nodes. This overall design can be simplified for real-time Applications and similar restricted scenarios. For example, with relatively static partitioning of resources, an embedded real-time Application could be structured as one or more Application spaces incorporating Application kernels as shared libraries executing directly on top of the cache kernel.
-
Application controlled physical memory using external page cache management
Architectural Support for Programming Languages and Operating Systems, 1992Co-Authors: Kieran Harty, David R CheritonAbstract:Next generation computer systems will have gigabytes of physical memory and processors in the 100 MIPS range or higher. Contrary to some conjectures, this trend requires more Sophisticated memory management support for memory-bound computations such as scientific simulations and systems such as large-scale database systems, even though memory management for most programs will be less of a concern. We describe the design, implementation and evaluation of a virtual memory system that provides Application control of physical memory using external page-cache management. In this approach, a Sophisticated Application is able to monitor and control the amount of physical memory it has available for execution, the exact contents of this memory, and the scheduling and nature of page-in and page-out using the abstraction of a physical page cache provided by the kernel. We claim that this approach can significantly improve performance for many memory-bound Applications while reducing kernel complexity, yet does not complicate other Applications or reduce their performance.
Ion Jin, Xin; Li, Xiaozhou; Zhang, Haoyu; Soule, Rober - One of the best experts on this subject based on the ideXlab platform.
-
NetCache : Balancing Key-Value Stores with Fast In-Network Caching Key-value stores power online services
Sosp, 2017Co-Authors: Ion Jin, Xin; Li, Xiaozhou; Zhang, Haoyu; Soule, RoberAbstract:We present NetCache, a new key-value store architecture that leverages the power and flexibility of new-generation programmable switches to handle queries on hot items and balance the load across storage nodes. NetCache provides high aggregate throughput and low latency even under highlyskewed and rapidly-changing workloads. The core of NetCache is a packet-processing pipeline that exploits the capabilities of modern programmable switch ASICs to efficiently detect, index, cache and serve hot key-value items in the switch data plane. Additionally, our solution guarantees cache coherence with minimal overhead. We implement a NetCache prototype on Barefoot Tofino switches and commodity servers and demonstrate that a single switch can process 2+ billion queries per second for 64K items with 16-byte keys and 128-byte values, while only consuming a small portion of its hardware resources. To the best of our knowledge, this is the first time that a Sophisticated Application-level functionality, such as in-network caching, has been shown to run at line rate on programmable switches. Furthermore, we show that NetCache improves the throughput by 3-10× and reduces the latency of up to 40% of queries by 50%, for high-performance, in-memory key-value stores.
Quanwang Wu - One of the best experts on this subject based on the ideXlab platform.
-
VCG Auction-Based Dynamic Pricing for Multigranularity Service Composition
IEEE Transactions on Automation Science and Engineering, 2018Co-Authors: Quanwang Wu, Mengchu ZhouAbstract:When a single service on its own cannot fulfill a Sophisticated Application, a composition of services is required. Existing methods mostly use a fixed-price scheme for service pricing and determine service allocation for composition based on a first-price auction. However, in a dynamic service market, it is difficult for service providers to determine a fixed price that is profitable while attractive to customers. Meanwhile, this mechanism cannot ensure that the providers who require the least cost to provide services would win the auction, because the pricing strategy of service providers is unpredictable. To address such issues, in this paper, we propose Vickrey-Clarke-Groves auction-based dynamic pricing for a generalized service composition. We consider fine-grained services as candidates for composition as well as coarse-grained ones. In our approach, service providers bid for services of different granularities in the composite service and based on received bids, a user decides a composition that minimizes the social cost while meeting quality constraints. Experimental results at last verify the feasibility and effectiveness of the proposed approach.