Many researchers have been trying to use the implicit parallelism of logic lan- guages parallelizing the execution of independent clauses. However this approach has the disadvantage of requiring a heavy overhead for processes scheduling and synchronizing, for data migration and for collecting the results. In this paper it is proposed a different approach, the data parallel one. The focus is on large collections of data and the core idea is to parallelize the execution of element- wise operations. The target language is SEL, a Subset Equational Language. An abstract machine for it, the SAM (Subset Abstract Machine), is outlined, which, under certain points of views, belongs to the WAM family. The data parallel structure of the SAM and of its instruction set is here explained and some exam- ples of how it works are given. Eventually some conclusions are drawn and it is presented the plan for the future research.

The Design of an Abstract Machine for Subset Equational Languages / Succi G; Marino G. - STAMPA. - (1992), pp. 143-155. (Intervento presentato al convegno Proceedings of the 1992 European Workshop on Parallel Computing tenutosi a Barcelona, Spain nel March, 1992).

The Design of an Abstract Machine for Subset Equational Languages

Succi G;
1992

Abstract

Many researchers have been trying to use the implicit parallelism of logic lan- guages parallelizing the execution of independent clauses. However this approach has the disadvantage of requiring a heavy overhead for processes scheduling and synchronizing, for data migration and for collecting the results. In this paper it is proposed a different approach, the data parallel one. The focus is on large collections of data and the core idea is to parallelize the execution of element- wise operations. The target language is SEL, a Subset Equational Language. An abstract machine for it, the SAM (Subset Abstract Machine), is outlined, which, under certain points of views, belongs to the WAM family. The data parallel structure of the SAM and of its instruction set is here explained and some exam- ples of how it works are given. Eventually some conclusions are drawn and it is presented the plan for the future research.
1992
Proceedings of the 1992 European Workshop on Parallel Computing
143
155
The Design of an Abstract Machine for Subset Equational Languages / Succi G; Marino G. - STAMPA. - (1992), pp. 143-155. (Intervento presentato al convegno Proceedings of the 1992 European Workshop on Parallel Computing tenutosi a Barcelona, Spain nel March, 1992).
Succi G; Marino G
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/892611
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact