ZRAM
The parallel search bench ZRAM and its applications Distributed and parallel computation is, on the one hand, the cheapest way to increase raw computing power. Turning parallelism into a useful tool for solving new problems, on the other hand, presents formidable challenges to computer science. We believe that parallel computation will spread among general users mostly through the ready availability of convenient and powerful program libraries. In contrast to general-purpose languages, a program library is specialized towards a well-defined class of problems and algorithms. This narrow focus permits developers to optimize algorithms, once and for all, for parallel computers of a variety of common architectures. This paper presents ZRAM, a portable parallel library of exhaustive search algorithms, as a case study that proves the feasibility of achieving simultaneously the goals of portability, efficiency, and convenience of use. Examples of massive computations successfully performed with the help of ZRAM illustrate its capabilities and use
Keywords for this software
References in zbMATH (referenced in 36 articles , 1 standard article )
Showing results 1 to 20 of 36.
Sorted by year (- Demaine, Erik D.; Rudoy, Mikhail: A simple proof that the $(n^2 - 1)$-puzzle is hard (2018)
- Jordan, Charles; Joswig, Michael; Kastner, Lars: Parallel enumeration of triangulations (2018)
- Herrera, Juan F. R.; Salmerón, José M. G.; Hendrix, Eligius M. T.; Asenjo, Rafael; Casado, Leocadio G.: On parallel branch and bound frameworks for global optimization (2017)
- de Klerk, E.; Sotirov, R.; Truetsch, U.: A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives (2015)
- Avis, David; Roumanis, Gary: A portable parallel implementation of the $lrs$ vertex enumeration code (2013)
- Matsumoto, Yoshitake; Moriyama, Sonoko; Imai, Hiroshi; Bremner, David: Matroid enumeration for incidence geometry (2012)
- Zhang, Huizhen; Beltran-Royo, Cesar; Constantino, Miguel: Effective formulation reductions for the quadratic assignment problem (2010)
- Demaine, Erik D.; Hearn, Robert A.: Playing games with algorithms: algorithmic combinatorial game theory (2009)
- Geyer, Tobias; Torrisi, Fabio D.; Morari, Manfred: Optimal complexity reduction of polyhedral piecewise affine systems (2008)
- Erdoğan, Güneş; Tansel, Barbaros: A branch-and-cut algorithm for quadratic assignment problems based on linearizations (2007)
- Loiola, Eliane Maria; De Abreu, Nair Maria Maia; Boaventura-Netto, Paulo Oswaldo; Hahn, Peter; Querido, Tania: A survey for the quadratic assignment problem (2007)
- Nehi, Hassan Mishmast; Gelareh, Shahin: A survey of meta-heuristic solution methods for the quadratic assignment problem (2007)
- Cornuéjols, Gérard; Karamanov, Miroslav; Li, Yanjun: Early estimates of the size of branch-and-bound trees (2006)
- Kaski, Petteri; Östergård, Patric R. J.: Classification algorithms for codes and designs (2006)
- Verdiell, A.; Sabatini, M.; Maciel, M. C.; Rodriguez Iglesias, R. M.: A mathematical model for zoning of protected natural areas (2005)
- Fedjki, Chawki A.; Duffuaa, Salih O.: An extreme point algorithm for a local minimum solution to the quadratic assignment problem (2004)
- Anstreicher, Kurt M.: Recent advances in the solution of quadratic assignment problems (2003)
- Barvinok, Alexander; Stephen, Tamon: The distribution of values in the quadratic assignment problem. (2003)
- Anstreicher, Kurt; Brixius, Nathan; Goux, Jean-Pierre; Linderoth, Jeff: Solving large quadratic assignment problems on computational grids (2002)
- Sanders, Peter: Randomized receiver initiated load-balancing algorithms for tree-shaped computations (2002)