14189714
Time-parameterized sensing task model for real-time tracking
This paper proposes a novel task model in which its physical and temporal parameters are specified as time-parameterized functions and their values are finally determined at the actual dispatch time. This model is clearly differentiated from the classical task model where parameters are fixed at the job release time. The new model better suits sensing tasks in tracking applications, since the sensor parameters such as field-of-view and measurement duration can be properly adjusted at the actual sensing time. The new model, however, creates the cyclic dependency between task parameters and scheduling behavior, that is, the task parameters depend on scheduling behavior and the latter in turn depends on the former. This cyclic dependency makes the schedulability check even more difficult. We handle this difficulty by iterative convergence and probabilistic schedulability envelope, which provides an efficient online schedulability check. The experimental study shows that the new model significantly improves the effective capacity of tracking systems without losing track accuracy
42435746
Efficiently supporting hard/soft deadline transactions in real-time database systems
As in other application areas, there is an increasing need for managing a large amount of data in the real-time area. This need gave birth to a system called a real-time database system (RTDBS) that provides database operations with timing constraints. One typical timing constraint in an RTDBS is temporal consistency that states that a transaction must read temporally valid data objects. This requires the data objects to be updated repeatedly. This paper proposes three novel schemes that aim to minimize the number of updates of data objects needed for guaranteeing the temporal consistency requirements of transactions with hard-deadlines. The three guarantee schemes differ from each other in the amount of updates and the implementation complexity. This paper also gives a framework for integrating transactions with soft-deadlines into the three guarantee schemes.
195349457
Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
We propose a technique for analyzing cache-related preemption delays of tasks that cause unpredictable variation in task execution time in the context of fixed-priority preemptive scheduling. The proposed technique consists of two steps. The first step performs a per-task analysis to estimate cache-related preemption cost for each execution point in a given task from the number of useful cache blocks at the execution point. The second step computes the worst case response time of each task using a response time equation and a linear programming technique which takes as its input the preemption cost information of tasks obtained in the first step. Our experimental results show that the proposed technique gives a prediction of the worst case cache-related preemption delay that is up to 60% tighter than that obtained from previous approaches.
7460330
Enhanced analysis of cache-related preemption delay in fixed-priority preemptive scheduling
We propose an enhanced technique for analyzing, and thus bounding cache related preemption delay in fixed priority preemptive scheduling focusing on instruction caching. The proposed technique improves upon previous techniques in two important ways. First, the technique takes into account the relationship between a preempted task and the set of tasks that execute during the preemption when calculating the cache related preemption delay. Second, the technique considers phasing of tasks to eliminate many infeasible task interactions. These two features are expressed as constraints of a linear programming problem whose solution gives a guaranteed upper bound on the cache related preemption delay. The paper also compares the proposed technique with previous techniques. The results show that the proposed technique gives up to 60% tighter prediction of the worst case response time than the previous techniques.
16132542
Stochastic analysis of periodic real-time systems
This paper describes a stochastic analysis method for general periodic real-time systems. The proposed method accurately computes the response time distribution of each task in the system, thus making it possible to determine the deadline miss probability of individual tasks, even for systems with maximum utilization factor greater than one. The method uniformly covers both fixed-priority scheduling (such as rate monotonic) as well as dynamic-priority scheduling (such as earliest deadline first) and can handle arbitrary relative deadlines and execution time distributions. The accuracy of the method is proven by comparing the results from the analysis with those obtained from simulations, as well as other methodologies in the literature.
17289303
Spare CASH: reclaiming holes to minimize aperiodic response times in a firm real-time environment
Scheduling periodic tasks that allow some instances to be skipped produces spare capacity in the schedule. Only a fraction of this spare capacity is uniformly distributed and can easily be reclaimed for servicing aperiodic requests. The remaining fraction of the spare capacity is non-uniformly distributed, and no existing technique has been able to reclaim it. We present a method for improving the response times of aperiodic tasks by identifying the non-uniform holes in the schedule and adding these holes as extra capacity to the capacity queue of the CASH mechanism. The non-uniform holes can account for a significant portion of spare capacity, and reclaiming this capacity results in considerable improvements to aperiodic response times.
2177844
Design, performance analysis, and implementation of a super-scalar video-on-demand system
Despite the availability of video-on-demand (VoD) services in a number of cities around the world, large-scale deployment of VoD services in a metropolitan area is still economically impractical. This study presents a novel super-scalar architecture for building very large-scale and efficient VoD systems. The proposed architecture combines the use of static multicast, dynamic multicast, and intelligent client-side caching to vastly reduce server and network resource requirement. Moreover, in sharp contrast to conventional VoD systems where the system cost increases at least linearly with the system scale, the proposed architecture becomes more efficient as the system scales up and can ultimately be scaled up to serve any number of users while still keeping the startup latency short. This paper presents this new architecture, proposes methods to support interactive playback controls without the need for additional server or client resources, and derives an approximate performance model to relate the startup latency with other system parameters. The performance model is validated using simulation and the architecture is evaluated under various system settings. Lastly, a system implementation is presented and benchmarking results obtained to further verify the architecture, the performance model, and the simulation results.
206793088
A fuzzy ontology and its application to news summarization
In this paper, a fuzzy ontology and its application to news summarization are presented. The fuzzy ontology with fuzzy concepts is an extension of the domain ontology with crisp concepts. It is more suitable to describe the domain knowledge than domain ontology for solving the uncertainty reasoning problems. First, the domain ontology with various events of news is predefined by domain experts. The document preprocessing mechanism will generate the meaningful terms based on the news corpus and the Chinese news dictionary defined by the domain expert. Then, the meaningful terms will be classified according to the events of the news by the term classifier. The fuzzy inference mechanism will generate the membership degrees for each fuzzy concept of the fuzzy ontology. Every fuzzy concept has a set of membership degrees associated with various events of the domain ontology. In addition, a news agent based on the fuzzy ontology is also developed for news summarization. The news agent contains five modules, including a retrieval agent, a document preprocessing mechanism, a sentence path extractor, a sentence generator, and a sentence filter to perform news summarization. Furthermore, we construct an experimental website to test the proposed approach. The experimental results show that the news agent based on the fuzzy ontology can effectively operate for news summarization.
9335901
Performance upgrade for large object bases using disk arrays
The authors propose the use of multiple disks to increase the bandwidth of disk I/O so as to alleviate the I/O bottleneck problem existed in OODB applications. However, a major difficulty in using multiple disks for the support of OODBs is that an object may reference or be referenced by other objects through associations. This requires that the search of objects be sequential through the association links, which is sometimes referred to as the navigational search of objects in an object base. This restriction limits the concurrency in object retrieval and invalidates the use of multiple disks. Techniques such as clustering/indexing of objects do not help to resolve this problem. By using a two-phase query processing strategy previously proposed by them, objects of interest can be accessed in parallel from multiple disk. The aim of the paper is to design a probability-based evaluation model to estimate the performance of using multiple disks and to compare it with a single disk system. The result shows that the scheme is viable and a significant improvement is achieved while multiple disks are used.
16256064
Emotionally reactive television
When is an interface simple? Is it when it is invisible or very obvious, even intrusive? From the time TV was created, watching TV is considered as a static activity. TV audiences have very limited choices to interact with TV, such as turning on/off, increasing/decreasing volume, and traversing among different channels. This paper suggests that TV program should have social responses to people, such as affording and accepting audience's emotional feeling with the growth of technologies. This paper presents HiTV, an Emotionally-Reactive TV system using a digitally augmented soft ball as affect-input interfaces that can amplify TV program's video/audio signals. HiTV transforms the original video and audio into effects that intrigue and fulfill people's emotional expectation.
1695864
Supporting Multi-Dimensional Range Query for Sensor Networks
This paper presents the design of Pool, an efficient and scalable data storage scheme for supporting multidimensional queries. The foundation of the work that makes the Pool approach superior in executing multi-dimensional queries is that it provides a novel and elegant higher dimension to two-dimensional data mapping mechanism. Our performance study proves the efficiency of the design.