Parallelism in alpha-beta search

Raphael A. Finkel; John P. Fishburn

doi:10.1016/0004-3702(82)90022-4

Parallelism in alpha-beta search

Raphael A. Finkel, John P. Fishburn

Computer Science

Producción científica: Article › revisión exhaustiva

42 Citas (Scopus)

Resumen

We present a distributed algorithm for implementing α-β search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed operating system are presented. A theoretical model is developed that predicts at least order of k^{1 2} speedup with k processors.

Idioma original	English
Páginas (desde-hasta)	89-106
Número de páginas	18
Publicación	Artificial Intelligence
Volumen	19
N.º	1
DOI	https://doi.org/10.1016/0004-3702(82)90022-4
Estado	Published - sept 1982

Nota bibliográfica

Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

ASJC Scopus subject areas

Language and Linguistics
Linguistics and Language
Artificial Intelligence

Acceder al documento

10.1016/0004-3702(82)90022-4

Otros archivos y enlaces

Citar esto

@article{372309c92b7a4834bf2da69d7c4fed06,

title = "Parallelism in alpha-beta search",

abstract = "We present a distributed algorithm for implementing α-β search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed operating system are presented. A theoretical model is developed that predicts at least order of k 1 2 speedup with k processors.",

author = "Finkel, \{Raphael A.\} and Fishburn, \{John P.\}",

year = "1982",

month = sep,

doi = "10.1016/0004-3702(82)90022-4",

language = "English",

volume = "19",

pages = "89--106",

number = "1",

}

TY - JOUR

T1 - Parallelism in alpha-beta search

AU - Finkel, Raphael A.

AU - Fishburn, John P.

PY - 1982/9

Y1 - 1982/9

N2 - We present a distributed algorithm for implementing α-β search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed operating system are presented. A theoretical model is developed that predicts at least order of k 1 2 speedup with k processors.

AB - We present a distributed algorithm for implementing α-β search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed operating system are presented. A theoretical model is developed that predicts at least order of k 1 2 speedup with k processors.

UR - http://www.scopus.com/inward/record.url?scp=0020179733&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020179733&partnerID=8YFLogxK

U2 - 10.1016/0004-3702(82)90022-4

DO - 10.1016/0004-3702(82)90022-4

M3 - Article

AN - SCOPUS:0020179733

SN - 0004-3702

VL - 19

SP - 89

EP - 106

JO - Artificial Intelligence

JF - Artificial Intelligence

IS - 1

ER -

Parallelism in alpha-beta search

Resumen

Nota bibliográfica

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto