Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemptions and in doing so...
Utilization bounds for earliest deadline first (EDF) and rate monotonic (RM) scheduling are known and well understood for uniprocessor systems. In this paper, we derive limits on similar bounds for the multiprocessor case, when the individual processors need not be identical. Tasks are partitioned among the processors and RM scheduling is assumed to be the policy used in individual processors. A minimum...
This mapping problem has to be solved in many application scenarios. In the automotive industry, for example, the implementation of car functions involves distributed task sets running on multiple electronic control units (ECU) with bus-based inter-task communication, a problem we consider in this paper. Our approach is based on mixed integer linear programming (MILP). MILP is concerned with optimizing...
In ubiquitous computing environments, context-awareness is one of the most important research topics. Computers embedded in our surrounding can extract information about a user, and the information makes it possible to offer personalized services according to the user's preference. To extract a large amount of context information, wearable sensor devices become more important in the near future. However,...
Real-time database system must meet time constraints in addition to the integrity constraints. Concurrency control is one of the main issues in the studies of real-time database systems. Traditional concurrency control methods use serializability as the correctness criterion when transactions are executed concurrently. However, strict serializability as the correctness criterion is not always suitable...
It has been common that modern embedded system products are built on platforms with system-on-a-chip (SOC) in which two or more different processor cores are put into one single chip and form the architecture of heterogeneous multiprocessor. Although providing high performance at low cost, such architecture brings new design challenges as well as increased complexity in developing embedded software...
The present paper is focused on hierarchical modeling in monoprocessor real-time systems. In the current scheduling, each system application is isolated through periodic servers. While previous research oriented both local and global schedulers to fixed priorities, this study extends the scheduling to dynamic priorities (EDF). The new analysis consists in obtaining the response time for the worst...
A power-aware optimal processor cycle allocation scheme with consideration of fair quality of service (QoS) guarantee in real-time systems is formulated. Although power-aware resource management using dynamic voltage and frequency scaling techniques can be used to resolve the trade-off between QoS maximization and energy consumption minimization, it is also necessary to ensure fair QoS allocation...
We propose a new execution time prediction method that combines measurement-based execution time analysis and simulation-based memory access analysis. In measurement-based execution time analysis, the target program is divided into basic blocks, to each of which a memory area accessed by the block is allocated, so that all the basic block execution times are measured on a real machine. Since the execution...
In this paper we address the "rate analysis" problem for media-processing platforms consisting of multiple processor cores connected in a pipelined fashion. More precisely, we aim at determining fight bounds on the rates at which multimedia streams can be fed into such architectures. These bounds depend on architectural constraints (e.g. the available on-chip memory, bus arbitration policies,...
This paper considers the problem of preemptive hard real-time scheduling of sporadic graph tasks on a uniprocessor with earliest deadline first (EDF). A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response time of any subtask...
Hierarchical scheduling frameworks have lately received a lot of attention for component-based design of complex real-time systems. The specification of the resource reservation policy play a dominant role in such frameworks. In this context, the notion of real-time virtual resources results a very flexible representation of resource reservation schemes. We intend to combine the advantages offered...
The modeling approach is not used to its full potential in maintenance of legacy systems. Often, models do not even exist. The main reasons being that the economic implications and practical hurdles in manually maintaining models of in-use legacy systems are considered too high by the industry. In this paper, we present a method for automated validation of models automatically generated from recordings...
Procedural abstraction reduces code size by replacing repeated code fragments with call instructions to a subroutine that executes the repeated fragment. However, in order to build a subroutine, extra instructions are necessary to support the procedural call mechanism. In this paper, we present an operating system level technique which improves the space efficiency of a procedural abstraction-based...
Consider the problem of scheduling sporadic message transmission requests with deadlines. For wired channels, this has been achieved successfully using the CAN bus. For wireless channels, researchers have recently proposed a similar solution; a collision-free medium access control (MAC) protocol that implements static-priority scheduling. Unfortunately no implementation has been reported, yet. We...
Hardware/software codesign involves various design problems including system specification, design space exploration, hardware/software co-verification, and system synthesis. A codesign environment is a software tool that facilitates capabilities to solve these design problems. This paper presents the peace codesign environment mainly targeting for multimedia applications with real-time constraints...
In this short paper we illustrate a novel approach that aims to marry reuse-driven and model-driven development principles with engineering considerations of great concern to high-integrity real-time systems, for which the specification of properties to be preserved at run time is paramount
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.