UTS

From HPCRL Wiki
(Difference between revisions)
Jump to: navigation, search
(New page: == Project Members == === The Ohio State University === * Professor P. Sadayappan * James Dinan * Gerald Sabin === University of Maryland === * Professor Chau-Wen Tseng === University...)
 
Line 1: Line 1:
 +
The Unbalanced Tree Search benchmark is a parallel benchmarking code that reports the performance achieved when performing exhaustive depth-first search on a highly unbalanced tree.  The tree is constructed using a splittable random number generator constructed by repeatedly applying the SHA-1 secure hash algorithm to
 +
 
== Project Members ==
 
== Project Members ==
  
Line 15: Line 17:
 
* Professor Jan Prins
 
* Professor Jan Prins
 
* Stephen Olivier
 
* Stephen Olivier
 +
 +
== Papers ==
 +
 +
'''Scalable Dynamic Load Balancing Using UPC''' [http://www.cs.unc.edu/~olivier/icpp08.pdf PDF]
 +
Stephen Olivier, Jan Prins.
 +
Proc. of 37th International Conference on Parallel Processing (ICPP-08). Portland, OR, September 2008.
 +
 +
'''A Message Passing Benchmark for Unbalanced Applications''' [http://dx.doi.org/10.1016/j.simpat.2008.06.004 DOI]
 +
James Dinan, Stephen Olivier, Gerald Sabin, Jan Prins, P. Sadayappan, Chau-Wen Tseng
 +
Simulation Modelling Practice and Theory, In Press. June, 2008.
 +
 +
'''Dynamic Load Balancing of Unbalanced Computations Using Message Passing''' [http://www.cse.ohio-state.edu/~dinan/research/ldbal/UTS_PMEO07.pdf PDF] [http://www.cse.ohio-state.edu/~dinan/research/ldbal/UTS_PMEO07-slides.ppt Slides]
 +
James Dinan, Stephen Olivier, Jan Prins, Gerald Sabin, P Sadayappan and Chau-Wen Tseng.
 +
Proc. of 6th Intl. Workshop on Performance Modeling, Evaluation, and Optimization of
 +
Parallel and Distributed Systems (PMEO-PDS 2007). Long Beach, CA, March 26-30, 2007.
 +
 +
'''UTS: An Unbalanced Tree Search Benchmark''' [http://www.cse.ohio-state.edu/~dinan/research/ldbal/UTS_LCPC06.pdf PDF]
 +
Stephen Olivier, Jun Huan, Jinze Liu, Jan Prins, James Dinan, P Sadayappan and Chau-Wen Tseng.
 +
Proceedings of 19th Intl. Workshop on Languages and Compilers for Parallel Computing (LCPC 2006).
  
 
== Download ==
 
== Download ==
  
 
We are cleaning up our code for a public release.  If you'd like a pre-release copy of the benchmark, please contact James Dinan via email at dinan-at-cse.ohio-state.edu.
 
We are cleaning up our code for a public release.  If you'd like a pre-release copy of the benchmark, please contact James Dinan via email at dinan-at-cse.ohio-state.edu.

Revision as of 18:48, 12 May 2009

The Unbalanced Tree Search benchmark is a parallel benchmarking code that reports the performance achieved when performing exhaustive depth-first search on a highly unbalanced tree. The tree is constructed using a splittable random number generator constructed by repeatedly applying the SHA-1 secure hash algorithm to

Contents

Project Members

The Ohio State University

  • Professor P. Sadayappan
  • James Dinan
  • Gerald Sabin

University of Maryland

  • Professor Chau-Wen Tseng

University of North Carolina

  • Professor Jan Prins
  • Stephen Olivier

Papers

Scalable Dynamic Load Balancing Using UPC PDF
Stephen Olivier, Jan Prins.
Proc. of 37th International Conference on Parallel Processing (ICPP-08). Portland, OR, September 2008. 
A Message Passing Benchmark for Unbalanced Applications DOI
James Dinan, Stephen Olivier, Gerald Sabin, Jan Prins, P. Sadayappan, Chau-Wen Tseng
Simulation Modelling Practice and Theory, In Press. June, 2008.
Dynamic Load Balancing of Unbalanced Computations Using Message Passing PDF Slides
James Dinan, Stephen Olivier, Jan Prins, Gerald Sabin, P Sadayappan and Chau-Wen Tseng.
Proc. of 6th Intl. Workshop on Performance Modeling, Evaluation, and Optimization of
Parallel and Distributed Systems (PMEO-PDS 2007). Long Beach, CA, March 26-30, 2007.
UTS: An Unbalanced Tree Search Benchmark PDF
Stephen Olivier, Jun Huan, Jinze Liu, Jan Prins, James Dinan, P Sadayappan and Chau-Wen Tseng.
Proceedings of 19th Intl. Workshop on Languages and Compilers for Parallel Computing (LCPC 2006).

Download

We are cleaning up our code for a public release. If you'd like a pre-release copy of the benchmark, please contact James Dinan via email at dinan-at-cse.ohio-state.edu.

Personal tools