๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Atomic Objects for Real-Time Distributed Systems with Mixed Time Constraints

โœ Scribed by P.D.V. van der Stok

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
372 KB
Volume
36
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

Two types of applications are considered: hard real-time (HRT) and soft real-time (SRT). HRT applications need to meet their deadlines under all circumstances; deadlines of SRT applications may occasionally be missed. Both applications are constructed from objects. HRT and SRT applications coexist on the same set of processors and share objects to allow a consistent exchange of data via transactions. Several concurrency control algorithms exist to assure consistent transaction results in distributed database systems. The addition of versions to objects can diminish the execution time of read-only transactions and increases the number of permitted interleavings of concurrently executing transactions. Imposing two different orderings, one for read-only transactions and one for all other transactions, the wait-time of read-only transactions is considerably reduced. Small delays increase the probability that SRT deadlines are met or a design is reached in which all HRT requirements are met. The interleaving of HRT-and SRTtransactions is severely reduced when SRT-transactions are not allowed to perturb HRT-transactions. The here-defined transfer-serializability criterion permits the interleaving of HRT-and SRT-transactions.

๐Ÿ“œ SIMILAR VOLUMES

An efficient scheduling algorithm for di
An efficient scheduling algorithm for distributed real-time systems with end-to-end timing constraints
โœ Atsushi Togawa; Eiji Okubo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method

Markov models for time series with mixed
Markov models for time series with mixed distribution
โœ Gary K. Grunwald; Richard H. Jones ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 161 KB ๐Ÿ‘ 2 views

We consider modelling time series of amounts which may be zero using a stochastic ยฎrst-order Markov model with mixed transition density having a discrete component at 0 and a continuous component describing non-zero amounts. The models extend chain-dependent stochastic models in the literature on mo

Non-Archimedean models of mixingโ€”I. Resi
Non-Archimedean models of mixingโ€”I. Residence time distribution for systems with imperfect mixing
โœ Octavian Iordache; Raluca Isopescu; Alexandru Isopescu; Anca Iacobini; Gheorghiลฃ ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 470 KB

Residence time distributions in flow systems which exhibit randomness on many scales of time are studied here. A non-Archimedean framework of the mixing process was proposed. An expansion where the first term correspond to perfect mixing while the following terms are corrections for imperfect mixing