Sciweavers

1389 search results - page 7 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
IPL
2002
86views more  IPL 2002»
13 years 8 months ago
A polynomial algorithm for lot-size scheduling of two type tasks
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Mikhail Y. Kovalyov, Marcus Pattloch, Günter ...
TPDS
2010
174views more  TPDS 2010»
13 years 6 months ago
Parallel Two-Sided Matrix Reduction to Band Bidiagonal Form on Multicore Architectures
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
Hatem Ltaief, Jakub Kurzak, Jack Dongarra
JDA
2008
93views more  JDA 2008»
13 years 8 months ago
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochu...
IJPP
2007
91views more  IJPP 2007»
13 years 8 months ago
A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Masato...
IPPS
2002
IEEE
14 years 1 months ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu