King, Andy and Bryans, Jeremy (1998) Using Probability to Reason about Soft Deadlines. Technical report. University of Kent
| Other (zip) | ||
|
Download (45Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/other.png) |
|
| Postscript | ||
|
Download (108Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
|
Download (130Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
Abstract
Soft deadlines are significant in systems in which a bound on the response time is important, but the failure to meet the response time is not a disaster. Soft deadlines occur, for example, in telephony and switching networks. We investigate how to put probabilistic bounds on the time-complexity of a concurrent logic program by combining (on-line) profiling with an (off-line) probabilistic complexity analysis. The profiling collects information on the likelihood of case selection and the analysis uses this information to infer the probability of an agent terminating within k steps. Although the approach does not reason about synchronization, we believe that its simplicity and good (essentially quadratic) complexity mean that it is a promising first step in reasoning about soft deadlines.
| Item Type: | Monograph (Technical report) |
|---|---|
| Additional information: | Presented at the International Workshop on Constraint Programming for Time Critical Applications and Multi-Agent Systems, Nice, France |
| Uncontrolled keywords: | deadlines, agents, profiling, termination. |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 22 Aug 2009 23:22 |
| Last Modified: | 06 Sep 2011 04:00 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21616 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
