Sciweavers

1646 search results - page 80 / 330
» Automatic generation of two-party computations
Sort
View
TPDS
2002
136views more  TPDS 2002»
13 years 7 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
HPCA
2008
IEEE
14 years 8 months ago
Automated microprocessor stressmark generation
Estimating the maximum power and thermal characteristics of a processor is essential for designing its power delivery system, packaging, cooling, and power/thermal management sche...
Ajay M. Joshi, Lieven Eeckhout, Lizy Kurian John, ...
CLOUDCOM
2010
Springer
13 years 5 months ago
Efficient Metadata Generation to Enable Interactive Data Discovery over Large-Scale Scientific Data Collections
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...
Sangmi Lee Pallickara, Shrideep Pallickara, Milija...
IPPS
2000
IEEE
14 years 6 days ago
Pipelining Wavefront Computations: Experiences and Performance
Abstract. Wavefront computations are common in scientific applications. Although it is well understood how wavefronts are pipelined for parallel execution, the question remains: H...
E. Christopher Lewis, Lawrence Snyder
IPPS
1998
IEEE
14 years 2 days ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu