Sciweavers

1113 search results - page 29 / 223
» Performance under Failures of DAG-based Parallel Computing
Sort
View
FGCS
2010
119views more  FGCS 2010»
13 years 6 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...
SRDS
2008
IEEE
14 years 1 months ago
Probabilistic Failure Detection for Efficient Distributed Storage Maintenance
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
Jing Tian, Zhi Yang, Wei Chen, Ben Y. Zhao, Yafei ...
PARLE
1993
13 years 11 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
Robert Marek, Erhard Rahm
HIPC
2003
Springer
14 years 19 days ago
Performance Analysis of Blue Gene/L Using Parallel Discrete Event Simulation
High performance computers currently under construction, such as IBM’s Blue Gene/L, consisting of large numbers (64K) of low cost processing elements with relatively small local...
Ed Upchurch, Paul L. Springer, Maciej Brodowicz, S...
EUROPAR
2000
Springer
13 years 11 months ago
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
Vítor Santos Costa, Ricardo Rocha, Fernando...