ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An Efficient Algorithm for the Nearest Smallers Problem on Distributed Shared Memory Systems with Applications

Graf, T and Kamakoti, V and Balakrishnan, N (1997) An Efficient Algorithm for the Nearest Smallers Problem on Distributed Shared Memory Systems with Applications. In: High-Performance Computing on the Information Superhighway, HPC-Asia '97, April 28 - May 02, 1997, Seoul, Korea, pp. 367-372.

[img]
Preview
PDF
AN_EFFICIENT_ALGORITHM_FOR_THE_NEAREST_SMALLERS.pdf

Download (461Kb)

Abstract

We present a simple and efficient algorithm for the nearest smallers problem (NSP), [l]) on a distributed shared memory (DSM) system with applications to problems from diverse areas. We adopt the block distributed memory (BDM) model of computation as described an [2]. To the best of our knowledge this is the first known algorithm for the NSP on DSM systems. Since the NSP is fundamental in many problems, a solution for it on DSM systems implies DSM-based solutions for a variety of problems in diverse areas as discussed in this paper. Parallel algorithms known so far for the NSP are based on shared memory systems [l] and are therefore less scalable than our algorithm

Item Type: Conference Paper
Additional Information: ©1997 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.
Keywords: Shared memory systems;
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 12 Jul 2004
Last Modified: 15 Apr 2011 10:46
URI: http://eprints.iisc.ernet.in/id/eprint/994

Actions (login required)

View Item View Item