Dissemin is shutting down on January 1st, 2025

Published in

Springer, Lecture Notes in Computer Science, p. 899-908, 1999

DOI: 10.1007/3-540-48311-x_125

Links

Tools

Export citation

Search in Google Scholar

DAOS — Scalable And-Or Parallelism

Journal article published in 1998 by LuísFernando F. Castro, Vítor Santos Costa ORCID, Cláudio F. R. Geyer, Fernando M. A. Silva ORCID, Patrícia Kayser Vargas, Manuel Eduardo Correia
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

This paper presents DAOS, a model for exploitation of And-and Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically shared address space. Exploiting both major forms of implicit parallelism should serve a broadest range of applications. Besides, a model that uses a distributed memory environment provides scalability and can be implemented over a computer network. However, distributed implementations of logic programs have to deal with communication overhead and inherent complexity of distributed memory managent. DAOS overcomes those problems through the use of a distributed shared memory layer to provide single-writer, multiple-readers sharing for the main execution stacks combined with explicit message passing for work distribution and management.