@inproceedings{DoebbelinSchuettReinefeld2012, author = {D{\"o}bbelin, Robert and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {An Analysis of SMP Memory Allocators}, series = {Proceedings of the 41st International Conference on Parallel Processing Workshops (Fifth International Workshop on Parallel Programming Models and Systems Software for High-End Computing (P2S2))}, booktitle = {Proceedings of the 41st International Conference on Parallel Processing Workshops (Fifth International Workshop on Parallel Programming Models and Systems Software for High-End Computing (P2S2))}, publisher = {IEEE Computer Society}, doi = {10.1109/ICPPW.2012.10}, pages = {48 -- 54}, year = {2012}, language = {en} } @inproceedings{DoebbelinSchuettReinefeld2013, author = {D{\"o}bbelin, Robert and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {Building Large Compressed PDBs for the Sliding Tile Puzzle}, series = {Workshop on Computer Games}, booktitle = {Workshop on Computer Games}, year = {2013}, language = {en} } @misc{DoebbelinSchuettReinefeld, author = {D{\"o}bbelin, Robert and Sch{\"u}tt, Thorsten and Reinefeld, Alexander}, title = {Building Large Compressed PDBs for the Sliding Tile Puzzle}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-18095}, abstract = {The performance of heuristic search algorithms depends crucially on the effectiveness of the heuristic. A pattern database (PDB) is a powerful heuristic in the form of a pre-computed lookup table. Larger PDBs provide better bounds and thus allow more cut-offs in the search process. Today, the largest PDB for the 24-puzzle is a 6-6-6-6 PDB with a size of 486 MB. We created 8-8-8, 9-8-7 and 9-9-6 PDBs that are three orders of magnitude larger (up to 1.4 TB) than the 6-6-6-6 PDB. We show how to compute such large PDBs and we present statistical and empirical data on their efficiency. The largest single PDB gives on average an 8-fold improvement over the 6-6-6-6 PDB. Combining several large PDBs gives on average an 12-fold improvement.}, language = {en} } @inproceedings{ReinefeldSchuettDoebbelin2010, author = {Reinefeld, Alexander and Sch{\"u}tt, Thorsten and D{\"o}bbelin, Robert}, title = {Very large pattern databases for heuristic search}, series = {HPDC}, booktitle = {HPDC}, editor = {Hariri, Salim and Keahey, Kate}, publisher = {ACM}, doi = {10.1145/1851476.1851592}, pages = {803 -- 809}, year = {2010}, language = {en} } @article{ReinefeldSchuettDoebbelin, author = {Reinefeld, Alexander and Sch{\"u}tt, Thorsten and D{\"o}bbelin, Robert}, title = {Analyzing the performance of SMP memory allocators with iterative MapReduce applications}, series = {Parallel Computing}, volume = {39}, journal = {Parallel Computing}, number = {12}, publisher = {Elsevier}, doi = {10.1016/j.parco.2013.09.007}, pages = {879 -- 889}, language = {en} } @inproceedings{SchuettDoebbelinReinefeld2013, author = {Sch{\"u}tt, Thorsten and D{\"o}bbelin, Robert and Reinefeld, Alexander}, title = {Forward Perimeter Search with Controlled Use of Memory}, series = {International Joint Conference on Artificial Intelligence, IJCAI-13, Beijing}, booktitle = {International Joint Conference on Artificial Intelligence, IJCAI-13, Beijing}, year = {2013}, language = {en} } @article{SchuettReinefeldDoebbelin, author = {Sch{\"u}tt, Thorsten and Reinefeld, Alexander and D{\"o}bbelin, Robert}, title = {MR-search: massively parallel heuristic search}, series = {Concurrency and Computation: Practice and Experience}, volume = {25}, journal = {Concurrency and Computation: Practice and Experience}, number = {1}, doi = {10.1002/cpe.1833}, pages = {40 -- 54}, language = {en} }