Advertisement

Diamond Dags

  • Vijay K. Naik
Chapter
  • 41 Downloads
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 236)

Abstract

A directed acyclic graph (dag, for short) in the shape of a diamond or a square represents the data dependencies observed in several different algorithms. It represents a straightforward way of computing the longest common subsequence of two strings [55, 6]. It also represents the rate determining data dependencies in an iteration of the Gauss-Siedel method used for numerically computing the solution of certain partial differential equations discretized by a five-point stencil [120].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • Vijay K. Naik
    • 1
  1. 1.Institute for Computer Applications in Science and EngineeringUSA

Personalised recommendations