Task Frames
| dc.creator | Steinmacher-Burow, Burkhard D. | |
| dc.date | 2000-04-19 | |
| dc.date.accessioned | 2026-07-07T03:16:10Z | |
| dc.date.available | 2026-07-07T03:16:10Z | |
| dc.description | Forty years ago Dijkstra introduced the current conventional execution of routines. It places activation frames onto a stack. Each frame is the internal state of an executing routine. The resulting application execution is not easily helped by an external system. This presentation proposes an alternative execution of routines. It places task frames onto the stack. A task frame is the call of a routine to be executed. The feasibility of the alternative execution is demonstrated by a crude implementation. As described elsewhere, an application which executes in terms of tasks can be provided by an external system with a transparent reliable, distributed, heterogeneous, adaptive, dynamic, real-time, parallel, secure or other execution. By extending the crude implementation, this presentation outlines a simple transparent parallel execution. | |
| dc.identifier | https://arxiv.org/abs/cs/0004011 | |
| dc.identifier | http://arxiv.org/abs/cs/0004011 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30248 | |
| dc.subject | Programming Languages | |
| dc.subject | D.3.3;D.3.4 | |
| dc.title | Task Frames | |
| dc.type | text |