Sciweavers

835 search results - page 101 / 167
» On optimal slicing of parallel programs
Sort
View
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 10 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
IISWC
2009
IEEE
14 years 4 months ago
Phoenix rebirth: Scalable MapReduce on a large-scale shared-memory system
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
Richard M. Yoo, Anthony Romano, Christos Kozyrakis
EUROPAR
2004
Springer
14 years 3 months ago
A Fusion-Embedded Skeleton Library
Abstract. This paper addresses a new framework for designing and implementing skeleton libraries, in which each skeleton should not only be efficiently implemented as is usually d...
Kiminori Matsuzaki, Kazuhiko Kakehi, Hideya Iwasak...
HPCN
1994
Springer
14 years 2 months ago
Experiments with HPF Compilation for a Network of Workstations
Abstract. High Performance Fortran (hpf) is a data-parallel Fortran for Distributed Memory Multiprocessors. Hpf provides an interesting programming model but compilers are yet to c...
Fabien Coelho
INFOCOM
2011
IEEE
13 years 2 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...