This paper describes the new features of the distributed theorem prover Peers-mcd.d for equational logic. They include parallel-search plans that combine distributed search (i.e., the search space is subdivided among the parallel processes) and multi-search (i.e., the processes employ different search plans). Experiments comparing the behavior of different control strategies on the Moufang identities are reported, including instances of super-linear speed-up due to parallel search.
Combination of distributed search and multi-search in Peers-mcd.d
BONACINA, Maria Paola
2001-01-01
Abstract
This paper describes the new features of the distributed theorem prover Peers-mcd.d for equational logic. They include parallel-search plans that combine distributed search (i.e., the search space is subdivided among the parallel processes) and multi-search (i.e., the processes employ different search plans). Experiments comparing the behavior of different control strategies on the Moufang identities are reported, including instances of super-linear speed-up due to parallel search.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
IJCAR2001peersmcdd.pdf
accesso aperto
Descrizione: Articolo
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
91.13 kB
Formato
Adobe PDF
|
91.13 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
