Sciweavers

1016 search results - page 151 / 204
» Parallelism Constraints
Sort
View
BMCBI
2005
107views more  BMCBI 2005»
13 years 8 months ago
ProbeMaker: an extensible framework for design of sets of oligonucleotide probes
Background: Procedures for genetic analyses based on oligonucleotide probes are powerful tools that can allow highly parallel investigations of genetic material. Such procedures r...
Johan Stenberg, Mats Nilsson, Ulf Landegren
JSSPP
2010
Springer
13 years 6 months ago
Hierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
Yinglong Xia, Viktor K. Prasanna, James Li
BMCBI
2011
13 years 13 days ago
A user-friendly web portal for T-Coffee on supercomputers
Background: Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is t...
Josep Rius Torrento, Fernando Cores, Francesc Sols...
DATE
2006
IEEE
100views Hardware» more  DATE 2006»
14 years 2 months ago
Simulation and analysis of network on chip architectures: ring, spidergon and 2D mesh
NoC architectures can be adopted to support general communications among multiple IPs over multi-processor Systems on Chip (SoCs). In this work we illustrate the modeling and simu...
Luciano Bononi, Nicola Concer
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 10 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...