eCommons

 

Discussion of Parallel Algorithms

Other Titles

Abstract

In recent years we have witnessed a tremendous surge in the availability of very fast and inexpensive hardware. However, our ability to design fast and cheap hardware far outstrips our ability to utilize them effectively in solving large problems fast. Hence there is a continuing interest in the study and development of parallel algorithms. In this paper we present a survey of deterministic parallel algorithms for a class of computational problems. Both graph-theoretic and non graph-theoretic problems are considered and the parallel algorithms presented are motivated by identifying some common paradigms.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1986-06

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-759

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record