Search
Results
-
Main-Memory Hash Joins on Multi-Core CPUs
(2012)Technical Report / ETH Zurich, Department of Computer ScienceThe architectural changes introduced with multicore CPUs have triggered a redesign of main-memory join algorithms. In the last few years, two diverging views have appeared. One approach advocates careful tailoring of the algorithm to the architectural parameters (cache sizes, TLB, and memory bandwidth). The other approach argues that modern hardware is good enough at hiding cache and TLB miss latencies and, consequently, the careful ...Report -
Scalapack's MRRR Algorithm
(2012)Technical Report / ETH Zurich, Department of Computer ScienceReport -
Preconditioning aspects of large scale micro finite element analysis of 3D bone poroelasticity
(2012)Technical Report / ETH Zurich, Department of Computer ScienceIn this paper, a solver for poroelasticity problems is discussed that is related to osteoporotic human bones. Osteoporosis is a major health problem that compromises the integrity of bones. A good understanding of the disease requires an accurate simulation of the physics. For that purpose, a finite element solver based on Biot's consolidation has been developed. A mixed formulation is used to discretize the geometries taken from medical ...Report -
Crowdsourcing Entity Resolution
(2012)Technical Report / ETH Zurich, Department of Computer ScienceThere are several computational tasks for which the help of people is useful. One such task is entity resolution. For this task, human experts can help to identify whether two customers are identical given their profile. Since crowdsourcing is expensive, the goal is to ask as few questions as possible. At the same time, high quality results can only be achieved if several experts are asked for their opinion and for confirmation. This paper ...Report -
Corner Cuts are Close to Optimal
(2012)Technical Report / ETH Zurich, Department of Computer ScienceWe study the solution quality for min-cut problems on graphs when restricting the shapes of the allowed cuts. In particular we are interested in min-cut problems with additional size constraints on the parts being cut out from the graph. Such problems include the bisection problem, separator problem, or the sparsest cut problem. We therefore aim at cutting out a given number m of vertices from a graph using as few edges as possible. We ...Report -
Zur Detektion von Betonstahlbrüchen mit der magnetischen Streufeldmethode
(2012)IBK BerichtReport