|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Leon Alkalaj, Tomás Lang, Milos D. Ercegovac, "Architectural Support for Goal Management in Flat Concurrent Prolog," Computer, vol. 25, no. 8, pp. 34-47, August, 1992. | |||
| BibTex | x | ||
| @article{ 10.1109/2.153282, author = {Leon Alkalaj and Tomás Lang and Milos D. Ercegovac}, title = {Architectural Support for Goal Management in Flat Concurrent Prolog}, journal ={Computer}, volume = {25}, number = {8}, issn = {0018-9162}, year = {1992}, pages = {34-47}, doi = {http://doi.ieeecomputersociety.org/10.1109/2.153282}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computer TI - Architectural Support for Goal Management in Flat Concurrent Prolog IS - 8 SN - 0018-9162 SP34 EP47 EPD - 34-47 A1 - Leon Alkalaj, A1 - Tomás Lang, A1 - Milos D. Ercegovac, PY - 1992 VL - 25 JA - Computer ER - | |||
A special-purpose architectural support that reduces the goal-management execution time in flat concurrent Prolog (FCP) is described. The architectural support consists of a dedicated goal-management unit that executes high-level goal-management operations concurrently with goal-reduction operations. The efficient execution of goal-management instructions is realized using a goal cache that stores recently spawned goals. It is shown that operations such as goal-switching, spawning, and halting are efficiently performed by changing their status in the goal cache. More complex operations, such as goal suspension and activation are decoupled from goal reduction by using two suspension tables and activation queues. Using an analytic performance model, it is shown that, for the systems development workload, which consists of large FCP programs, the overhead of software-implemented goal management is 50% of the program execution time. This is reduced up to 3% using the goal-management unit and the goal cache, resulting in a speedup of almost 2. The results are generalized for other workloads that exhibit different goal-management complexities.

