Sciweavers

2183 search results - page 223 / 437
» Generating Parallel Algorithms for Cluster and Grid Computin...
Sort
View
97
Voted
IPPS
1998
IEEE
15 years 2 months 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
91
Voted
ICPP
2006
IEEE
15 years 4 months ago
Data Sharing Pattern Aware Scheduling on Grids
These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, da...
Young Choon Lee, Albert Y. Zomaya
PACT
2005
Springer
15 years 3 months ago
OpenTS: An Outline of Dynamic Parallelization Approach
The paper is dedicated to an open T-system (OpenTS) — a programming system that supports automatic parallelization of computations for high-performance and distributed applicatio...
Sergey Abramov, Alexey I. Adamovich, Alexander Iny...
FGCS
2010
119views more  FGCS 2010»
14 years 8 months ago
Characterizing fault tolerance in genetic programming
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
Daniel Lombraña Gonzalez, Francisco Fern&aa...
104
Voted
CLUSTER
2008
IEEE
15 years 4 months ago
Enabling lock-free concurrent fine-grain access to massive distributed data: Application to supernovae detection
—We consider the problem of efficiently managing massive data in a large-scale distributed environment. We consider data strings of size in the order of Terabytes, shared and ac...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé