SPX: Collaborative Research: SANDY: Sparsification-Based Approach for Analyzing Network Dynamics

SPX：协作研究：SANDY：基于稀疏化的网络动态分析方法

基本信息

批准号：
1916084
负责人：
Sanjukta Bhowmick
金额：
$ 17.96万
依托单位：
University of North Texas
依托单位国家：
美国
项目类别：
Continuing Grant
财政年份：
2018
资助国家：
美国
起止时间：
2018-09-01 至 2022-08-31
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1916084&HistoricalAwards=false
关键词：
SPX Collaborative Research SANDY Sparsification

项目摘要

The goal of this three-year project, Sparsification-based Approach for Analyzing Network Dynamics (SANDY), is to develop a suite of scalable parallel algorithms for updating dynamic networks for different problems that can be executed on a wide range of HPC platforms. Dynamic network analysis will enable researchers to study the evolution of complex systems in diverse disciplines, such as bioinformatics, social sciences, and epidemiology. The SANDY project is expected to initiate a new direction of research in developing parallel dynamic network algorithms that will benefit multiple analysis objectives (e.g., motif finding and network alignment) and application domains (e.g., epidemiology, health care). Research findings will be integrated into courses on network analysis, parallel algorithms, and bioinformatics offered at the three collaborating institutions. The PIs will collaborate with high schools to deliver talks on network theory, and encourage women and minority students to pursue IT-related careers. To develop efficient and scalable parallel algorithms, the PIs propose to use an elegant technique, called graph sparsification, that expresses graph algorithms in a reduction-like fashion. The formal steps to parallelization, as guided by the graph sparsification framework, provide a template for creating provably correct parallel algorithms for dynamic networks. The proposed algorithms will address the dual needs of portability and performance optimization. The framework will further provide a mechanism for combining high level (e.g., static and dynamic graph partitioning) and low level (e.g., dataflow algorithms) tuning strategies to ensure high performance and scalability for various parallel architectures by considering such factors as scalability, time, memory, and energy efficiency.

这个为期三年的项目“基于稀疏化的网络动态分析方法”(SANDY) 的目标是开发一套可扩展的并行算法，用于针对不同问题更新动态网络，这些算法可以在各种 HPC 平台上执行。动态网络分析将使研究人员能够研究生物信息学、社会科学和流行病学等不同学科的复杂系统的演化。 SANDY 项目预计将在开发并行动态网络算法方面开创一个新的研究方向，这将有利于多种分析目标（例如，基序查找和网络对齐）和应用领域（例如，流行病学、医疗保健）。研究成果将被纳入三个合作机构提供的网络分析、并行算法和生物信息学课程中。 PI 将与高中合作举办网络理论讲座，并鼓励女性和少数族裔学生从事 IT 相关职业。为了开发高效且可扩展的并行算法，PI 建议使用一种称为图稀疏化的优雅技术，该技术以类似简化的方式表达图算法。在图稀疏框架的指导下，并行化的正式步骤提供了一个模板，用于为动态网络创建可证明正确的并行算法。所提出的算法将满足可移植性和性能优化的双重需求。该框架将进一步提供一种结合高层（例如静态和动态图分区）和低层（例如数据流算法）调整策略的机制，通过考虑可扩展性、时间、内存和能源效率。

项目成果

期刊论文数量（7）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

Single-Source Shortest Path Tree for Big Dynamic Graphs

大动态图的单源最短路径树

DOI：
10.1109/bigdata.2018.8622042
发表时间：
2018
期刊：
IEEE International Conference on Big Data
影响因子：
0
作者：
Riazi, Sara;Srinivasan, Sriram;Das, Sajal K.;Bhowmick, Sanjukta;Norris, Boyana
通讯作者：
Norris, Boyana

Applying a Probabilistic Infection Model for studying contagion processes in contact networks

DOI：
10.1016/j.jocs.2021.101419
发表时间：
2021-07-27
期刊：
JOURNAL OF COMPUTATIONAL SCIENCE
影响因子：
3.3
作者：
Qian, William;Bhowmick, Sanjukta;Mikler, Armin R.
通讯作者：
Mikler, Armin R.

Partitioning Communication Streams Into Graph Snapshots

将通信流划分为图形快照

DOI：
10.1109/tnse.2022.3223614
发表时间：
2022
期刊：
IEEE Transactions on Network Science and Engineering
影响因子：
6.6
作者：
Wendt, Jeremy D.;Field, Richard V.;Phillips, Cynthia A.;Prasadan, Arvind;Wilson, Tegan;Soundarajan, Sucheta;Bhowmick, Sanjukta
通讯作者：
Bhowmick, Sanjukta

A Shared-Memory Algorithm for Updating Tree-Based Properties of Large Dynamic Networks

一种用于更新大型动态网络的基于树的属性的共享内存算法

DOI：
10.1109/tbdata.2018.2870136
发表时间：
2018
期刊：
IEEE Transactions on Big Data
影响因子：
7.2
作者：
Srinivasan, Sriram;Pollard, Samuel;Das, Sajal K.;Norris, Boyana;Bhowmick, Sanjukta
通讯作者：
Bhowmick, Sanjukta

A Shared-Memory Parallel Algorithm for Updating Single-Source Shortest Paths in Large Dynamic Networks

大型动态网络中单源最短路径更新的共享内存并行算法

DOI：
10.1109/hipc.2018.00035
发表时间：
2018
期刊：
2018 IEEE 25th International Conference on High Performance Computing (HiPC
影响因子：
0
作者：
Srinivasan, Sriram;Riazi, Sara;Norris, Boyana;Das, Sajal K.;Bhowmick, Sanjukta
通讯作者：
Bhowmick, Sanjukta