6972987
Scalable service differentiation in a shared storage cache
Motivated by the need to enable easier data sharing and curb rising storage management costs, storage systems are becoming increasingly consolidated and thereby shared by a large number of users and applications. In such environments, service differentiation becomes increasingly important. Since caching is a fundamental and pervasive technique employed to improve the performance of storage systems, providing differentiated services from a storage cache is a crucial component of the entire end-to-end QoS solution. In this paper we discuss a QoS architecture for a shared storage proxy cache which can provide long-term hit rate assurances to competing classes. The proposed architecture consists of three components: (a) per-class feedback controllers that track the performance of each class, (b) a fairness controller that allocates excess resources fairly in the case when all goals are met, and (c) a contention resolver that decides cache allocation in the case when at least one class does not meet its target hit rate. We compare the performance of various feedback per-class controllers, and provide guidelines for designing QoS mechanisms for such a dynamic environment.
11059176
Policy-based validation of SAN configuration
Historically, storage has been directly connected to servers for fast local access and easy configuration. In recent years, storage area networks (SANs) have defined an alternative storage paradigm that allows storage to be shared among servers using fast interconnects. One of the key challenges of SAN management is the large number of configuration problems that are encountered in a typical SAN deployment. These configuration problems can be addressed by SAN management software. However, hard-coding the SAN configuration rules into the management software is not a viable option since it is not possible to easily modify or replace old configuration rules and specify new policies and guidelines. In this paper, we propose a novel policy-based SAN configuration validation system that can be used to specify, store, and evaluate configuration policies for SANs. We also introduce five new operators for collection policies that are useful for evaluating a wide variety of practical SAN configuration policies found in practice. The policy-based SAN configuration checking approach proposed in this paper is discussed within the context of device interoperability constraints. However, this approach is extensible as it can also be used to enforce performance, reliability, and security-related configuration constraints.
2439836
Mitigating soft error failures for multimedia applications by selective data protection
With advances in process technology, soft errors(SE)are becoming an increasingly critical design concern. Due to their large area and high density, caches are worst hit by soft errors. Although Error Correction Code based mechanisms protect the data in caches, they have high performance and power overheads. Since multimedia applications are increasingly being used in mission-critical embedded systems where both reliability and energy are a major concern, there is a de?nite need to improve reliability in embedded systems, without too much energy overhead. We observe that while a soft error in multimedia data may only result in a minor loss in QoS, a soft error in avariable that controls the execution ?ow of the program may be fatal. Consequently, we propose to partition the data space into failure critical and failure non-critical data, and provide a high-degree of soft error protection only to the failure critical data in Horizontally Partitioned Caches. Experimental results demonstrate that our selective data protection can achieve the failure rate close to that of a soft error protected cache system, while retaining the performance and energy consumption similar to those of a traditional cache system, with some degradation in QoS. For example, for conventional con?guration as in IntelXScale, our approach achieves the same failure rate, while improving performance by 28% and reducing energy consumption by 29%in comparison with a soft error protected cache.
206593703
A Method for Deciding Quantization Steps in QIM Watermarking Schemes
In this paper, we propose a method for enlarging quantization steps of a QIM watermarking scheme which determines the perceptual quality and robustness of the watermarked images. In general, increasing the quantization steps leads to good robustness but poor perceptual quality of watermarked images and vice versa. However, if we choose the quantization steps considering the expected quantization results as well as the original images, we can increase both robustness and perceptual quality of the watermarked images.
5225944
Adaptive filtering using constrained subband updates
This paper describes and analyzes a class of subband adaptive filters (SAF) that stems from various approaches of applying subband and multirate techniques in adaptive filtering. This class of SAF has a unique structure of weight-control mechanism where subband error signals are used to actuate the adaptation of a fullband weight vector. In this paper, we show that the recursive weight adaptation can be expressed as an underdetermined least-squares solution. Within this deterministic framework, we show its underlying affinity with the normalized least-mean-square (NLMS) and affine projection (AP) algorithms. We then compare the efficacy of these algorithms in terms of convergence rate and computational complexity.
42709388
Precomputing avatar behavior from human motion data
9935268
Case and Constraint-Based Apartment Construction Project Planning System: FASTrak-APT
To effectively generate a fast and consistent apartment construction project network, Hyundai and KAIST have developed a case and constraint based project planning expert system for apartment domain, FASTrak-APT, inspired by the fact that human expert project planner uses previous cases for planning a new project and modifies them using her/his knowledge on domain constraints. This largescale, case based and mixed-initiative planning system integrated with intensive constraint-based adaptation utilizes semantic level meta-constraints and human decisions for compensating incomplete cases imbedding specific planning knowledge. The case and constraint based architecture inherently supports cross-checking cases with constraints during the system development and maintenance. This system has drastically reduced the time and effort required for initial project planning, improved the quality and completeness of the generated plans, and is expected to give the company the competitive advantage in contract bids for new contracts.