TY - CHAP A1 - Döbbelin, Robert A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - An Analysis of SMP Memory Allocators T2 - 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)) Y1 - 2012 U6 - https://doi.org/10.1109/ICPPW.2012.10 SP - 48 EP - 54 PB - IEEE Computer Society ER - TY - CHAP A1 - Reinefeld, Alexander A1 - Schütt, Thorsten A1 - Döbbelin, Robert ED - Hariri, Salim ED - Keahey, Kate T1 - Very large pattern databases for heuristic search T2 - HPDC Y1 - 2010 U6 - https://doi.org/10.1145/1851476.1851592 SP - 803 EP - 809 PB - ACM ER - TY - CHAP A1 - Schütt, Thorsten A1 - Döbbelin, Robert A1 - Reinefeld, Alexander T1 - Forward Perimeter Search with Controlled Use of Memory T2 - International Joint Conference on Artificial Intelligence, IJCAI-13, Beijing Y1 - 2013 ER - TY - JOUR A1 - Schütt, Thorsten A1 - Reinefeld, Alexander A1 - Döbbelin, Robert T1 - MR-search: massively parallel heuristic search JF - Concurrency and Computation: Practice and Experience Y1 - 2011 U6 - https://doi.org/10.1002/cpe.1833 VL - 25 IS - 1 SP - 40 EP - 54 ER - TY - JOUR A1 - Reinefeld, Alexander A1 - Schütt, Thorsten A1 - Döbbelin, Robert T1 - Analyzing the performance of SMP memory allocators with iterative MapReduce applications JF - Parallel Computing Y1 - 2013 U6 - https://doi.org/10.1016/j.parco.2013.09.007 VL - 39 IS - 12 SP - 879 EP - 889 PB - Elsevier ER - TY - CHAP A1 - Döbbelin, Robert A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - Building Large Compressed PDBs for the Sliding Tile Puzzle T2 - Workshop on Computer Games Y1 - 2013 ER - TY - GEN A1 - Döbbelin, Robert A1 - Schütt, Thorsten A1 - Reinefeld, Alexander T1 - Building Large Compressed PDBs for the Sliding Tile Puzzle N2 - 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. T3 - ZIB-Report - 13-21 KW - heuristic search KW - pattern databases Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18095 SN - 1438-0064 ER -