Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF D1 Publications :: Thesis :: Jurkiewicz, Tomasz

MPI-INF D1 Publications
Show all entries of:this year (2020)last year (2019)two years ago (2018)Open in Notes
Action:login to update  Library locked

Thesis - Doctoral dissertation | @PhdThesis | Doktorarbeit

Author(s)*:Jurkiewicz, Tomasz
BibTeX citekey*:Jurkiewicz2013

Title, School
Title*:Toward Better Computation Models for Modern Machines
School:Universität des Saarlandes
Type of Thesis*:Doctoral dissertation

Note, Abstract, Copyright
LaTeX Abstract:Modern computers are not random access machines (RAMs).

They have a memory hierarchy, multiple cores, and a virtual memory.
We address the computational cost of the address translation in the virtual memory and difficulties in design of parallel algorithms on modern many-core machines.

Starting point for our work on virtual memory is the observation that the analysis of some simple algorithms (random scan of an array, binary search, heapsort) in either the RAM model or the EM model (external memory model) does not correctly predict growth rates of actual running times.
We propose the VAT model (virtual address translation) to account for the cost of address translations and analyze the algorithms mentioned above and others in the model.
The predictions agree with the measurements.
We also analyze the VAT-cost of cache-oblivious algorithms.

In the second part of the paper we present a case study of the design of an efficient 2D convex hull algorithm for GPUs.
The algorithm is based on \emph{the ultimate planar convex hull algorithm} of Kirkpatrick and Seidel, and it has been referred to as \emph{the first successful implementation of the QuickHull algorithm on the GPU} by Gao et al. in their 2012 paper on the 3D convex hull.
Our motivation for work on modern many-core machines is the general belief of the engineering community that the theory does not produce applicable results, and that the theoretical researchers are not aware of the difficulties that arise while adapting algorithms for practical use.
We concentrate on showing how the high degree of parallelism available on GPUs can be applied to problems that do not readily decompose into many independent tasks.

Keywords:mathematics, computer science, convex hull, multicore algorithms, parallel algorithms, external memory, CUDA, GPGPU, sorting lower bound, virtual address translation
HyperLinks / References / URLs:
Download Access Level:Public
Download File(s):View attachments here:

Referees, Status, Dates
1. Referee:Prof. Dr. Ulrich Meyer Institute for Computer Science Goethe University Frankfurt am Main, Germany
2. Referee:Prof. Dr. Sandeep Sen Department of Computer Science & Engineering Indian Institute of Technology, Delhi, India
Supervisor:Prof. Dr. Dr. h.c. mult. Kurt Mehlhorn Max Planck Institute for Informatics, Saarbrücken, Germany
Date Kolloquium:30 October 2013
Chair Kolloquium:Prof. Dr. Dr. h.c. Wolfgang J. Paul, Saarland University, Saarbrücken, Germany

MPG Unit:Max-Planck-Institut für Informatik
MPG Subunit:Algorithms and Complexity Group
Audience:experts only
Appearance:MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:
AUTHOR = {Jurkiewicz, Tomasz},
TITLE = {Toward Better Computation Models for Modern Machines},
SCHOOL = {Universit{\"a}t des Saarlandes},
YEAR = {2013},
TYPE = {Doctoral dissertation}
MONTH = {April},

Entry last modified by Tomasz Jurkiewicz, 03/26/2014
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

03/07/2014 11:34:22 PM

Tomasz Jurkiewicz

Edit Date
2014-03-07 23:34:22