Sciweavers

74 search results - page 8 / 15
» Decomposing Linear Programs for Parallel Solution
Sort
View
PLDI
2004
ACM
14 years 27 days ago
Min-cut program decomposition for thread-level speculation
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykuma...
GLOBECOM
2009
IEEE
14 years 2 months ago
Maximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Xiaohua Jia,...
VECPAR
2004
Springer
14 years 24 days ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
PPSC
2001
13 years 8 months ago
Airline Crew Pairing Generation in Parallel
Crew pairing generation is a time consuming part of the complex process of airline crew scheduling. We present a parallel algorithm for this problem's solution and several im...
Diego Klabjan, Karsten Schwan
EUROPAR
2008
Springer
13 years 9 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler