• Home
• People
• Jobs
• Visit
• Thesis Topics
• Publications
• Research
• Performance
• Parallel Programming
• HTM for Graphs
• ftRMA
• foMPI_NA
• Active Access
• GMS
• NB Collectives
• Matchings-FPGA
• Polly-ACC
• PushPull
• FFlib
• sPIN
• DARE
• MPI Datatypes
• TinyMPI
• Par./Dist. Deep Learning
• Atomics
• CoMPIler
• GDI
• motifs-GNNs
• foMPI
• MPI Topologies
• dCUDA
• cDAG
• CLaMPI
• MODESTO
• Secure Communication
• Scalable Networking
• Bcast
• Teaching
• Contact

SPONSORS

COLLABORATIONS

Substream-Centric Graph Processing

The source code of the experiments in the papers listed below: LINK

FPGA'19	[1] M. Besta, M. Fischer, T. Ben-Nun, J. de Fine Licht, T. Hoefler:
		Substream-Centric Maximum Matchings on FPGA Feb. 2019, In Proceedings of the 27th ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (acceptance rate: 23%) Best Paper Finalist (4/30)

TRETS'20	[1] M. Besta, M. Fischer, T. Ben-Nun, D. Stanojevic, J. de Fine Licht, T. Hoefler:
		Substream-Centric Maximum Matchings on FPGA Jan. 2020, In Proceedings of the ACM Trans. Reconfig. Technol. Syst Special Issue, Invited Paper