Paper Info
Title
Run-Time Management of Lisp Parallelism and the Hierarchical Task Graph Program Representation
Abstract
This paper suggests how to extend the Hierarchical Task Graph program representation, and its execution model to address the Lisp code parallelization problems. The advantages of this approach lie in the fact of on avoiding to annotate Lisp programs, and in accounting for run-time scheduling policies all into a unified environment. We start by reviewing the problem of run-time parallelism management, first in the imperative languages setting, and, next in Lisp setting. Before describing the Hierarchical Task Graph (HTG) program representation [7], we review the basic notions of control and data dependence analysis. Finally we describe how to modify the HTG and its execution model to take into account for the Lazy Task Creation model [19], and the Sponsor Model for exploiting speculative computations in Lisp[20].
Year
DOI
Venue
1991
10.1007/BFb0038670
LCPC
Keywords
Field
DocType
run-time management,lisp parallelism,hierarchical task graph program,time management
Programming language,Control flow graph,Task parallelism,Computer science,Scheduling (computing),Lisp,Parallel computing,Imperative programming,Theoretical computer science,Time management,Data parallelism,Execution model
Conference
Volume
ISSN
ISBN
589
0302-9743
3-540-55422-X
Citations 
PageRank 
References 
0
0.34
6
Authors
2
Name
Order
Citations
PageRank
Mario Mango Furnari1219.56
Constantine D. Polychronopoulos2893129.02