Experimental Results for Four Work-Optimal PRAM Simulation Algorithms on Coated Meshes (1994)
| Citations: | 4 - 4 self |
BibTeX
@MISC{Leppänen94experimentalresults,
author = {Ville Leppänen},
title = {Experimental Results for Four Work-Optimal PRAM Simulation Algorithms on Coated Meshes},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we consider the effect of overloading in four work-optimal PRAM simulation algorithms on coated meshes with P real processors. A coated mesh consists of a mesh connected routing machinery, and processor&memory pairs, which form a coat on the routing machinery. Previously work-optimal PRAM simulations, which ignore the effect of overloading, has been presented for coated meshes, but their cost is relatively high (around 100). The algorithms we study here are based on greedy routing, sorting, improved virtual levelled network technique, and combining queues method. Our results show that overloading alone can be used to improve the simulation cost of all PRAM models on coated meshes to circa 10 (and even less) routing steps per P simulated PRAM processors. 1 Introduction In [13] three algorithms for simulating PRAM models on coated meshes were presented (see also [15, 16]). The EREW PRAM simulation algorithm was based on a modification of the basic greedy routing algorithm ...
