Sciweavers

7065 search results - page 384 / 1413
» Iterative Scheduling Algorithms
Sort
View
MOC
2000
62views more  MOC 2000»
15 years 6 months ago
Uzawa type algorithms for nonsymmetric saddle point problems
In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block fo...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
ICASSP
2011
IEEE
14 years 10 months ago
Sparse spectral factorization: Unicity and reconstruction algorithms
Spectral factorization is a classical tool in signal processing and communications. It also plays a critical role in X-ray crystallography, in the context of phase retrieval. In t...
Yue M. Lu, Martin Vetterli
CISS
2008
IEEE
16 years 1 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
EUROSYS
2011
ACM
14 years 10 months ago
Is co-scheduling too expensive for SMP VMs?
Symmetric multiprocessing (SMP) virtual machines (VMs) allow users to take advantage of a multiprocessor infrastructure. Despite the advantage, SMP VMs can cause synchronization l...
Orathai Sukwong, Hyong S. Kim
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 7 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....