Sciweavers

19 search results - page 2 / 4
» rtcsa 2000
Sort
View
RTCSA
2000
IEEE
13 years 8 months ago
Extracting safe and precise control flow from binaries
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
Henrik Theiling
RTCSA
2000
IEEE
13 years 8 months ago
Tracking Real-Time Systems Requirements
One of the hard problems in maintaining real-time systems requirements is to keep track of the impact of resource usage on the applications. Often times, it is not sufficient to ...
Aloysius K. Mok
RTCSA
2000
IEEE
13 years 8 months ago
Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than...
Björn Andersson, Jan Jonsson
RTCSA
2000
IEEE
13 years 8 months ago
Extensions to optimistic concurrency control with time intervals
Although an optimistic approach has been shown to be better suited than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and h...
Jan Lindström
RTCSA
2000
IEEE
13 years 8 months ago
Using importance of transactions and optimistic concurrency control in firm real-time databases
In a real-time database system, it is difficult to meet all timing constraints due to the consistency requirements of the underlying database. However, when the transactions in t...
Jan Lindström, Kimmo E. E. Raatikainen