|
Descripción
|
|
|---|---|
| We consider the problem of supporting goal-level, independent and- parallelism (IAP) in the presence of non-determinism. IAP is exploited when two or more goals which will not interfere at run time are scheduled for simultaneous execution. Backtracking over non-deterministic parallel goals runs into the well- known trapped goal and garbage slot problems. The proposed solutions for these problems generally require complex low-level machinery which makes systems difficult to maintain and extend, and in some cases can even affect sequential ex- ecution performance. In this paper we propose a novel solution to the problem of trapped nondeterministic goals and garbage slots which is based on a single stack reordering operation and offers several advantages over previous proposals. While the implementation of this operation itself is not simple, in return it does not im- pose constraints on the scheduler. As a result, the scheduler and the rest of the run-time machinery can safely ignore the trapped goal and garbage slot problems and their implementation is greatly simplified. Also, standard sequential execu- tion remains unaffected. In addition to describing the solution we report on an implementation and provide performance results. We also suggest other possible applications of the proposed approach beyond parallel execution. | |
|
Internacional
|
Si |
|
Nombre congreso
|
Practical Aspects of Declarative Languages |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Philadelphia, PA, USA |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-3-642-27693-4 |
|
DOI
|
10.1007/978-3-642-27694-1_11 |
|
Fecha inicio congreso
|
23/01/2012 |
|
Fecha fin congreso
|
24/01/2012 |
|
Desde la página
|
138 |
|
Hasta la página
|
152 |
|
Título de las actas
|
Practical Aspects of Declarative Languages - 14th International Symposium, PADL 2012, Philadelphia, PA, USA, January 23-24, 2012. Proceedings |