2,514 research outputs found
The Cost of Address Translation
Modern computers are not random access machines (RAMs). They have a memory
hierarchy, multiple cores, and virtual memory. In this paper, we address the
computational cost of address translation in virtual memory. Starting point for
our work 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.Comment: A extended abstract of this paper was published in the proceedings of
ALENEX13, New Orleans, US
Decolonizing Information Narratives: Entangled Apocalyptics, Algorithmic Racism and the Myths of History
In what follows, some contemporary narratives about ‘the information society’ are interrogated from critical race theoretical and decolonial perspectives with a view to constructing a ‘counter-narrative’ purporting to demonstrate the embeddedness of coloniality—that is, the persistent operation of colonial logics—in such discourses
Approximate Minimum Diameter
We study the minimum diameter problem for a set of inexact points. By
inexact, we mean that the precise location of the points is not known. Instead,
the location of each point is restricted to a contineus region (\impre model)
or a finite set of points (\indec model). Given a set of inexact points in
one of \impre or \indec models, we wish to provide a lower-bound on the
diameter of the real points.
In the first part of the paper, we focus on \indec model. We present an
time
approximation algorithm of factor for finding minimum diameter
of a set of points in dimensions. This improves the previously proposed
algorithms for this problem substantially.
Next, we consider the problem in \impre model. In -dimensional space, we
propose a polynomial time -approximation algorithm. In addition, for
, we define the notion of -separability and use our algorithm for
\indec model to obtain -approximation algorithm for a set of
-separable regions in time
- …