Sciweavers

674 search results - page 15 / 135
» The computational complexity of the parallel knock-out probl...
Sort
View
MMAS
2010
Springer
13 years 2 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
SPAA
2006
ACM
14 years 1 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
HPDC
2000
IEEE
13 years 11 months ago
An Enabling Framework for Master-Worker Applications on the Computational Grid
We describe MW – a software framework that allows users to quickly and easily parallelize scientific computations using the master-worker paradigm on the computationalgrid. MW ...
Jean-Pierre Goux, Sanjeev Kulkarni, Jeff Linderoth...
PDPTA
2008
13 years 8 months ago
A Parallel Processing Architecture for Solving Large-Scale Linear Systems
Solving linear systems with a large number of variables is at the core of many scienti c problems. Parallel processing techniques for solving such systems have received much attent...
Arun Nagari, Itamar Elhanany, Ben Thompson, Fangxi...
BIRTHDAY
2003
Springer
14 years 19 days ago
Distributed Cooperation and Adversity: Complexity Trade-Offs
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
Chryssis Georgiou, Alexander Russell, Alexander A....