Sciweavers

2609 search results - page 113 / 522
» Optimizing for parallelism and data locality
Sort
View
99
Voted
MST
2000
101views more  MST 2000»
15 years 13 days ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
92
Voted
ICML
2008
IEEE
16 years 1 months ago
Localized multiple kernel learning
Recently, instead of selecting a single kernel, multiple kernel learning (MKL) has been proposed which uses a convex combination of kernels, where the weight of each kernel is opt...
Ethem Alpaydin, Mehmet Gönen
SC
2003
ACM
15 years 6 months ago
SCALLOP: A Highly Scalable Parallel Poisson Solver in Three Dimensions
SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular block-structured domains. SCALLOP avoids high communication overheads algor...
Gregory T. Balls, Scott B. Baden, Phillip Colella
124
Voted
AIPS
2007
15 years 3 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
HPDC
2008
IEEE
15 years 7 months ago
DataLab: transactional data-parallel computing on an active storage cloud
Active storage clouds are an attractive platform for executing large data intensive workloads found in many fields of science. However, active storage presents new system managem...
Brandon Rich, Douglas Thain