NSF award 2554012 · George Mason University

Collaborative Research: SHF: Hierarchical Optimization of Ragged Tensor Operators for Deep Learning Workloads

Final report due

28 October 2029

in 1,106 days · The award ends on 30 June 2029.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Mar 2029in 866 days
award ending 2029-06-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 May 2029in 941 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Jun 2029in 976 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Oct 2029in 1106 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Oct 2029in 1106 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Oct 2029in 1106 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 30 June 2029.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 October 2029.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2554012
Period of support: 15 Jul 2026 – 30 Jun 2029
Amount: $362,095
Awardee: George Mason University, Fairfax, VA
Program: Software & Hardware Foundation
Directorate: CSE

Abstract

Artificial intelligence (AI) applications such as large language models and graph-based learning systems increasingly rely on processing irregular data, where inputs vary in size and structure across tasks. This irregularity leads to inefficiencies in current AI frameworks, which are primarily designed for uniform workloads. As a result, significant computational resources are wasted, limiting the scalability,…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.