Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IPPS
1999
IEEE

favoriteEmaildiscussreport

110views Distributed And Parallel Com...» more IPPS 1999»

Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory Machines

13 years 9 months ago

Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory Machines

Download ipdps.cc.gatech.edu

Automatic Global Data Partitioning for Distributed Memory Machines DMMs is a di cult problem. In this work, we present a partitioning strategy called 'Hyperplane Partitioning' which works well loops with nonuniform dependences also. Several optimizations and an implementation on IBM-SP2 are described.

S. R. Prakash, Y. N. Srikant

Real-time Traffic

Distributed And Parallel Computing | Global Data Partitioning | Hyperplane Partitioning | IPPS 1999 | Partitioning Strategy |

claim paper

Related Content

» Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning

» Global Register Partitioning

» Compilerdirected Data Partitioning for Multicluster Processors

» Globally Optimizing Graph Partitioning Problems Using Message Passing

» A Keybased Adaptive Transactional Memory Executor

» Maintaining Spatial Data Sets in DistributedMemory Machines

» A global address space framework for locality aware scheduling of blocksparse computations

» Graph Mining based on a Data Partitioning Approach

» Productivity and performance using partitioned global address space languages

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	IPPS
Authors	S. R. Prakash, Y. N. Srikant

Comments (0)