MR-search: massively parallel heuristic search

SUMMARY MR‐Search is a framework for massively parallel heuristic search. Based on the MapReduce paradigm, it efficiently utilizes all available resources: processors, memories, and disks. MR‐Search uses OpenMP on shared memory systems, Message Passing Interface on clusters with distributed memory,...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 25; no. 1; pp. 40 - 54
Main Authors:	Schütt, Thorsten, Reinefeld, Alexander, Maier, Robert
Format:	Journal Article
Language:	English
Published:	Blackwell Publishing Ltd 01.01.2013
Subjects:	heuristic search parallel graph algorithms scalable algorithms
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!