Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths.

U. Bondhugula, A. Devulapalli, J. Dinan, J. Fernando, P. Wyckoff, E. Stahlberg, and P. Sadayappan. FCCM, page 152-164. IEEE Computer Society, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. James Foster University of Stuttgart

Samuel James Tovey University of Stuttgart

Other publications of authors with the same name

Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths.U. Bondhugula, A. Devulapalli, J. Dinan, J. Fernando, P. Wyckoff, E. Stahlberg, and P. Sadayappan. FCCM, page 152-164. IEEE Computer Society, (2006)Leveraging MPI's One-Sided Communication Interface for Shared-Memory Programming.T. Hoefler, J. Dinan, D. Buntinas, P. Balaji, B. Barrett, R. Brightwell, W. Gropp, V. Kale, and R. Thakur. EuroMPI, volume 7490 of Lecture Notes in Computer Science, page 132-141. Springer, (2012)Design and Implementation of OpenSHMEM Using OFI on the Aries Interconnect.K. Seager, S. Choi, J. Dinan, H. Pritchard, and S. Sur. OpenSHMEM, volume 10007 of Lecture Notes in Computer Science, page 97-113. Springer, (2016)Global trees: a framework for linked data structures on distributed memory parallel systems.D. Larkins, J. Dinan, S. Krishnamoorthy, S. Parthasarathy, A. Rountev, and P. Sadayappan. SC, page 57. IEEE/ACM, (2008)Poster: High-level, one-sided programming models on MPI: a case study with global arrays and NWChem.J. Dinan, P. Balaji, J. Hammond, S. Krishnamoorthy, and V. Tipparaju. SC Companion, page 37-38. ACM, (2011)Hybrid parallel programming with MPI and unified parallel C.J. Dinan, P. Balaji, E. Lusk, P. Sadayappan, and R. Thakur. Conf. Computing Frontiers, page 177-186. ACM, (2010)Scioto: A Framework for Global-View Task Parallelism.J. Dinan, S. Krishnamoorthy, D. Larkins, J. Nieplocha, and P. Sadayappan. ICPP, page 586-593. IEEE Computer Society, (2008)pVOCL: Power-Aware Dynamic Placement and Migration in Virtualized GPU Environments.P. Lama, Y. Li, A. Aji, P. Balaji, J. Dinan, S. Xiao, Y. Zhang, W. chun Feng, R. Thakur, and X. Zhou. ICDCS, page 145-154. IEEE Computer Society, (2013)Load Balancing of Dynamical Nucleation Theory Monte Carlo Simulations through Resource Sharing Barriers.H. Arafat, P. Sadayappan, J. Dinan, S. Krishnamoorthy, and T. Windus. IPDPS, page 285-295. IEEE Computer Society, (2012)PARDA: A Fast Parallel Reuse Distance Analysis Algorithm.Q. Niu, J. Dinan, Q. Lu, and P. Sadayappan. IPDPS, page 1284-1294. IEEE Computer Society, (2012)

PUMA

Disambiguation of "Dinan, James"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths.

Please choose a person to relate this publication to

Univ. -Prof. Dr. James Foster University of Stuttgart

Samuel James Tovey University of Stuttgart

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Dinan, James"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths.

Please choose a person to relate this publication to

Univ. -Prof. Dr. James Foster University of Stuttgart

Samuel James Tovey University of Stuttgart

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths.