An annotated bibliography on real-time database systems
ACM SIGMOD Record
Escalations in workflow management systems
CIKM '96 Proceedings of the workshop on Databases: active and real-time
A Study of Concurrency Control in Real-Time, Active Database Systems
IEEE Transactions on Knowledge and Data Engineering
BeeHive: Global Multimedia Database Support for Dependable, Real-Time Applications
ARTDB '97 Proceedings of the Second International Workshop on Active, Real-Time, and Temporal Database Systems
Priority assignment in real-time active databases
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed real time database systems: background and literature review
Distributed and Parallel Databases
Hi-index | 0.01 |
Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Comparing to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated.