Sciweavers

Share
110 search results - page 1 / 22
» Hyperplane Partitioning: An Approach to Global Data Partitio...
Sort
View
IPPS
1999
IEEE
9 years 8 months ago
Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory Machines
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...
S. R. Prakash, Y. N. Srikant
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
9 years 7 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
IEEEPACT
2000
IEEE
9 years 8 months ago
Global Register Partitioning
Modern computers have taken advantage of the instruction-level parallelism (ILP) available in programs with advances in both architecture and compiler design. Unfortunately, large...
Jason Hiser, Steve Carr, Philip H. Sweany
CGO
2006
IEEE
9 years 9 months ago
Compiler-directed Data Partitioning for Multicluster Processors
Multicluster architectures overcome the scaling problem of centralized resources by distributing the datapath, register file, and memory subsystem across multiple clusters connec...
Michael L. Chu, Scott A. Mahlke
IPPS
1997
IEEE
9 years 7 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
books