Overview

Excerpt from Parallel Merge Sort We give a parallel implementation of merge sort on a crew pram that uses 11 processors and O(logn) time; the constant in the running time is small. We also give a more complex version of the algorithm for the erew pram; it also uses n processors and O(logn) time. The constant in the running time is still moderate, though not as small. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Full Product Details

9781334538049

Table of Contents

Reviews

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available