Results 231 to 240 of about 593,709 (286)

Real-time transaction scheduling

ACM SIGMOD Record, 1993
Real-time databases are an important component of embedded real-time systems. In a real-time database context, transactions must not only maintain the consistency constraints of the database but must also satisfy the timing constraints specified for each transaction.
Hong, D., Chakravarthy, S., Johnson, T.
openaire   +1 more source

Scheduling real-time transactions

ACM Transactions on Database Systems, 1992
This thesis has six chapters. Chapter 1 motivates the thesis by describing the characteristics of real-time database systems and the problems of scheduling transactions with deadlines. We also present a short survey of related work and discuss how this thesis has contributed to the state of the art.
Robert K. Abbott, Hector Garcia-Molina
openaire   +1 more source

Scheduling real-time transactions

ACM SIGMOD Record, 1988
Scheduling transactions with real-time requirements presents many new problems. In this paper we discuss solutions for two of these problems: what is a reasonable method for modeling real-time constraints for database transactions? Traditional hard real-time constraints (e.g., deadlines) may be too limited.
Robert Abbott, Hector Garcia-Molina
openaire   +1 more source

On a Real-Time Scheduling Problem

Operations Research, 1978
We study the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems. A periodic-time-critical task consists of an infinite number of requests, each of which has a prescribed deadline. The scheduling problem is to specify an order in which the requests of a set of tasks are to be executed and the processor to be used ...
Dhall, Sudarshan K., Liu, C. L.
openaire   +2 more sources

Real-time calculus for scheduling hard real-time systems

2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353), 2002
This paper establishes a link between three areas, namely Max-Plus Linear System Theory as used for dealing with certain classes of discrete event systems, Network Calculus for establishing time bounds in communication networks, and real-time scheduling.
L. Thiele, S. Chakraborty, M. Naedele
openaire   +2 more sources

Real-Time Scheduling

2011
Many thousands of research papers have been written about how to schedule a set of tasks in a system with a limited amount of resources such that all tasks will meet their deadlines. This chapter tries to summarize some important results of scheduling research that are relevant to the designer of real-time systems. The chapter starts by introducing the
openaire   +1 more source

Real Time Scheduling Optimization

Journal of Information Technology Research, 2019
This article deals with real time embedded multiprocessor systems scheduling optimization using conventional and quantum inspired genetic algorithms. Real time scheduling problems are known to be NP-hard. In order to resolve it, researchers have resorted to meta-heuristics instead of exact methods.
openaire   +1 more source

Scheduling real-time transactions

Proceedings. EUROMICRO '90 Workshop on Real Time, 2002
Issues associated with transaction scheduling and concurrency control in real-time database systems are addressed. A message-based approach to prototyping study of distributed real-time database systems is introduced, and a prototyping software implemented for a series of experiments is presented.
openaire   +1 more source

Real time scheduling under uncertainty

Proceedings of 1995 IEEE International Conference on Fuzzy Systems. The International Joint Conference of the Fourth IEEE International Conference on Fuzzy Systems and The Second International Fuzzy Engineering Symposium, 2002
Generally, real time scheduling algorithms provide optimal solution when the application context is well known and its behavior completely mastered. But in practice, both the real time constraints and the tasks' characteristics are often imprecisely known. This results in sub-optimal behaviors generating failures that should be avoided.
F. Terrier, L. Rioux, null Ziqiang Chen
openaire   +1 more source

Real-Time System Scheduling

1995
Scheduling theories for fixed priority pre-emptive scheduling are now sufficiently mature that a genuine engineering approach to the construction of hard real-time systems is possible. In this paper we review recent advances. A flexible computational model is adopted that can accommodate periodic and sporadic activities, different levels of criticality,
Neil Audsley, Alan Burns, Rob Davis, Ken Tindell, Andy Wellings   +4 more
openaire   +1 more source