Predictable Software -- A Shortcut to Dependable Computing ?
| dc.creator | Candea, George | |
| dc.date | 2004-03-11 | |
| dc.date.accessioned | 2026-07-07T03:20:59Z | |
| dc.date.available | 2026-07-07T03:20:59Z | |
| dc.description | Many dependability techniques expect certain behaviors from the underlying subsystems and fail in chaotic ways if these expectations are not met. Under expected circumstances, however, software tends to work quite well. This paper suggests that, instead of fixing elusive bugs or rewriting software, we improve the predictability of conditions faced by our programs. This approach might be a cheaper and faster way to improve dependability of software. After identifying some of the common triggers of unpredictability, the paper describes three engineering principles that hold promise in combating unpredictability, suggests a way to benchmark predictability, and outlines a brief research agenda. | |
| dc.description | 6 pages; submitted to 11th ACM SIGOPS European Workshop | |
| dc.identifier | https://arxiv.org/abs/cs/0403013 | |
| dc.identifier | http://arxiv.org/abs/cs/0403013 | |
| dc.identifier | WIP Session, USENIX Technical Conference, Boston, MA, June 2004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32032 | |
| dc.subject | Operating Systems | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | D.4.7 | |
| dc.title | Predictable Software -- A Shortcut to Dependable Computing ? | |
| dc.type | text |