Determining the worst-case blocking sequences for distributed real-time programs.
Horst F. WeddeBogdan KorelPublished in: RTS (1994)
Keyphrases
- real time
- worst case
- distributed systems
- distributed environment
- hidden markov models
- low cost
- average case
- control system
- np hard
- data acquisition
- lightweight
- mobile agents
- distributed stream processing
- distributed data
- fault tolerant
- lower bound
- databases
- response time
- quality of service
- multi class
- sequential patterns
- mobile robot
- greedy algorithm
- answer sets
- computational complexity
- computer programs
- web services
- sequence alignment
- long sequences
- event processing
- autonomous mobile