Pairwise Grouping of Adjacent Nodes

  • Shuvra S. Battacharyya
  • Praveen K. Murthy
  • Edward A. Lee
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 360)

Abstract

In the original Pairwise Grouping of Adjacent Nodes (PGAN) technique for joint code and data minimization, a cluster hierarchy is constructed by clustering exactly two adjacent vertices at each step [Bhat93]. At each clustering step, a pair of adjacent actors is chosen that maximizes ρ({A, B}), the repetition count of the adjacent pair, over all clusterable adjacent pairs {A, B}. Recall from Section 4.3 that ρ(Z) can be viewed as the number of times a minimal periodic schedule for the subset of actors Z is invoked in the given SDF graph, and thus, we see that the PGAN technique repeatedly clusters adjacent pairs whose associated subgraphs are invoked most frequently in a valid schedule.

Keywords

Decid 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Shuvra S. Battacharyya
    • 1
  • Praveen K. Murthy
    • 2
  • Edward A. Lee
    • 2
  1. 1.Hitachi America, Ltd.USA
  2. 2.University of CaliforniaBerkeleyUSA

Personalised recommendations