[sourabhuday]

Motivation

This adds a new performance test with programmable number of graph nodes for different topologies
straight, parallel(all kernel nodes), mixed(memcpy and kernel nodes) and hexagon(graphs that converge)
Demonstrates several results including

1. Graph instantiation time
2. First Graph launch times
3. Repeat graph launch times
4. Graph launch + device execution

Technical Details

Test Plan

Test Result

Submission Checklist

• Look over the contributing guidelines at https://github.com/ROCm/ROCm/blob/develop/CONTRIBUTING.md#pull-requests.

[Copilot]

Pull Request Overview

This PR adds a new performance benchmark test for HIP graphs with programmable topologies to measure graph performance across different structures. The test evaluates graph instantiation time, first launch time, repeat launch times, and end-to-end execution for various graph topologies.

Key changes:

• Adds a standalone graph topology performance testing tool with support for straight, parallel, mixed, and hexagon topologies
• Implements comprehensive timing measurements including CPU overhead and device execution time
• Provides configurable parameters for graph size, repetitions, and output formats

Reviewed Changes

Copilot reviewed 2 out of 2 changed files in this pull request and generated 5 comments.

File	Description
hipGraphTopology.cpp	New performance test implementation with topology generation and timing measurement
CMakeLists.txt	Adds reference to new test file for build system

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}

[saleelk]

Please chekc comments