Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …

Can a parallel computer with n processors solve a computational problem more than n times
faster than a sequential computer? Can it solve it more than n times better? New …

We show that within the paradigm of real time computation, some classes of problems have
the property that a solution to a problem in the class, when computed in parallel, is far …

Traditionally, interest in parallel computation centered around the speedup provided by
parallel algorithms over their sequential counterparts. In this paper, we ask a different type of …

With the expanding role of computers in society, some assumptions underlying well known
theorems in the theory of parallel computation no longer hold universally. In particular, the …

The studies of the classical cops and robber problem are generally aimed at determining the
minimum number of cops needed to capture the robber, and proposing algorithms for the …

The primary purpose of parallel computation is the fast execution of computational tasks that
are too slow to perform sequentially. However, it was shown recently that a second equally …

II. The Design of Efficient Parallel Algorithms Page 1 II. The Design of Efficient Parallel
Algorithms Selim G. Akl Queen's University, Canada 1. Introduction …

This paper is a contribution to the classical cops and robber problem on a graph, directed to
two-dimensional grids and toroidal grids. These studies are generally aimed at determining …

For pt. II see Technical Report No. 99-423, Dept. of Comput. and Inf. Sci., Queen's University,
Kingston, Ontario, May 1999. Parallel computers can do more than simply speed up …