A Higher Order Parallel Abstraction for Fixed Degree Divide and Conquer Problem Solving Strategy

Mohan, TS and Ganesan, VS (1990) A Higher Order Parallel Abstraction for Fixed Degree Divide and Conquer Problem Solving Strategy. In: ACE '90 (XVI Annual Convention and Exhibition of the IEEE In India), 22-25 January, Bangalore,India, pp. 217-221.

Preview

PDF a_higher_order_parallel.pdf Download (419kB)

Abstract

In this paper, we present, an algorithmic frame work for the Fixed Degree Divide & Conqrrer(FDDC) problem solving strategy, that adapts the divide and conquer algorithm for parallel computations. We capture the notion of a thread of execution in a:) sc-tive task object which are instances of a data type called the tasktype and propose a higher order tasking abstraction called maptask till that takes as its arguments, a tasktype, the (fixed) degree of the runtime task hierarchy and the arguments for the tasks. We have implemented the above abstraction by extending C with task-type and maptask in a package called the CT Kernel that currently executes tasks in a distributed environment consisting of 10 networked VAXstations. Using the above abstractions we have implemented the FDDC algoritlims for merge!ort, FFT, Cubic spline bmed curve fitting, Fractals, Matxix multiplication, as well as Iterative relaxation.

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 Electrical Sciences > Computer Science & Automation
Date Deposited:	30 May 2006
Last Modified:	19 Sep 2010 04:27
URI:	http://eprints.iisc.ac.in/id/eprint/6946

Actions (login required)

View Item