Back to Results
First PageMeta Content
Spanning tree / Parallel computing / Message Passing Interface / Search algorithms / Hash function / Time complexity / MPICH / Theoretical computer science / Concurrent computing / Computing


Scalable Algorithms for Constructing Balanced Spanning Trees on System-ranked Process Groups Akhil Langer, Ramprasad Venkataraman, and Laxmikant Kale Department of Computer Science University of Illinois at Urbana-Champa
Add to Reading List

Document Date: 2012-09-08 17:52:14


Open Document

File Size: 326,68 KB

Share Result on Facebook

City

Shanghai / /

Company

IBM / Argonne National Laboratory / Hp / Parallel Programming Laboratory / Achieving Exascale Systems / Massively Parallel Systems / The Reference Centralized Algorithm Group / Cray Inc. / /

Country

China / /

/

Facility

MPI library / Computer Science University of Illinois / /

IndustryTerm

distributed tree construction algorithms / parent / runtime software / process / system-ranked process groups / linear systems / /

Organization

University of Illinois / National Science Foundation / Process Groups Akhil Langer / Ramprasad Venkataraman / and Laxmikant Kale Department / Lawrence Berkeley National Lab / /

Person

Peter Kogge / /

ProvinceOrState

Illinois / /

Technology

Virtual Machine / Exascale algorithms / three algorithms / Shrink-and-Balance algorithm / distributed algorithm / Rank-and-Hash algorithm / distributed algorithms / two distributed tree construction algorithms / two distributed algorithms / Divide-andConquer algorithms / caching / pdf / two algorithms / /

URL

http /

SocialTag