Efficient Algorithms for Prefix and General Prefix Computations on Distributed Shared Memory Systems with Applications

Kamakoti, V and Balakrishnan, N (1997) Efficient Algorithms for Prefix and General Prefix Computations on Distributed Shared Memory Systems with Applications. In: 1997 International Conference on Parallel and Distributed Systems, 10-13 December, Seoul,Korea, 44 -51.

Preview

PDF efficient.pdf Download (814kB)

Abstract

The paper presents efficient scalable algorithms for performing prefix (PC) and general prefix (GPC) computations on a distributed shared memory, (DSM) system with applications.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	21 Apr 2006
Last Modified:	19 Sep 2010 04:25
URI:	http://eprints.iisc.ac.in/id/eprint/6404

Actions (login required)

View Item