The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Allocating computing resources to different tasks of surveillance systems has always been a big challenge. The problem becomes complicated when it requires dealing with real-time computation and decision making as the system cannot afford of processing all sensory feeds and execute computationally expensive algorithms. In multi-modal surveillance systems, real-time event detection and understanding...
Distributed real-time systems make use of special execution scheduling techniques to guarantee that the system response does not exceed the imposed deadline. In this paper we describe a real-time workload model in which job precedence and resource constraints are present. We also propose a cyclic executive-based method for scheduling applications which can be expressed using the presented model, on...
This paper studies a flexible scheduling data structure that is used to manage out-of-order service requests in real-time service-oriented architecture (RT-SOA) applications. We propose a hierarchical TBTree (hTBTree) to record server availability across a hierarchy of time intervals with different degrees of time granularity. Real-time services need to find enough time interval in hTBTree for their...
In this paper, we provide a new resource management algorithm with delay constraints in cognitive OFDMA Systems. Our objective is to give priority to the high real-time cognitive user in the allocation of the channel in the first scheduling slot, maximize multiple cognitive users' weighted rate sum by jointly adjusting their frequency and power resource, under the constraints of multiple primary users'...
Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent. Having the flexibility to transform...
In multiprocessor systems, passive replication is a technique that trades processing power for increased reliability. One approach of passive replication, called primary-backup task scheduling, is often used in real-time multiprocessor systems to ensure that deadlines are met in spite of faults. Briefly, it consists in scheduling a secondary task conditionally, in such a way that the secondary task...
We consider the problem of energy-aware joint scheduling of tasks and messages with real-time constraints in wireless networked embedded systems specifically wireless sensor networks. We use the mixed tree coloring approach in order to model the constraints and show that k-coloring of a mixed tree can be mapped to a non-conflicting schedule consisting of k time slots. Also, we propose to conduct testbed...
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore, GEDF may be a good candidate scheduling algorithm for soft real-time workloads. However, such workloads are often implemented assuming an average-case provisioning, and in prior tardiness-bound derivations for GEDF, worst-case...
Managed languages such as Java and C# are increasingly being considered for hard real-time applications because of their productivity and software engineering advantages. Automatic memory management, or garbage collection, is a key enabler for robust, reusable libraries, yet remains a challenge for analysis and implementation of real-time execution environments. This paper comprehensively compares...
This paper describes scheduling and allocating with the resource of production line in factory, and proposes a novel model of scheduling and allocating the resource of production line, which is based on real-time data streams. This model realizes the reasonable schedule and allocation by combining the real-time manufacturing schedule information of production, the status of the devices and analysis...
This paper presents algorithms that (1) facilitate system-independent synthesis of timing-interfaces for subsystems and (2) system-level selection of interfaces to minimize CPU load. The results presented are developed for hierarchical fixed-priority scheduling of subsystems that may share logical recourses (i.e. semaphores). We show that the use of shared resources results in a tradeoff problem,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.